/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:42:21,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:42:22,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:42:22,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:42:22,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:42:22,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:42:22,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:42:22,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:42:22,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:42:22,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:42:22,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:42:22,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:42:22,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:42:22,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:42:22,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:42:22,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:42:22,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:42:22,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:42:22,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:42:22,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:42:22,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:42:22,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:42:22,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:42:22,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:42:22,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:42:22,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:42:22,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:42:22,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:42:22,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:42:22,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:42:22,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:42:22,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:42:22,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:42:22,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:42:22,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:42:22,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:42:22,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:42:22,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:42:22,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:42:22,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:42:22,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:42:22,044 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:42:22,058 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:42:22,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:42:22,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:42:22,059 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:42:22,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:42:22,060 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:42:22,060 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:42:22,060 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:42:22,060 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:42:22,060 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:42:22,061 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:42:22,061 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:42:22,061 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:42:22,061 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:42:22,061 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:42:22,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:42:22,062 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:42:22,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:42:22,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:42:22,062 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:42:22,062 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:42:22,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:42:22,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:42:22,063 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:42:22,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:42:22,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:42:22,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:42:22,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:42:22,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:42:22,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:42:22,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:42:22,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:42:22,246 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:42:22,246 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:42:22,247 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:42:22,348 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_UWzd1Y/tmp/f5e66262189e4c51affdd4b1a19aa733/FLAG9c7b07d17 !SESSION 2020-07-01 12:42:19.820 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_UWzd1Y/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-07-01 12:42:22.619 !MESSAGE Indexed 'FLAG9c7b07d17' (0 sources, 0 headers) in 0.007 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-07-01 12:42:22,698 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:42:22,699 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:42:22,699 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:42:22,706 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_UWzd1Y/tmp/f5e66262189e4c51affdd4b1a19aa733/FLAG9c7b07d17 [2020-07-01 12:42:23,245 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_UWzd1Y/tmp/f5e66262189e4c51affdd4b1a19aa733 [2020-07-01 12:42:23,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:42:23,258 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:42:23,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:42:23,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:42:23,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:42:23,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644a65e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23, skipping insertion in model container [2020-07-01 12:42:23,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:42:23,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:42:23,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:42:23,539 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:42:23,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:42:23,572 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:42:23,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23 WrapperNode [2020-07-01 12:42:23,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:42:23,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:42:23,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:42:23,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:42:23,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:42:23,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:42:23,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:42:23,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:42:23,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:42:23,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:42:23,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:42:23,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:42:23,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:42:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:42:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:42:23,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:42:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:42:23,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:42:23,912 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:42:23,913 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:42:23,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:23 BoogieIcfgContainer [2020-07-01 12:42:23,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:42:23,917 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:42:23,917 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:42:23,919 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:42:23,920 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:23" (1/1) ... [2020-07-01 12:42:23,934 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 22 edges [2020-07-01 12:42:23,936 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:42:23,936 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:42:23,937 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:42:23,937 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:42:23,939 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:42:23,940 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:42:23,940 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:42:23,961 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:42:23,983 INFO L200 BlockEncoder]: SBE split 5 edges [2020-07-01 12:42:23,987 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:42:23,989 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:42:24,024 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 12:42:24,027 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:42:24,028 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:42:24,028 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:42:24,029 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:42:24,029 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:42:24,029 INFO L313 BlockEncoder]: Encoded RCFG 10 locations, 17 edges [2020-07-01 12:42:24,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:42:24 BasicIcfg [2020-07-01 12:42:24,030 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:42:24,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:42:24,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:42:24,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:42:24,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:42:23" (1/4) ... [2020-07-01 12:42:24,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a002f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:42:24, skipping insertion in model container [2020-07-01 12:42:24,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (2/4) ... [2020-07-01 12:42:24,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a002f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:42:24, skipping insertion in model container [2020-07-01 12:42:24,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:23" (3/4) ... [2020-07-01 12:42:24,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a002f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:42:24, skipping insertion in model container [2020-07-01 12:42:24,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:42:24" (4/4) ... [2020-07-01 12:42:24,039 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:42:24,049 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:42:24,056 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-01 12:42:24,070 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-01 12:42:24,093 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:42:24,093 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:42:24,093 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:42:24,093 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:42:24,093 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:42:24,093 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:42:24,094 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:42:24,094 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:42:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-07-01 12:42:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:42:24,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:24,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:24,115 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1884026968, now seen corresponding path program 1 times [2020-07-01 12:42:24,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:24,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812812185] [2020-07-01 12:42:24,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:24,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812812185] [2020-07-01 12:42:24,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:24,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:42:24,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358545247] [2020-07-01 12:42:24,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:42:24,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:24,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:42:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:24,313 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2020-07-01 12:42:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:24,357 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2020-07-01 12:42:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:42:24,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:42:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:24,371 INFO L225 Difference]: With dead ends: 16 [2020-07-01 12:42:24,371 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 12:42:24,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:42:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 12:42:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 12:42:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 12:42:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-07-01 12:42:24,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 7 [2020-07-01 12:42:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:24,410 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-07-01 12:42:24,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:42:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-07-01 12:42:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:42:24,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:24,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:24,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:42:24,413 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1884056759, now seen corresponding path program 1 times [2020-07-01 12:42:24,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:24,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976476343] [2020-07-01 12:42:24,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:24,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976476343] [2020-07-01 12:42:24,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:24,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:42:24,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946557598] [2020-07-01 12:42:24,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:42:24,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:42:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:42:24,481 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2020-07-01 12:42:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:24,566 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. [2020-07-01 12:42:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:42:24,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 12:42:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:24,586 INFO L225 Difference]: With dead ends: 10 [2020-07-01 12:42:24,586 INFO L226 Difference]: Without dead ends: 9 [2020-07-01 12:42:24,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:42:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-01 12:42:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-01 12:42:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 12:42:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-07-01 12:42:24,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 7 [2020-07-01 12:42:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:24,590 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-07-01 12:42:24,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:42:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2020-07-01 12:42:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:42:24,591 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:24,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:24,591 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:42:24,592 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:24,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1884056760, now seen corresponding path program 1 times [2020-07-01 12:42:24,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:24,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295138780] [2020-07-01 12:42:24,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:24,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295138780] [2020-07-01 12:42:24,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:24,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:42:24,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241558583] [2020-07-01 12:42:24,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:42:24,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:24,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:42:24,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:42:24,643 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 5 states. [2020-07-01 12:42:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:24,715 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-01 12:42:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:42:24,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 12:42:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:24,716 INFO L225 Difference]: With dead ends: 13 [2020-07-01 12:42:24,716 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 12:42:24,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:42:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 12:42:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-01 12:42:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:42:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 12:42:24,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2020-07-01 12:42:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:24,721 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 12:42:24,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:42:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 12:42:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:42:24,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:24,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:24,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:42:24,722 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:24,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:24,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1884056761, now seen corresponding path program 1 times [2020-07-01 12:42:24,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:24,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378704771] [2020-07-01 12:42:24,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:24,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378704771] [2020-07-01 12:42:24,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:24,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:42:24,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610557049] [2020-07-01 12:42:24,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:42:24,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:42:24,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:42:24,794 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 6 states. [2020-07-01 12:42:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:24,900 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-01 12:42:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:42:24,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:42:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:24,901 INFO L225 Difference]: With dead ends: 12 [2020-07-01 12:42:24,901 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:42:24,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:42:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:42:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 12:42:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:42:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-01 12:42:24,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 7 [2020-07-01 12:42:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:24,905 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-01 12:42:24,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:42:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-01 12:42:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:42:24,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:24,906 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:24,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:42:24,907 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1302662452, now seen corresponding path program 1 times [2020-07-01 12:42:24,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:24,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37495848] [2020-07-01 12:42:24,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:24,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37495848] [2020-07-01 12:42:24,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962366658] [2020-07-01 12:42:24,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:42:25,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:25,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:42:25,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698665815] [2020-07-01 12:42:25,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:42:25,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:42:25,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:42:25,062 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 8 states. [2020-07-01 12:42:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,172 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-01 12:42:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:42:25,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-07-01 12:42:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,173 INFO L225 Difference]: With dead ends: 12 [2020-07-01 12:42:25,173 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:42:25,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:42:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:42:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 12:42:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:42:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-07-01 12:42:25,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 10 [2020-07-01 12:42:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,177 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-01 12:42:25,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:42:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-07-01 12:42:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:42:25,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,178 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:25,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:25,379 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:25,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1302662453, now seen corresponding path program 1 times [2020-07-01 12:42:25,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:25,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965165038] [2020-07-01 12:42:25,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965165038] [2020-07-01 12:42:25,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111985419] [2020-07-01 12:42:25,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:25,516 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 12:42:25,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:25,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:42:25,564 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:25,572 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:25,573 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:25,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-01 12:42:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:25,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:25,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-07-01 12:42:25,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805864519] [2020-07-01 12:42:25,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 12:42:25,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:25,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 12:42:25,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:42:25,682 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 14 states. [2020-07-01 12:42:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:25,944 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-01 12:42:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:42:25,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2020-07-01 12:42:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:25,945 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:42:25,945 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:42:25,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:42:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:42:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-07-01 12:42:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:42:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-01 12:42:25,950 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 10 [2020-07-01 12:42:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:25,950 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-01 12:42:25,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 12:42:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-01 12:42:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:42:25,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:25,951 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:26,152 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1302663414, now seen corresponding path program 1 times [2020-07-01 12:42:26,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663366084] [2020-07-01 12:42:26,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663366084] [2020-07-01 12:42:26,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:26,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:42:26,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500734511] [2020-07-01 12:42:26,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:42:26,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:42:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:26,185 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 4 states. [2020-07-01 12:42:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,207 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-01 12:42:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:42:26,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:42:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,208 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:42:26,209 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:42:26,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:42:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:42:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:42:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-07-01 12:42:26,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 10 [2020-07-01 12:42:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,213 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-01 12:42:26,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:42:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-01 12:42:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:42:26,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,214 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:42:26,215 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1331292565, now seen corresponding path program 1 times [2020-07-01 12:42:26,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865344055] [2020-07-01 12:42:26,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:42:26,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865344055] [2020-07-01 12:42:26,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:26,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:42:26,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273266932] [2020-07-01 12:42:26,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:42:26,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:42:26,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:26,243 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2020-07-01 12:42:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,271 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-07-01 12:42:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:42:26,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:42:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,272 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:42:26,272 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:42:26,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:42:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:42:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:42:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:42:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-01 12:42:26,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2020-07-01 12:42:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,276 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-01 12:42:26,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:42:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-01 12:42:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:42:26,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,277 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:26,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:42:26,278 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:26,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1707029703, now seen corresponding path program 2 times [2020-07-01 12:42:26,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:26,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306230546] [2020-07-01 12:42:26,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306230546] [2020-07-01 12:42:26,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903923995] [2020-07-01 12:42:26,418 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:26,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:42:26,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:42:26,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-01 12:42:26,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:26,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:42:26,467 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:42:26,474 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:42:26,475 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:42:26,475 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-01 12:42:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:26,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:26,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-07-01 12:42:26,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782774734] [2020-07-01 12:42:26,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:42:26,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:26,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:42:26,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:42:26,602 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 18 states. [2020-07-01 12:42:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:26,950 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-07-01 12:42:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-01 12:42:26,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2020-07-01 12:42:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:26,951 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:42:26,951 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:42:26,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2020-07-01 12:42:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:42:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-07-01 12:42:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:42:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-01 12:42:26,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 13 [2020-07-01 12:42:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:26,956 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-01 12:42:26,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:42:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-01 12:42:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:42:26,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:42:26,957 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:42:27,157 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:27,158 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:42:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028742, now seen corresponding path program 1 times [2020-07-01 12:42:27,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:27,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109756764] [2020-07-01 12:42:27,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:27,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109756764] [2020-07-01 12:42:27,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435142784] [2020-07-01 12:42:27,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:27,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:42:27,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:42:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:27,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:42:27,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:42:27,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702995294] [2020-07-01 12:42:27,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:42:27,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:42:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:42:27,250 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2020-07-01 12:42:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:27,279 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-01 12:42:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:42:27,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-01 12:42:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:42:27,280 INFO L225 Difference]: With dead ends: 17 [2020-07-01 12:42:27,280 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:42:27,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:42:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:42:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:42:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:42:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:42:27,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-01 12:42:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:42:27,282 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:42:27,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:42:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:42:27,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:42:27,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:42:27,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:42:27,627 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-07-01 12:42:27,630 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:42:27,630 INFO L268 CegarLoopResult]: For program point L25-1(lines 25 27) no Hoare annotation was computed. [2020-07-01 12:42:27,631 INFO L268 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-07-01 12:42:27,631 INFO L268 CegarLoopResult]: For program point L22-2(lines 18 31) no Hoare annotation was computed. [2020-07-01 12:42:27,631 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:42:27,631 INFO L268 CegarLoopResult]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2020-07-01 12:42:27,631 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-07-01 12:42:27,631 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:42:27,632 INFO L264 CegarLoopResult]: At program point L11-4(lines 11 13) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_cmemset_~d~0.base))) (.cse1 (<= 1 ULTIMATE.start_main_~n~0)) (.cse2 (<= 1 ULTIMATE.start_cmemset_~n)) (.cse7 (select |#length| ULTIMATE.start_cmemset_~d~0.base)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cmemset_~dst.base))) (.cse4 (= 0 ULTIMATE.start_cmemset_~dst.offset)) (.cse5 (<= ULTIMATE.start_cmemset_~n (select |#length| ULTIMATE.start_cmemset_~dst.base))) (.cse6 (<= 1 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_cmemset_~n .cse7) (= 0 ULTIMATE.start_cmemset_~d~0.offset)) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_cmemset_~d~0.offset ULTIMATE.start_cmemset_~n) .cse7) .cse3 .cse4 .cse5 .cse6 (<= 1 ULTIMATE.start_cmemset_~d~0.offset)))) [2020-07-01 12:42:27,632 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:42:27,634 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:42:27,642 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,643 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:42:27,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:42:27,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:42:27,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:42:27,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:42:27 BasicIcfg [2020-07-01 12:42:27,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:42:27,655 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:42:27,656 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:42:27,659 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:42:27,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:27,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:42:23" (1/5) ... [2020-07-01 12:42:27,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59b343be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:42:27, skipping insertion in model container [2020-07-01 12:42:27,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:27,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:42:23" (2/5) ... [2020-07-01 12:42:27,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59b343be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:42:27, skipping insertion in model container [2020-07-01 12:42:27,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:27,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:42:23" (3/5) ... [2020-07-01 12:42:27,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59b343be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:42:27, skipping insertion in model container [2020-07-01 12:42:27,662 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:27,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:42:24" (4/5) ... [2020-07-01 12:42:27,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59b343be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:42:27, skipping insertion in model container [2020-07-01 12:42:27,662 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:42:27,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:42:27" (5/5) ... [2020-07-01 12:42:27,664 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:42:27,683 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:42:27,683 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:42:27,684 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:42:27,684 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:42:27,684 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:42:27,684 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:42:27,684 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:42:27,684 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:42:27,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-01 12:42:27,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:42:27,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:42:27,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:42:27,696 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:42:27,696 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:42:27,696 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:42:27,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-01 12:42:27,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 12:42:27,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:42:27,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:42:27,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:42:27,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:42:27,702 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [85] ULTIMATE.startENTRY-->L22: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_10| 0 0) |v_#valid_9|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret6.base=|v_ULTIMATE.start_main_#t~ret6.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_#t~ret6.offset=|v_ULTIMATE.start_main_#t~ret6.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret6.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret6.offset, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~malloc5.offset] 5#L22true [61] L22-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 12#L22-2true [55] L22-2-->L25-1: Formula: (and (< v_ULTIMATE.start_main_~n~0_5 1) (= v_ULTIMATE.start_main_~n~0_4 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 9#L25-1true [76] L25-1-->L8: Formula: (and (= v_ULTIMATE.start_cmemset_~c_1 |v_ULTIMATE.start_cmemset_#in~c_1|) (= |v_ULTIMATE.start_cmemset_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cmemset_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemset_~n_2 |v_ULTIMATE.start_cmemset_#in~n_1|) (= v_ULTIMATE.start_cmemset_~dst.offset_2 |v_ULTIMATE.start_cmemset_#in~dst.offset_1|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_ULTIMATE.start_cmemset_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4| 1)) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4|)) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_4|) (= v_ULTIMATE.start_cmemset_~dst.base_2 |v_ULTIMATE.start_cmemset_#in~dst.base_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_4| v_ULTIMATE.start_main_~n~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc5.base_4|) (= |v_ULTIMATE.start_cmemset_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_2, ULTIMATE.start_cmemset_#res.base=|v_ULTIMATE.start_cmemset_#res.base_3|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemset_#in~dst.base=|v_ULTIMATE.start_cmemset_#in~dst.base_1|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_1|, ULTIMATE.start_cmemset_#in~dst.offset=|v_ULTIMATE.start_cmemset_#in~dst.offset_1|, #length=|v_#length_1|, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_4|, ULTIMATE.start_cmemset_#in~n=|v_ULTIMATE.start_cmemset_#in~n_1|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_1, ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_1, ULTIMATE.start_cmemset_#res.offset=|v_ULTIMATE.start_cmemset_#res.offset_3|, #valid=|v_#valid_5|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_2, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_3|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_4|, ULTIMATE.start_cmemset_#in~c=|v_ULTIMATE.start_cmemset_#in~c_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemset_~dst.offset, ULTIMATE.start_cmemset_#res.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_cmemset_#in~n, ULTIMATE.start_cmemset_~d~0.base, ULTIMATE.start_cmemset_#in~dst.base, ULTIMATE.start_cmemset_~dst.base, ULTIMATE.start_cmemset_~c, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_#res.offset, ULTIMATE.start_cmemset_#in~dst.offset, #valid, #length, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0, ULTIMATE.start_main_#t~malloc5.offset, ULTIMATE.start_cmemset_#in~c] 10#L8true [78] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemset_~d~0.offset_2 v_ULTIMATE.start_cmemset_~dst.offset_4) (> 0 v_ULTIMATE.start_cmemset_~n_4) (= v_ULTIMATE.start_cmemset_~d~0.base_2 v_ULTIMATE.start_cmemset_~dst.base_4)) InVars {ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4} OutVars{ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_~d~0.base] 8#L11-4true [2020-07-01 12:42:27,703 INFO L796 eck$LassoCheckResult]: Loop: 8#L11-4true [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 7#L12true [90] L12-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemset_~n_8 (- 1)))) (and (= 1 (select |v_#valid_18| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (<= (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_9| 1) (select |v_#length_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (= v_ULTIMATE.start_cmemset_~n_7 .cse0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|) |v_ULTIMATE.start_cmemset_#t~post1.offset_9| v_ULTIMATE.start_cmemset_~c_5))) (= .cse0 |v_ULTIMATE.start_cmemset_#t~pre0_7|) (<= 0 |v_ULTIMATE.start_cmemset_#t~post1.offset_9|))) InVars {ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_9|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_10|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_8} OutVars{ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_8|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_9|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_7, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, #memory_int, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0] 11#L11-2true [83] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemset_#t~pre0_2|) InVars {ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_2|} OutVars{ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~pre0] 8#L11-4true [2020-07-01 12:42:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 109000976, now seen corresponding path program 1 times [2020-07-01 12:42:27,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:27,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566146346] [2020-07-01 12:42:27,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:42:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:42:27,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566146346] [2020-07-01 12:42:27,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:42:27,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:42:27,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526262070] [2020-07-01 12:42:27,726 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:42:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:42:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 77831, now seen corresponding path program 1 times [2020-07-01 12:42:27,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:42:27,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567347121] [2020-07-01 12:42:27,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:42:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:42:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:42:27,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:42:27,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:42:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:42:27,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:42:27,800 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2020-07-01 12:42:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:42:27,838 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2020-07-01 12:42:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:42:27,841 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:42:27,844 INFO L168 Benchmark]: Toolchain (without parser) took 4586.70 ms. Allocated memory was 649.6 MB in the beginning and 759.7 MB in the end (delta: 110.1 MB). Free memory was 562.4 MB in the beginning and 515.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 157.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,844 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 588.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:42:27,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.30 ms. Allocated memory was 649.6 MB in the beginning and 695.2 MB in the end (delta: 45.6 MB). Free memory was 562.4 MB in the beginning and 658.9 MB in the end (delta: -96.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.25 ms. Allocated memory is still 695.2 MB. Free memory was 657.9 MB in the beginning and 656.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,846 INFO L168 Benchmark]: Boogie Preprocessor took 23.61 ms. Allocated memory is still 695.2 MB. Free memory was 656.8 MB in the beginning and 654.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,846 INFO L168 Benchmark]: RCFGBuilder took 279.23 ms. Allocated memory is still 695.2 MB. Free memory was 654.6 MB in the beginning and 634.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,847 INFO L168 Benchmark]: BlockEncodingV2 took 112.87 ms. Allocated memory is still 695.2 MB. Free memory was 634.3 MB in the beginning and 626.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,847 INFO L168 Benchmark]: TraceAbstraction took 3623.49 ms. Allocated memory was 695.2 MB in the beginning and 759.7 MB in the end (delta: 64.5 MB). Free memory was 626.8 MB in the beginning and 538.6 MB in the end (delta: 88.2 MB). Peak memory consumption was 152.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,848 INFO L168 Benchmark]: BuchiAutomizer took 187.23 ms. Allocated memory is still 759.7 MB. Free memory was 538.6 MB in the beginning and 515.6 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:42:27,851 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 22 edges - StatisticsResult: Encoded RCFG 10 locations, 17 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 588.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.30 ms. Allocated memory was 649.6 MB in the beginning and 695.2 MB in the end (delta: 45.6 MB). Free memory was 562.4 MB in the beginning and 658.9 MB in the end (delta: -96.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.25 ms. Allocated memory is still 695.2 MB. Free memory was 657.9 MB in the beginning and 656.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.61 ms. Allocated memory is still 695.2 MB. Free memory was 656.8 MB in the beginning and 654.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 279.23 ms. Allocated memory is still 695.2 MB. Free memory was 654.6 MB in the beginning and 634.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 112.87 ms. Allocated memory is still 695.2 MB. Free memory was 634.3 MB in the beginning and 626.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3623.49 ms. Allocated memory was 695.2 MB in the beginning and 759.7 MB in the end (delta: 64.5 MB). Free memory was 626.8 MB in the beginning and 538.6 MB in the end (delta: 88.2 MB). Peak memory consumption was 152.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 187.23 ms. Allocated memory is still 759.7 MB. Free memory was 538.6 MB in the beginning and 515.6 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2020-07-01 12:42:27,860 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,860 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:42:27,860 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,860 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,860 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:42:27,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:42:27,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:42:27,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((1 == \valid[d] && 1 <= n) && 1 <= n) && 1 == \valid[dst]) && 0 == dst) && n <= unknown-#length-unknown[dst]) && 1 <= unknown-#StackHeapBarrier-unknown) && n <= unknown-#length-unknown[d]) && 0 == d) || ((((((((1 == \valid[d] && 1 <= n) && 1 <= n) && d + n <= unknown-#length-unknown[d]) && 1 == \valid[dst]) && 0 == dst) && n <= unknown-#length-unknown[dst]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= d) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.3s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 SDtfs, 80 SDslu, 237 SDs, 0 SdLazy, 432 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 75 HoareAnnotationTreeSize, 1 FomulaSimplifications, 179 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 4677 SizeOfPredicates, 26 NumberOfNonLiveVariables, 316 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 17/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:42:28.085 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check