/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_1251b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:32:54,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:32:54,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:32:54,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:32:54,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:32:54,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:32:54,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:32:54,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:32:54,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:32:54,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:32:54,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:32:54,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:32:54,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:32:54,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:32:54,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:32:54,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:32:54,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:32:54,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:32:54,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:32:54,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:32:54,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:32:54,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:32:54,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:32:54,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:32:54,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:32:54,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:32:54,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:32:54,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:32:54,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:32:54,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:32:54,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:32:54,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:32:54,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:32:54,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:32:54,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:32:54,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:32:54,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:32:54,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:32:54,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:32:54,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:32:54,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:32:54,831 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:32:54,840 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:32:54,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:32:54,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:32:54,841 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:32:54,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:32:54,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:32:54,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:32:54,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:32:54,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:32:54,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:32:54,843 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:32:54,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:32:54,843 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:32:54,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:32:54,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:32:54,844 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:32:54,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:32:54,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:32:54,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:32:54,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:32:54,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:32:54,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:32:54,845 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:32:55,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:32:55,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:32:55,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:32:55,136 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:32:55,136 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:32:55,137 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-07-11 00:32:55,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8df9fb51/708dad5388464777a26d834a5a2285f5/FLAG451b0f8d7 [2020-07-11 00:32:55,660 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:32:55,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-07-11 00:32:55,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8df9fb51/708dad5388464777a26d834a5a2285f5/FLAG451b0f8d7 [2020-07-11 00:32:56,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8df9fb51/708dad5388464777a26d834a5a2285f5 [2020-07-11 00:32:56,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:32:56,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:32:56,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:32:56,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:32:56,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:32:56,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f08f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56, skipping insertion in model container [2020-07-11 00:32:56,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:32:56,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:32:56,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:32:56,298 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:32:56,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:32:56,355 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:32:56,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56 WrapperNode [2020-07-11 00:32:56,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:32:56,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:32:56,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:32:56,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:32:56,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (1/1) ... [2020-07-11 00:32:56,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:32:56,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:32:56,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:32:56,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:32:56,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (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:32:56,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:32:56,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:32:56,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-11 00:32:56,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-11 00:32:56,561 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-11 00:32:56,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:32:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:32:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-11 00:32:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-11 00:32:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-11 00:32:56,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:32:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:32:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:32:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:32:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-11 00:32:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:32:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:32:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:32:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:32:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:32:57,113 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:32:57,114 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 00:32:57,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:32:57 BoogieIcfgContainer [2020-07-11 00:32:57,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:32:57,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:32:57,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:32:57,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:32:57,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:32:56" (1/3) ... [2020-07-11 00:32:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef233a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:32:57, skipping insertion in model container [2020-07-11 00:32:57,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:56" (2/3) ... [2020-07-11 00:32:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef233a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:32:57, skipping insertion in model container [2020-07-11 00:32:57,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:32:57" (3/3) ... [2020-07-11 00:32:57,129 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-07-11 00:32:57,140 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:32:57,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:32:57,166 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:32:57,191 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:32:57,191 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:32:57,192 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:32:57,192 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:32:57,192 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:32:57,192 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:32:57,193 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:32:57,193 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:32:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-11 00:32:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 00:32:57,225 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:57,227 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] [2020-07-11 00:32:57,227 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1770687738, now seen corresponding path program 1 times [2020-07-11 00:32:57,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:57,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1000231394] [2020-07-11 00:32:57,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:57,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {84#true} is VALID [2020-07-11 00:32:57,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-11 00:32:57,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-11 00:32:57,499 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-11 00:32:57,500 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {84#true} {84#true} #125#return; {84#true} is VALID [2020-07-11 00:32:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:57,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-11 00:32:57,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-11 00:32:57,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-11 00:32:57,531 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-11 00:32:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:57,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-11 00:32:57,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-11 00:32:57,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-11 00:32:57,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-11 00:32:57,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-11 00:32:57,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-11 00:32:57,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-11 00:32:57,592 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {85#false} {84#true} #121#return; {85#false} is VALID [2020-07-11 00:32:57,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-11 00:32:57,593 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-11 00:32:57,596 INFO L263 TraceCheckUtils]: 2: Hoare triple {84#true} call #t~ret4 := __fpclassify_double(~x); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:57,596 INFO L280 TraceCheckUtils]: 3: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-11 00:32:57,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-11 00:32:57,597 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-11 00:32:57,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-11 00:32:57,599 INFO L280 TraceCheckUtils]: 7: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-11 00:32:57,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-11 00:32:57,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-11 00:32:57,600 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {85#false} {84#true} #121#return; {85#false} is VALID [2020-07-11 00:32:57,600 INFO L280 TraceCheckUtils]: 11: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-11 00:32:57,601 INFO L280 TraceCheckUtils]: 12: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-11 00:32:57,601 INFO L280 TraceCheckUtils]: 13: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-11 00:32:57,602 INFO L280 TraceCheckUtils]: 14: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-11 00:32:57,602 INFO L280 TraceCheckUtils]: 15: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-11 00:32:57,602 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-11 00:32:57,605 INFO L263 TraceCheckUtils]: 0: Hoare triple {84#true} call ULTIMATE.init(); {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:32:57,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {84#true} is VALID [2020-07-11 00:32:57,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-11 00:32:57,607 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-11 00:32:57,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-11 00:32:57,607 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #125#return; {84#true} is VALID [2020-07-11 00:32:57,608 INFO L263 TraceCheckUtils]: 6: Hoare triple {84#true} call #t~ret10 := main(); {84#true} is VALID [2020-07-11 00:32:57,608 INFO L280 TraceCheckUtils]: 7: Hoare triple {84#true} ~x~0 := #t~nondet7; {84#true} is VALID [2020-07-11 00:32:57,608 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} havoc #t~nondet7; {84#true} is VALID [2020-07-11 00:32:57,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {84#true} is VALID [2020-07-11 00:32:57,609 INFO L263 TraceCheckUtils]: 10: Hoare triple {84#true} call #t~ret8 := isnan_double(~x~0); {84#true} is VALID [2020-07-11 00:32:57,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-11 00:32:57,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-11 00:32:57,610 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-11 00:32:57,610 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-11 00:32:57,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {84#true} is VALID [2020-07-11 00:32:57,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#true} assume 0 == #t~ret8; {84#true} is VALID [2020-07-11 00:32:57,611 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc #t~ret8; {84#true} is VALID [2020-07-11 00:32:57,613 INFO L263 TraceCheckUtils]: 18: Hoare triple {84#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:57,614 INFO L280 TraceCheckUtils]: 19: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-11 00:32:57,614 INFO L280 TraceCheckUtils]: 20: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-11 00:32:57,616 INFO L263 TraceCheckUtils]: 21: Hoare triple {84#true} call #t~ret4 := __fpclassify_double(~x); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:57,617 INFO L280 TraceCheckUtils]: 22: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-11 00:32:57,617 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-11 00:32:57,618 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-11 00:32:57,619 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-11 00:32:57,620 INFO L280 TraceCheckUtils]: 26: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-11 00:32:57,620 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-11 00:32:57,621 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-11 00:32:57,621 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {85#false} {84#true} #121#return; {85#false} is VALID [2020-07-11 00:32:57,621 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-11 00:32:57,622 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-11 00:32:57,622 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-11 00:32:57,622 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-11 00:32:57,622 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-11 00:32:57,623 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-11 00:32:57,623 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} ~res~0 := #t~ret9; {85#false} is VALID [2020-07-11 00:32:57,623 INFO L280 TraceCheckUtils]: 37: Hoare triple {85#false} havoc #t~ret9; {85#false} is VALID [2020-07-11 00:32:57,624 INFO L280 TraceCheckUtils]: 38: Hoare triple {85#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {85#false} is VALID [2020-07-11 00:32:57,624 INFO L280 TraceCheckUtils]: 39: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-11 00:32:57,629 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:32:57,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1000231394] [2020-07-11 00:32:57,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:32:57,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:32:57,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566386126] [2020-07-11 00:32:57,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-11 00:32:57,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:32:57,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:32:57,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:57,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:32:57,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:32:57,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:32:57,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:32:57,742 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2020-07-11 00:32:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:58,396 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2020-07-11 00:32:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:32:58,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-11 00:32:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:32:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:32:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-11 00:32:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:32:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-11 00:32:58,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-11 00:32:58,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:58,659 INFO L225 Difference]: With dead ends: 141 [2020-07-11 00:32:58,660 INFO L226 Difference]: Without dead ends: 74 [2020-07-11 00:32:58,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:32:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-11 00:32:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-11 00:32:58,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:32:58,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-11 00:32:58,799 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-11 00:32:58,800 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-11 00:32:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:58,810 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-11 00:32:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-11 00:32:58,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:58,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:58,812 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-11 00:32:58,813 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-11 00:32:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:58,821 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-11 00:32:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-11 00:32:58,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:58,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:58,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:32:58,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:32:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-11 00:32:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2020-07-11 00:32:58,832 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 40 [2020-07-11 00:32:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:32:58,832 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2020-07-11 00:32:58,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:32:58,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2020-07-11 00:32:58,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-11 00:32:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 00:32:58,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:58,950 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] [2020-07-11 00:32:58,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:32:58,951 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash 524719120, now seen corresponding path program 1 times [2020-07-11 00:32:58,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:58,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512704763] [2020-07-11 00:32:58,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:59,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {705#true} is VALID [2020-07-11 00:32:59,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-11 00:32:59,037 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-11 00:32:59,037 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-11 00:32:59,038 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {705#true} {705#true} #125#return; {705#true} is VALID [2020-07-11 00:32:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:59,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-11 00:32:59,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-11 00:32:59,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-11 00:32:59,044 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-11 00:32:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:59,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-11 00:32:59,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-11 00:32:59,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-11 00:32:59,159 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {705#true} is VALID [2020-07-11 00:32:59,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {705#true} is VALID [2020-07-11 00:32:59,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {705#true} is VALID [2020-07-11 00:32:59,160 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-11 00:32:59,161 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {705#true} is VALID [2020-07-11 00:32:59,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-11 00:32:59,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-11 00:32:59,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {705#true} is VALID [2020-07-11 00:32:59,162 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-11 00:32:59,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {705#true} is VALID [2020-07-11 00:32:59,162 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-11 00:32:59,163 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-11 00:32:59,163 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {705#true} is VALID [2020-07-11 00:32:59,163 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-11 00:32:59,164 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-11 00:32:59,164 INFO L280 TraceCheckUtils]: 18: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-11 00:32:59,165 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:59,166 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:59,167 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #121#return; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-11 00:32:59,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-11 00:32:59,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-11 00:32:59,170 INFO L263 TraceCheckUtils]: 2: Hoare triple {705#true} call #t~ret4 := __fpclassify_double(~x); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:59,170 INFO L280 TraceCheckUtils]: 3: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-11 00:32:59,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-11 00:32:59,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-11 00:32:59,171 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {705#true} is VALID [2020-07-11 00:32:59,171 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {705#true} is VALID [2020-07-11 00:32:59,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {705#true} is VALID [2020-07-11 00:32:59,172 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-11 00:32:59,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {705#true} is VALID [2020-07-11 00:32:59,172 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-11 00:32:59,173 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-11 00:32:59,173 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {705#true} is VALID [2020-07-11 00:32:59,173 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-11 00:32:59,174 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {705#true} is VALID [2020-07-11 00:32:59,174 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-11 00:32:59,174 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-11 00:32:59,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {705#true} is VALID [2020-07-11 00:32:59,175 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-11 00:32:59,175 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-11 00:32:59,175 INFO L280 TraceCheckUtils]: 21: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-11 00:32:59,176 INFO L280 TraceCheckUtils]: 22: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:59,177 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:59,178 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #121#return; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-11 00:32:59,179 INFO L280 TraceCheckUtils]: 25: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-11 00:32:59,180 INFO L280 TraceCheckUtils]: 26: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-11 00:32:59,180 INFO L280 TraceCheckUtils]: 27: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-11 00:32:59,180 INFO L280 TraceCheckUtils]: 28: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-11 00:32:59,180 INFO L280 TraceCheckUtils]: 29: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-11 00:32:59,181 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-11 00:32:59,183 INFO L263 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:32:59,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {705#true} is VALID [2020-07-11 00:32:59,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-11 00:32:59,184 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-11 00:32:59,184 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-11 00:32:59,185 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {705#true} {705#true} #125#return; {705#true} is VALID [2020-07-11 00:32:59,185 INFO L263 TraceCheckUtils]: 6: Hoare triple {705#true} call #t~ret10 := main(); {705#true} is VALID [2020-07-11 00:32:59,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} ~x~0 := #t~nondet7; {705#true} is VALID [2020-07-11 00:32:59,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~nondet7; {705#true} is VALID [2020-07-11 00:32:59,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {705#true} is VALID [2020-07-11 00:32:59,186 INFO L263 TraceCheckUtils]: 10: Hoare triple {705#true} call #t~ret8 := isnan_double(~x~0); {705#true} is VALID [2020-07-11 00:32:59,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-11 00:32:59,186 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-11 00:32:59,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-11 00:32:59,187 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-11 00:32:59,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {705#true} is VALID [2020-07-11 00:32:59,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} assume 0 == #t~ret8; {705#true} is VALID [2020-07-11 00:32:59,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~ret8; {705#true} is VALID [2020-07-11 00:32:59,189 INFO L263 TraceCheckUtils]: 18: Hoare triple {705#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:59,190 INFO L280 TraceCheckUtils]: 19: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-11 00:32:59,190 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-11 00:32:59,191 INFO L263 TraceCheckUtils]: 21: Hoare triple {705#true} call #t~ret4 := __fpclassify_double(~x); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:59,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-11 00:32:59,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-11 00:32:59,192 INFO L280 TraceCheckUtils]: 24: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-11 00:32:59,192 INFO L280 TraceCheckUtils]: 25: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {705#true} is VALID [2020-07-11 00:32:59,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {705#true} is VALID [2020-07-11 00:32:59,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {705#true} is VALID [2020-07-11 00:32:59,193 INFO L280 TraceCheckUtils]: 28: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-11 00:32:59,193 INFO L280 TraceCheckUtils]: 29: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {705#true} is VALID [2020-07-11 00:32:59,194 INFO L280 TraceCheckUtils]: 30: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-11 00:32:59,194 INFO L280 TraceCheckUtils]: 31: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-11 00:32:59,194 INFO L280 TraceCheckUtils]: 32: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {705#true} is VALID [2020-07-11 00:32:59,194 INFO L280 TraceCheckUtils]: 33: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-11 00:32:59,195 INFO L280 TraceCheckUtils]: 34: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {705#true} is VALID [2020-07-11 00:32:59,195 INFO L280 TraceCheckUtils]: 35: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-11 00:32:59,195 INFO L280 TraceCheckUtils]: 36: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-11 00:32:59,195 INFO L280 TraceCheckUtils]: 37: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {705#true} is VALID [2020-07-11 00:32:59,195 INFO L280 TraceCheckUtils]: 38: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-11 00:32:59,196 INFO L280 TraceCheckUtils]: 39: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-11 00:32:59,196 INFO L280 TraceCheckUtils]: 40: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-11 00:32:59,197 INFO L280 TraceCheckUtils]: 41: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:59,197 INFO L280 TraceCheckUtils]: 42: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:59,199 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #121#return; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-11 00:32:59,199 INFO L280 TraceCheckUtils]: 44: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-11 00:32:59,200 INFO L280 TraceCheckUtils]: 45: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-11 00:32:59,200 INFO L280 TraceCheckUtils]: 46: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-11 00:32:59,200 INFO L280 TraceCheckUtils]: 47: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-11 00:32:59,201 INFO L280 TraceCheckUtils]: 48: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-11 00:32:59,201 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-11 00:32:59,201 INFO L280 TraceCheckUtils]: 50: Hoare triple {706#false} ~res~0 := #t~ret9; {706#false} is VALID [2020-07-11 00:32:59,201 INFO L280 TraceCheckUtils]: 51: Hoare triple {706#false} havoc #t~ret9; {706#false} is VALID [2020-07-11 00:32:59,202 INFO L280 TraceCheckUtils]: 52: Hoare triple {706#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {706#false} is VALID [2020-07-11 00:32:59,202 INFO L280 TraceCheckUtils]: 53: Hoare triple {706#false} assume !false; {706#false} is VALID [2020-07-11 00:32:59,206 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:32:59,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512704763] [2020-07-11 00:32:59,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:32:59,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:32:59,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428776179] [2020-07-11 00:32:59,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-11 00:32:59,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:32:59,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:32:59,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:59,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:32:59,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:32:59,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:32:59,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:32:59,267 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2020-07-11 00:32:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:59,917 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-07-11 00:32:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:32:59,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-11 00:32:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:32:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:32:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-11 00:32:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:32:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-11 00:32:59,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-11 00:33:00,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:00,058 INFO L225 Difference]: With dead ends: 88 [2020-07-11 00:33:00,058 INFO L226 Difference]: Without dead ends: 79 [2020-07-11 00:33:00,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-11 00:33:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2020-07-11 00:33:00,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:00,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 78 states. [2020-07-11 00:33:00,125 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 78 states. [2020-07-11 00:33:00,125 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 78 states. [2020-07-11 00:33:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:00,133 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-11 00:33:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-11 00:33:00,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:00,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:00,135 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 79 states. [2020-07-11 00:33:00,135 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 79 states. [2020-07-11 00:33:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:00,140 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-11 00:33:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-11 00:33:00,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:00,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:00,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:00,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-11 00:33:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-11 00:33:00,146 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 54 [2020-07-11 00:33:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:00,147 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-11 00:33:00,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:00,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-11 00:33:00,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-11 00:33:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 00:33:00,254 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:00,254 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] [2020-07-11 00:33:00,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:00,255 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2023591653, now seen corresponding path program 1 times [2020-07-11 00:33:00,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:00,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808131918] [2020-07-11 00:33:00,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:00,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1268#true} is VALID [2020-07-11 00:33:00,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-11 00:33:00,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-11 00:33:00,346 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-11 00:33:00,347 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1268#true} {1268#true} #125#return; {1268#true} is VALID [2020-07-11 00:33:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:00,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-11 00:33:00,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-11 00:33:00,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-11 00:33:00,355 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-11 00:33:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:00,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-11 00:33:00,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-11 00:33:00,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-11 00:33:00,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1268#true} is VALID [2020-07-11 00:33:00,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1268#true} is VALID [2020-07-11 00:33:00,473 INFO L280 TraceCheckUtils]: 5: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {1268#true} is VALID [2020-07-11 00:33:00,473 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-11 00:33:00,473 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {1268#true} is VALID [2020-07-11 00:33:00,474 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-11 00:33:00,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-11 00:33:00,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {1268#true} is VALID [2020-07-11 00:33:00,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-11 00:33:00,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {1268#true} is VALID [2020-07-11 00:33:00,475 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-11 00:33:00,475 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-11 00:33:00,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1268#true} is VALID [2020-07-11 00:33:00,476 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-11 00:33:00,476 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-11 00:33:00,476 INFO L280 TraceCheckUtils]: 18: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-11 00:33:00,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-11 00:33:00,477 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-11 00:33:00,477 INFO L280 TraceCheckUtils]: 21: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-11 00:33:00,478 INFO L280 TraceCheckUtils]: 22: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:33:00,479 INFO L280 TraceCheckUtils]: 23: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:33:00,480 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #121#return; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-11 00:33:00,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-11 00:33:00,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-11 00:33:00,483 INFO L263 TraceCheckUtils]: 2: Hoare triple {1268#true} call #t~ret4 := __fpclassify_double(~x); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:00,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-11 00:33:00,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-11 00:33:00,483 INFO L280 TraceCheckUtils]: 5: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-11 00:33:00,484 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1268#true} is VALID [2020-07-11 00:33:00,484 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1268#true} is VALID [2020-07-11 00:33:00,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {1268#true} is VALID [2020-07-11 00:33:00,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-11 00:33:00,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {1268#true} is VALID [2020-07-11 00:33:00,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-11 00:33:00,498 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-11 00:33:00,498 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {1268#true} is VALID [2020-07-11 00:33:00,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-11 00:33:00,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {1268#true} is VALID [2020-07-11 00:33:00,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-11 00:33:00,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-11 00:33:00,499 INFO L280 TraceCheckUtils]: 18: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1268#true} is VALID [2020-07-11 00:33:00,499 INFO L280 TraceCheckUtils]: 19: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-11 00:33:00,499 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-11 00:33:00,500 INFO L280 TraceCheckUtils]: 21: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-11 00:33:00,500 INFO L280 TraceCheckUtils]: 22: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-11 00:33:00,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-11 00:33:00,500 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-11 00:33:00,502 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:33:00,506 INFO L280 TraceCheckUtils]: 26: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:33:00,507 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #121#return; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-11 00:33:00,508 INFO L280 TraceCheckUtils]: 28: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-11 00:33:00,509 INFO L280 TraceCheckUtils]: 29: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-11 00:33:00,509 INFO L280 TraceCheckUtils]: 30: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-11 00:33:00,509 INFO L280 TraceCheckUtils]: 31: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-11 00:33:00,509 INFO L280 TraceCheckUtils]: 32: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-11 00:33:00,510 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-11 00:33:00,512 INFO L263 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:00,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1268#true} is VALID [2020-07-11 00:33:00,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-11 00:33:00,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-11 00:33:00,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-11 00:33:00,513 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1268#true} {1268#true} #125#return; {1268#true} is VALID [2020-07-11 00:33:00,513 INFO L263 TraceCheckUtils]: 6: Hoare triple {1268#true} call #t~ret10 := main(); {1268#true} is VALID [2020-07-11 00:33:00,514 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} ~x~0 := #t~nondet7; {1268#true} is VALID [2020-07-11 00:33:00,514 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~nondet7; {1268#true} is VALID [2020-07-11 00:33:00,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1268#true} is VALID [2020-07-11 00:33:00,514 INFO L263 TraceCheckUtils]: 10: Hoare triple {1268#true} call #t~ret8 := isnan_double(~x~0); {1268#true} is VALID [2020-07-11 00:33:00,514 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-11 00:33:00,515 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-11 00:33:00,515 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-11 00:33:00,515 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-11 00:33:00,515 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1268#true} is VALID [2020-07-11 00:33:00,516 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} assume 0 == #t~ret8; {1268#true} is VALID [2020-07-11 00:33:00,516 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~ret8; {1268#true} is VALID [2020-07-11 00:33:00,517 INFO L263 TraceCheckUtils]: 18: Hoare triple {1268#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:00,517 INFO L280 TraceCheckUtils]: 19: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-11 00:33:00,518 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-11 00:33:00,519 INFO L263 TraceCheckUtils]: 21: Hoare triple {1268#true} call #t~ret4 := __fpclassify_double(~x); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:00,519 INFO L280 TraceCheckUtils]: 22: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-11 00:33:00,519 INFO L280 TraceCheckUtils]: 23: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-11 00:33:00,519 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-11 00:33:00,520 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1268#true} is VALID [2020-07-11 00:33:00,520 INFO L280 TraceCheckUtils]: 26: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1268#true} is VALID [2020-07-11 00:33:00,520 INFO L280 TraceCheckUtils]: 27: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {1268#true} is VALID [2020-07-11 00:33:00,520 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-11 00:33:00,521 INFO L280 TraceCheckUtils]: 29: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {1268#true} is VALID [2020-07-11 00:33:00,521 INFO L280 TraceCheckUtils]: 30: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-11 00:33:00,521 INFO L280 TraceCheckUtils]: 31: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-11 00:33:00,521 INFO L280 TraceCheckUtils]: 32: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {1268#true} is VALID [2020-07-11 00:33:00,522 INFO L280 TraceCheckUtils]: 33: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-11 00:33:00,522 INFO L280 TraceCheckUtils]: 34: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {1268#true} is VALID [2020-07-11 00:33:00,522 INFO L280 TraceCheckUtils]: 35: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-11 00:33:00,522 INFO L280 TraceCheckUtils]: 36: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-11 00:33:00,523 INFO L280 TraceCheckUtils]: 37: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1268#true} is VALID [2020-07-11 00:33:00,523 INFO L280 TraceCheckUtils]: 38: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-11 00:33:00,523 INFO L280 TraceCheckUtils]: 39: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-11 00:33:00,523 INFO L280 TraceCheckUtils]: 40: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-11 00:33:00,523 INFO L280 TraceCheckUtils]: 41: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-11 00:33:00,524 INFO L280 TraceCheckUtils]: 42: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-11 00:33:00,524 INFO L280 TraceCheckUtils]: 43: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-11 00:33:00,525 INFO L280 TraceCheckUtils]: 44: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:33:00,525 INFO L280 TraceCheckUtils]: 45: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:33:00,526 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #121#return; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-11 00:33:00,527 INFO L280 TraceCheckUtils]: 47: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-11 00:33:00,528 INFO L280 TraceCheckUtils]: 48: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-11 00:33:00,528 INFO L280 TraceCheckUtils]: 49: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-11 00:33:00,528 INFO L280 TraceCheckUtils]: 50: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-11 00:33:00,528 INFO L280 TraceCheckUtils]: 51: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-11 00:33:00,529 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-11 00:33:00,529 INFO L280 TraceCheckUtils]: 53: Hoare triple {1269#false} ~res~0 := #t~ret9; {1269#false} is VALID [2020-07-11 00:33:00,529 INFO L280 TraceCheckUtils]: 54: Hoare triple {1269#false} havoc #t~ret9; {1269#false} is VALID [2020-07-11 00:33:00,529 INFO L280 TraceCheckUtils]: 55: Hoare triple {1269#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {1269#false} is VALID [2020-07-11 00:33:00,530 INFO L280 TraceCheckUtils]: 56: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-11 00:33:00,533 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:00,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808131918] [2020-07-11 00:33:00,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:00,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:00,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090495369] [2020-07-11 00:33:00,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-11 00:33:00,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:00,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:00,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:00,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:00,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:00,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:00,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:00,589 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2020-07-11 00:33:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:01,210 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-11 00:33:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:01,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-11 00:33:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-11 00:33:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-11 00:33:01,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-11 00:33:01,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:01,327 INFO L225 Difference]: With dead ends: 92 [2020-07-11 00:33:01,327 INFO L226 Difference]: Without dead ends: 83 [2020-07-11 00:33:01,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-11 00:33:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-07-11 00:33:01,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:01,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 78 states. [2020-07-11 00:33:01,446 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 78 states. [2020-07-11 00:33:01,446 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 78 states. [2020-07-11 00:33:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:01,456 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-11 00:33:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-11 00:33:01,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:01,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:01,457 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 83 states. [2020-07-11 00:33:01,458 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 83 states. [2020-07-11 00:33:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:01,462 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-11 00:33:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-11 00:33:01,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:01,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:01,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:01,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-11 00:33:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-11 00:33:01,468 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 57 [2020-07-11 00:33:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:01,470 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-11 00:33:01,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:01,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-11 00:33:01,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-11 00:33:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 00:33:01,565 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:01,565 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] [2020-07-11 00:33:01,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:01,566 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:01,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash 425668389, now seen corresponding path program 1 times [2020-07-11 00:33:01,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:01,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330618743] [2020-07-11 00:33:01,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:01,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:33:01,784 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.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) 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:01,791 INFO L168 Benchmark]: Toolchain (without parser) took 5751.47 ms. Allocated memory was 137.9 MB in the beginning and 285.7 MB in the end (delta: 147.8 MB). Free memory was 102.9 MB in the beginning and 220.6 MB in the end (delta: -117.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:01,796 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:01,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.18 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 91.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:01,799 INFO L168 Benchmark]: Boogie Preprocessor took 130.07 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 179.3 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:01,799 INFO L168 Benchmark]: RCFGBuilder took 632.76 ms. Allocated memory is still 201.9 MB. Free memory was 179.3 MB in the beginning and 144.2 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:01,805 INFO L168 Benchmark]: TraceAbstraction took 4666.25 ms. Allocated memory was 201.9 MB in the beginning and 285.7 MB in the end (delta: 83.9 MB). Free memory was 143.5 MB in the beginning and 220.6 MB in the end (delta: -77.1 MB). Peak memory consumption was 6.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:01,814 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.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.18 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 91.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.07 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 179.3 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 632.76 ms. Allocated memory is still 201.9 MB. Free memory was 179.3 MB in the beginning and 144.2 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4666.25 ms. Allocated memory was 201.9 MB in the beginning and 285.7 MB in the end (delta: 83.9 MB). Free memory was 143.5 MB in the beginning and 220.6 MB in the end (delta: -77.1 MB). Peak memory consumption was 6.7 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.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...