/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1052b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:11,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:11,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:11,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:11,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:11,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:11,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:11,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:11,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:11,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:11,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:11,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:11,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:11,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:11,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:11,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:11,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:11,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:11,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:11,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:11,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:11,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:11,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:11,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:11,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:11,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:11,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:11,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:11,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:11,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:11,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:11,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:11,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:11,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:11,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:11,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:11,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:11,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:11,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:11,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:11,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:11,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:11,487 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:11,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:11,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:11,489 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:11,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:11,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:11,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:11,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:11,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:11,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:11,490 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:11,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:11,490 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:11,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:11,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:11,491 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:11,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:11,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:11,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:11,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:11,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:11,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:11,492 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:33:11,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:11,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:11,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:11,811 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:11,812 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:11,812 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1052b.c [2020-07-11 00:33:11,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e501723ca/33ab9f859cf640bb99ac68d27a10d9ee/FLAG389669a0e [2020-07-11 00:33:12,322 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:12,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1052b.c [2020-07-11 00:33:12,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e501723ca/33ab9f859cf640bb99ac68d27a10d9ee/FLAG389669a0e [2020-07-11 00:33:12,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e501723ca/33ab9f859cf640bb99ac68d27a10d9ee [2020-07-11 00:33:12,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:12,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:12,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:12,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:12,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:12,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:12" (1/1) ... [2020-07-11 00:33:12,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb795c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:12, skipping insertion in model container [2020-07-11 00:33:12,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:12" (1/1) ... [2020-07-11 00:33:12,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:12,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:12,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:12,937 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:12,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:13,078 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:13,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13 WrapperNode [2020-07-11 00:33:13,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:13,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:13,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:13,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:13,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... [2020-07-11 00:33:13,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... [2020-07-11 00:33:13,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... [2020-07-11 00:33:13,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... [2020-07-11 00:33:13,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... [2020-07-11 00:33:13,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... [2020-07-11 00:33:13,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... [2020-07-11 00:33:13,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:13,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:13,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:13,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:13,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:13,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2020-07-11 00:33:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2020-07-11 00:33:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2020-07-11 00:33:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:13,753 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:13,753 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-11 00:33:13,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:13 BoogieIcfgContainer [2020-07-11 00:33:13,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:13,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:13,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:13,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:13,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:12" (1/3) ... [2020-07-11 00:33:13,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4155f028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:13, skipping insertion in model container [2020-07-11 00:33:13,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:13" (2/3) ... [2020-07-11 00:33:13,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4155f028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:13, skipping insertion in model container [2020-07-11 00:33:13,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:13" (3/3) ... [2020-07-11 00:33:13,775 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052b.c [2020-07-11 00:33:13,786 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:13,794 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:13,809 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:13,832 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:13,832 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:13,833 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:13,833 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:13,833 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:13,833 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:13,833 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:13,834 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-11 00:33:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 00:33:13,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:13,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:13,866 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 270857975, now seen corresponding path program 1 times [2020-07-11 00:33:13,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:13,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1058027770] [2020-07-11 00:33:13,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:14,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~huge_floor~0 |old(~huge_floor~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-11 00:33:14,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-11 00:33:14,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-11 00:33:14,108 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} ~huge_floor~0 := 1.0E30; {91#true} is VALID [2020-07-11 00:33:14,109 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-11 00:33:14,109 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {91#true} {91#true} #154#return; {91#true} is VALID [2020-07-11 00:33:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:14,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {91#true} is VALID [2020-07-11 00:33:14,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} havoc ~i0~0; {91#true} is VALID [2020-07-11 00:33:14,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} havoc ~j0~0; {91#true} is VALID [2020-07-11 00:33:14,150 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} havoc ~i~0; {91#true} is VALID [2020-07-11 00:33:14,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc ~ix~0; {91#true} is VALID [2020-07-11 00:33:14,151 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-11 00:33:14,152 INFO L280 TraceCheckUtils]: 6: Hoare triple {92#false} ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); {92#false} is VALID [2020-07-11 00:33:14,152 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#false} ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); {92#false} is VALID [2020-07-11 00:33:14,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#false} assume !(~j0~0 < 23); {92#false} is VALID [2020-07-11 00:33:14,153 INFO L280 TraceCheckUtils]: 9: Hoare triple {92#false} assume !(~ix~0 % 4294967296 < 2139095040); {92#false} is VALID [2020-07-11 00:33:14,153 INFO L280 TraceCheckUtils]: 10: Hoare triple {92#false} #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); {92#false} is VALID [2020-07-11 00:33:14,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#false} assume true; {92#false} is VALID [2020-07-11 00:33:14,154 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {92#false} {91#true} #158#return; {92#false} is VALID [2020-07-11 00:33:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:14,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {91#true} is VALID [2020-07-11 00:33:14,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} havoc ~ix~1; {91#true} is VALID [2020-07-11 00:33:14,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-11 00:33:14,166 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#false} ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); {92#false} is VALID [2020-07-11 00:33:14,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#false} #res := (if 2139095040 == ~ix~1 then 1 else 0); {92#false} is VALID [2020-07-11 00:33:14,167 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#false} assume true; {92#false} is VALID [2020-07-11 00:33:14,167 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {92#false} {92#false} #160#return; {92#false} is VALID [2020-07-11 00:33:14,170 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~huge_floor~0 |old(~huge_floor~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:14,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~huge_floor~0 |old(~huge_floor~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-11 00:33:14,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-11 00:33:14,171 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-11 00:33:14,171 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} ~huge_floor~0 := 1.0E30; {91#true} is VALID [2020-07-11 00:33:14,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-11 00:33:14,172 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {91#true} #154#return; {91#true} is VALID [2020-07-11 00:33:14,172 INFO L263 TraceCheckUtils]: 7: Hoare triple {91#true} call #t~ret8 := main(); {91#true} is VALID [2020-07-11 00:33:14,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); {91#true} is VALID [2020-07-11 00:33:14,174 INFO L263 TraceCheckUtils]: 9: Hoare triple {91#true} call #t~ret6 := floor_float(~x~0); {120#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:14,175 INFO L280 TraceCheckUtils]: 10: Hoare triple {120#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {91#true} is VALID [2020-07-11 00:33:14,175 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc ~i0~0; {91#true} is VALID [2020-07-11 00:33:14,175 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} havoc ~j0~0; {91#true} is VALID [2020-07-11 00:33:14,176 INFO L280 TraceCheckUtils]: 13: Hoare triple {91#true} havoc ~i~0; {91#true} is VALID [2020-07-11 00:33:14,176 INFO L280 TraceCheckUtils]: 14: Hoare triple {91#true} havoc ~ix~0; {91#true} is VALID [2020-07-11 00:33:14,177 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-11 00:33:14,177 INFO L280 TraceCheckUtils]: 16: Hoare triple {92#false} ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); {92#false} is VALID [2020-07-11 00:33:14,177 INFO L280 TraceCheckUtils]: 17: Hoare triple {92#false} ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); {92#false} is VALID [2020-07-11 00:33:14,178 INFO L280 TraceCheckUtils]: 18: Hoare triple {92#false} assume !(~j0~0 < 23); {92#false} is VALID [2020-07-11 00:33:14,178 INFO L280 TraceCheckUtils]: 19: Hoare triple {92#false} assume !(~ix~0 % 4294967296 < 2139095040); {92#false} is VALID [2020-07-11 00:33:14,178 INFO L280 TraceCheckUtils]: 20: Hoare triple {92#false} #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); {92#false} is VALID [2020-07-11 00:33:14,179 INFO L280 TraceCheckUtils]: 21: Hoare triple {92#false} assume true; {92#false} is VALID [2020-07-11 00:33:14,179 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {92#false} {91#true} #158#return; {92#false} is VALID [2020-07-11 00:33:14,179 INFO L280 TraceCheckUtils]: 23: Hoare triple {92#false} ~res~0 := #t~ret6; {92#false} is VALID [2020-07-11 00:33:14,180 INFO L280 TraceCheckUtils]: 24: Hoare triple {92#false} havoc #t~ret6; {92#false} is VALID [2020-07-11 00:33:14,180 INFO L263 TraceCheckUtils]: 25: Hoare triple {92#false} call #t~ret7 := isinf_float(~res~0); {120#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:14,180 INFO L280 TraceCheckUtils]: 26: Hoare triple {120#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {91#true} is VALID [2020-07-11 00:33:14,181 INFO L280 TraceCheckUtils]: 27: Hoare triple {91#true} havoc ~ix~1; {91#true} is VALID [2020-07-11 00:33:14,182 INFO L280 TraceCheckUtils]: 28: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-11 00:33:14,182 INFO L280 TraceCheckUtils]: 29: Hoare triple {92#false} ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); {92#false} is VALID [2020-07-11 00:33:14,182 INFO L280 TraceCheckUtils]: 30: Hoare triple {92#false} #res := (if 2139095040 == ~ix~1 then 1 else 0); {92#false} is VALID [2020-07-11 00:33:14,183 INFO L280 TraceCheckUtils]: 31: Hoare triple {92#false} assume true; {92#false} is VALID [2020-07-11 00:33:14,183 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {92#false} {92#false} #160#return; {92#false} is VALID [2020-07-11 00:33:14,183 INFO L280 TraceCheckUtils]: 33: Hoare triple {92#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {92#false} is VALID [2020-07-11 00:33:14,183 INFO L280 TraceCheckUtils]: 34: Hoare triple {92#false} assume 0 == #t~ret7; {92#false} is VALID [2020-07-11 00:33:14,184 INFO L280 TraceCheckUtils]: 35: Hoare triple {92#false} havoc #t~ret7; {92#false} is VALID [2020-07-11 00:33:14,186 INFO L280 TraceCheckUtils]: 36: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-11 00:33:14,195 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-11 00:33:14,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1058027770] [2020-07-11 00:33:14,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:14,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:33:14,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152299998] [2020-07-11 00:33:14,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-11 00:33:14,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:14,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:14,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:14,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:14,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:14,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:14,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:14,310 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-07-11 00:33:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:14,975 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2020-07-11 00:33:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:14,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-11 00:33:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2020-07-11 00:33:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2020-07-11 00:33:15,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 191 transitions. [2020-07-11 00:33:15,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:15,242 INFO L225 Difference]: With dead ends: 160 [2020-07-11 00:33:15,242 INFO L226 Difference]: Without dead ends: 81 [2020-07-11 00:33:15,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11 00:33:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-11 00:33:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-11 00:33:15,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:15,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:15,359 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:15,359 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:15,367 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-11 00:33:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:15,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:15,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:15,369 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:15,369 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:15,378 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-11 00:33:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:15,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:15,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:15,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:15,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-11 00:33:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-11 00:33:15,390 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 37 [2020-07-11 00:33:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:15,391 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-11 00:33:15,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:15,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-11 00:33:15,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 00:33:15,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:15,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:15,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:15,511 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:15,512 INFO L82 PathProgramCache]: Analyzing trace with hash 822923104, now seen corresponding path program 1 times [2020-07-11 00:33:15,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:15,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213591560] [2020-07-11 00:33:15,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:15,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:15,684 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-11 00:33:15,691 INFO L168 Benchmark]: Toolchain (without parser) took 2981.58 ms. Allocated memory was 135.8 MB in the beginning and 253.8 MB in the end (delta: 118.0 MB). Free memory was 101.2 MB in the beginning and 205.4 MB in the end (delta: -104.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:15,693 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:15,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.11 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 178.7 MB in the end (delta: -78.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:15,695 INFO L168 Benchmark]: Boogie Preprocessor took 54.26 ms. Allocated memory is still 199.8 MB. Free memory was 178.7 MB in the beginning and 176.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:15,695 INFO L168 Benchmark]: RCFGBuilder took 624.61 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 138.3 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:15,696 INFO L168 Benchmark]: TraceAbstraction took 1928.33 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 137.6 MB in the beginning and 205.4 MB in the end (delta: -67.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:33:15,700 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 368.11 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 178.7 MB in the end (delta: -78.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.26 ms. Allocated memory is still 199.8 MB. Free memory was 178.7 MB in the beginning and 176.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 624.61 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 138.3 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1928.33 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 137.6 MB in the beginning and 205.4 MB in the end (delta: -67.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...