/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/double_req_bl_1052b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 21:47:49,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 21:47:49,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 21:47:49,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 21:47:49,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 21:47:49,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 21:47:49,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 21:47:49,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 21:47:49,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 21:47:49,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 21:47:49,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 21:47:49,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 21:47:49,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 21:47:49,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 21:47:49,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 21:47:49,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 21:47:49,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 21:47:49,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 21:47:49,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 21:47:49,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 21:47:49,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 21:47:49,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 21:47:49,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 21:47:49,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 21:47:49,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 21:47:49,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 21:47:49,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 21:47:49,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 21:47:49,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 21:47:49,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 21:47:49,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 21:47:49,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 21:47:49,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 21:47:49,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 21:47:49,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 21:47:49,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 21:47:49,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 21:47:49,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 21:47:49,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 21:47:49,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 21:47:49,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 21:47:49,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 21:47:49,633 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 21:47:49,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 21:47:49,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 21:47:49,635 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 21:47:49,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 21:47:49,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 21:47:49,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 21:47:49,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 21:47:49,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 21:47:49,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 21:47:49,636 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 21:47:49,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 21:47:49,636 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 21:47:49,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 21:47:49,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 21:47:49,637 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 21:47:49,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 21:47:49,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 21:47:49,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:47:49,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 21:47:49,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 21:47:49,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 21:47:49,639 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-08 21:47:49,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 21:47:49,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 21:47:49,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 21:47:49,947 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 21:47:49,947 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 21:47:49,948 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1052b.c [2020-07-08 21:47:50,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407dda263/0d4733db080241b6a366a3ee62d608cc/FLAG437f2fc70 [2020-07-08 21:47:50,532 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 21:47:50,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1052b.c [2020-07-08 21:47:50,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407dda263/0d4733db080241b6a366a3ee62d608cc/FLAG437f2fc70 [2020-07-08 21:47:50,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407dda263/0d4733db080241b6a366a3ee62d608cc [2020-07-08 21:47:50,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 21:47:50,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 21:47:50,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 21:47:50,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 21:47:50,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 21:47:50,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:47:50" (1/1) ... [2020-07-08 21:47:50,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11172314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:50, skipping insertion in model container [2020-07-08 21:47:50,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:47:50" (1/1) ... [2020-07-08 21:47:50,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 21:47:50,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 21:47:51,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:47:51,145 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 21:47:51,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:47:51,301 INFO L208 MainTranslator]: Completed translation [2020-07-08 21:47:51,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51 WrapperNode [2020-07-08 21:47:51,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 21:47:51,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 21:47:51,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 21:47:51,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 21:47:51,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (1/1) ... [2020-07-08 21:47:51,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (1/1) ... [2020-07-08 21:47:51,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (1/1) ... [2020-07-08 21:47:51,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (1/1) ... [2020-07-08 21:47:51,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (1/1) ... [2020-07-08 21:47:51,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (1/1) ... [2020-07-08 21:47:51,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (1/1) ... [2020-07-08 21:47:51,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 21:47:51,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 21:47:51,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 21:47:51,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 21:47:51,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (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-08 21:47:51,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 21:47:51,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 21:47:51,441 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2020-07-08 21:47:51,441 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2020-07-08 21:47:51,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 21:47:51,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 21:47:51,441 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2020-07-08 21:47:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 21:47:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 21:47:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 21:47:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 21:47:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 21:47:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 21:47:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2020-07-08 21:47:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 21:47:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 21:47:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 21:47:52,127 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 21:47:52,128 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-08 21:47:52,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:47:52 BoogieIcfgContainer [2020-07-08 21:47:52,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 21:47:52,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 21:47:52,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 21:47:52,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 21:47:52,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 09:47:50" (1/3) ... [2020-07-08 21:47:52,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b48f0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:47:52, skipping insertion in model container [2020-07-08 21:47:52,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:47:51" (2/3) ... [2020-07-08 21:47:52,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b48f0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:47:52, skipping insertion in model container [2020-07-08 21:47:52,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:47:52" (3/3) ... [2020-07-08 21:47:52,151 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052b.c [2020-07-08 21:47:52,163 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 21:47:52,172 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 21:47:52,188 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 21:47:52,216 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 21:47:52,217 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 21:47:52,217 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 21:47:52,217 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 21:47:52,217 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 21:47:52,218 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 21:47:52,218 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 21:47:52,218 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 21:47:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2020-07-08 21:47:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 21:47:52,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:47:52,261 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] [2020-07-08 21:47:52,262 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:47:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:47:52,270 INFO L82 PathProgramCache]: Analyzing trace with hash -603915510, now seen corresponding path program 1 times [2020-07-08 21:47:52,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:47:52,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721795794] [2020-07-08 21:47:52,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:47:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:47:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:47:52,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {154#(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; {122#true} is VALID [2020-07-08 21:47:52,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#true} #valid := #valid[0 := 0]; {122#true} is VALID [2020-07-08 21:47:52,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#true} assume 0 < #StackHeapBarrier; {122#true} is VALID [2020-07-08 21:47:52,482 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#true} ~huge_floor~0 := 1.0E300; {122#true} is VALID [2020-07-08 21:47:52,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {122#true} assume true; {122#true} is VALID [2020-07-08 21:47:52,483 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {122#true} {122#true} #211#return; {122#true} is VALID [2020-07-08 21:47:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:47:52,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {122#true} is VALID [2020-07-08 21:47:52,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#true} havoc ~i0~0; {122#true} is VALID [2020-07-08 21:47:52,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#true} havoc ~i1~0; {122#true} is VALID [2020-07-08 21:47:52,532 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#true} havoc ~j0~0; {122#true} is VALID [2020-07-08 21:47:52,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {122#true} havoc ~i~0; {122#true} is VALID [2020-07-08 21:47:52,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#true} havoc ~j~0; {122#true} is VALID [2020-07-08 21:47:52,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {122#true} assume !true; {123#false} is VALID [2020-07-08 21:47:52,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {123#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {123#false} is VALID [2020-07-08 21:47:52,535 INFO L280 TraceCheckUtils]: 8: Hoare triple {123#false} assume !(~j0~0 < 20); {123#false} is VALID [2020-07-08 21:47:52,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {123#false} assume ~j0~0 > 51; {123#false} is VALID [2020-07-08 21:47:52,536 INFO L280 TraceCheckUtils]: 10: Hoare triple {123#false} assume 1024 == ~j0~0; {123#false} is VALID [2020-07-08 21:47:52,537 INFO L280 TraceCheckUtils]: 11: Hoare triple {123#false} #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); {123#false} is VALID [2020-07-08 21:47:52,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {123#false} assume true; {123#false} is VALID [2020-07-08 21:47:52,537 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {123#false} {122#true} #215#return; {123#false} is VALID [2020-07-08 21:47:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:47:52,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {122#true} is VALID [2020-07-08 21:47:52,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#true} havoc ~hx~0; {122#true} is VALID [2020-07-08 21:47:52,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#true} havoc ~lx~0; {122#true} is VALID [2020-07-08 21:47:52,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#true} assume !true; {123#false} is VALID [2020-07-08 21:47:52,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {123#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {123#false} is VALID [2020-07-08 21:47:52,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {123#false} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {123#false} is VALID [2020-07-08 21:47:52,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {123#false} ~hx~0 := 2146435072 - ~hx~0; {123#false} is VALID [2020-07-08 21:47:52,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {123#false} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {123#false} is VALID [2020-07-08 21:47:52,557 INFO L280 TraceCheckUtils]: 8: Hoare triple {123#false} assume true; {123#false} is VALID [2020-07-08 21:47:52,557 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {123#false} {123#false} #217#return; {123#false} is VALID [2020-07-08 21:47:52,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {122#true} call ULTIMATE.init(); {154#(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-08 21:47:52,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {154#(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; {122#true} is VALID [2020-07-08 21:47:52,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#true} #valid := #valid[0 := 0]; {122#true} is VALID [2020-07-08 21:47:52,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#true} assume 0 < #StackHeapBarrier; {122#true} is VALID [2020-07-08 21:47:52,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {122#true} ~huge_floor~0 := 1.0E300; {122#true} is VALID [2020-07-08 21:47:52,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#true} assume true; {122#true} is VALID [2020-07-08 21:47:52,562 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {122#true} {122#true} #211#return; {122#true} is VALID [2020-07-08 21:47:52,562 INFO L263 TraceCheckUtils]: 7: Hoare triple {122#true} call #t~ret12 := main(); {122#true} is VALID [2020-07-08 21:47:52,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {122#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); {122#true} is VALID [2020-07-08 21:47:52,564 INFO L263 TraceCheckUtils]: 9: Hoare triple {122#true} call #t~ret10 := floor_double(~x~0); {155#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:47:52,565 INFO L280 TraceCheckUtils]: 10: Hoare triple {155#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {122#true} is VALID [2020-07-08 21:47:52,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {122#true} havoc ~i0~0; {122#true} is VALID [2020-07-08 21:47:52,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {122#true} havoc ~i1~0; {122#true} is VALID [2020-07-08 21:47:52,566 INFO L280 TraceCheckUtils]: 13: Hoare triple {122#true} havoc ~j0~0; {122#true} is VALID [2020-07-08 21:47:52,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {122#true} havoc ~i~0; {122#true} is VALID [2020-07-08 21:47:52,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {122#true} havoc ~j~0; {122#true} is VALID [2020-07-08 21:47:52,568 INFO L280 TraceCheckUtils]: 16: Hoare triple {122#true} assume !true; {123#false} is VALID [2020-07-08 21:47:52,568 INFO L280 TraceCheckUtils]: 17: Hoare triple {123#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {123#false} is VALID [2020-07-08 21:47:52,569 INFO L280 TraceCheckUtils]: 18: Hoare triple {123#false} assume !(~j0~0 < 20); {123#false} is VALID [2020-07-08 21:47:52,569 INFO L280 TraceCheckUtils]: 19: Hoare triple {123#false} assume ~j0~0 > 51; {123#false} is VALID [2020-07-08 21:47:52,569 INFO L280 TraceCheckUtils]: 20: Hoare triple {123#false} assume 1024 == ~j0~0; {123#false} is VALID [2020-07-08 21:47:52,570 INFO L280 TraceCheckUtils]: 21: Hoare triple {123#false} #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); {123#false} is VALID [2020-07-08 21:47:52,570 INFO L280 TraceCheckUtils]: 22: Hoare triple {123#false} assume true; {123#false} is VALID [2020-07-08 21:47:52,570 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {123#false} {122#true} #215#return; {123#false} is VALID [2020-07-08 21:47:52,571 INFO L280 TraceCheckUtils]: 24: Hoare triple {123#false} ~res~0 := #t~ret10; {123#false} is VALID [2020-07-08 21:47:52,571 INFO L280 TraceCheckUtils]: 25: Hoare triple {123#false} havoc #t~ret10; {123#false} is VALID [2020-07-08 21:47:52,572 INFO L263 TraceCheckUtils]: 26: Hoare triple {123#false} call #t~ret11 := isinf_double(~res~0); {155#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:47:52,572 INFO L280 TraceCheckUtils]: 27: Hoare triple {155#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {122#true} is VALID [2020-07-08 21:47:52,572 INFO L280 TraceCheckUtils]: 28: Hoare triple {122#true} havoc ~hx~0; {122#true} is VALID [2020-07-08 21:47:52,573 INFO L280 TraceCheckUtils]: 29: Hoare triple {122#true} havoc ~lx~0; {122#true} is VALID [2020-07-08 21:47:52,574 INFO L280 TraceCheckUtils]: 30: Hoare triple {122#true} assume !true; {123#false} is VALID [2020-07-08 21:47:52,574 INFO L280 TraceCheckUtils]: 31: Hoare triple {123#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {123#false} is VALID [2020-07-08 21:47:52,575 INFO L280 TraceCheckUtils]: 32: Hoare triple {123#false} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {123#false} is VALID [2020-07-08 21:47:52,575 INFO L280 TraceCheckUtils]: 33: Hoare triple {123#false} ~hx~0 := 2146435072 - ~hx~0; {123#false} is VALID [2020-07-08 21:47:52,575 INFO L280 TraceCheckUtils]: 34: Hoare triple {123#false} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {123#false} is VALID [2020-07-08 21:47:52,576 INFO L280 TraceCheckUtils]: 35: Hoare triple {123#false} assume true; {123#false} is VALID [2020-07-08 21:47:52,576 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {123#false} {123#false} #217#return; {123#false} is VALID [2020-07-08 21:47:52,576 INFO L280 TraceCheckUtils]: 37: Hoare triple {123#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {123#false} is VALID [2020-07-08 21:47:52,577 INFO L280 TraceCheckUtils]: 38: Hoare triple {123#false} assume 0 == #t~ret11; {123#false} is VALID [2020-07-08 21:47:52,577 INFO L280 TraceCheckUtils]: 39: Hoare triple {123#false} havoc #t~ret11; {123#false} is VALID [2020-07-08 21:47:52,578 INFO L280 TraceCheckUtils]: 40: Hoare triple {123#false} assume !false; {123#false} is VALID [2020-07-08 21:47:52,584 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-08 21:47:52,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721795794] [2020-07-08 21:47:52,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:47:52,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 21:47:52,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996348878] [2020-07-08 21:47:52,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-08 21:47:52,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:47:52,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 21:47:52,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:47:52,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 21:47:52,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:47:52,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 21:47:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 21:47:52,690 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 4 states. [2020-07-08 21:47:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:47:53,645 INFO L93 Difference]: Finished difference Result 221 states and 264 transitions. [2020-07-08 21:47:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 21:47:53,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-08 21:47:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:47:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:47:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2020-07-08 21:47:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:47:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2020-07-08 21:47:53,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2020-07-08 21:47:54,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:47:54,034 INFO L225 Difference]: With dead ends: 221 [2020-07-08 21:47:54,034 INFO L226 Difference]: Without dead ends: 112 [2020-07-08 21:47:54,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:47:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-08 21:47:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-07-08 21:47:54,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:47:54,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2020-07-08 21:47:54,179 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2020-07-08 21:47:54,179 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2020-07-08 21:47:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:47:54,190 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2020-07-08 21:47:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2020-07-08 21:47:54,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:47:54,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:47:54,192 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2020-07-08 21:47:54,192 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2020-07-08 21:47:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:47:54,207 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2020-07-08 21:47:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2020-07-08 21:47:54,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:47:54,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:47:54,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:47:54,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:47:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-08 21:47:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2020-07-08 21:47:54,219 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 41 [2020-07-08 21:47:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:47:54,219 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2020-07-08 21:47:54,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 21:47:54,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 112 states and 126 transitions. [2020-07-08 21:47:54,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:47:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2020-07-08 21:47:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-08 21:47:54,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:47:54,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:47:54,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 21:47:54,384 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:47:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:47:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash -640308234, now seen corresponding path program 1 times [2020-07-08 21:47:54,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:47:54,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116647533] [2020-07-08 21:47:54,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:47:54,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 21:47:54,580 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-08 21:47:54,587 INFO L168 Benchmark]: Toolchain (without parser) took 3720.92 ms. Allocated memory was 141.6 MB in the beginning and 255.3 MB in the end (delta: 113.8 MB). Free memory was 99.6 MB in the beginning and 139.3 MB in the end (delta: -39.7 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. [2020-07-08 21:47:54,588 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 21:47:54,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.03 ms. Allocated memory was 141.6 MB in the beginning and 199.8 MB in the end (delta: 58.2 MB). Free memory was 99.4 MB in the beginning and 177.9 MB in the end (delta: -78.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2020-07-08 21:47:54,590 INFO L168 Benchmark]: Boogie Preprocessor took 61.44 ms. Allocated memory is still 199.8 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:47:54,591 INFO L168 Benchmark]: RCFGBuilder took 773.88 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 125.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2020-07-08 21:47:54,592 INFO L168 Benchmark]: TraceAbstraction took 2443.63 ms. Allocated memory was 199.8 MB in the beginning and 255.3 MB in the end (delta: 55.6 MB). Free memory was 124.6 MB in the beginning and 139.3 MB in the end (delta: -14.7 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2020-07-08 21:47:54,596 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.19 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.03 ms. Allocated memory was 141.6 MB in the beginning and 199.8 MB in the end (delta: 58.2 MB). Free memory was 99.4 MB in the beginning and 177.9 MB in the end (delta: -78.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.44 ms. Allocated memory is still 199.8 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.88 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 125.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2443.63 ms. Allocated memory was 199.8 MB in the beginning and 255.3 MB in the end (delta: 55.6 MB). Free memory was 124.6 MB in the beginning and 139.3 MB in the end (delta: -14.7 MB). Peak memory consumption was 40.9 MB. 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...