/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1250.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:35:07,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:35:07,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:35:07,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:35:07,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:35:07,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:35:07,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:35:07,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:35:07,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:35:07,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:35:07,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:35:07,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:35:07,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:35:07,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:35:07,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:35:07,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:35:07,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:35:07,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:35:07,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:35:07,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:35:07,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:35:07,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:35:07,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:35:07,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:35:07,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:35:07,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:35:07,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:35:07,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:35:07,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:35:07,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:35:07,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:35:07,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:35:07,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:35:07,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:35:07,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:35:07,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:35:07,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:35:07,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:35:07,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:35:07,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:35:07,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:35:07,664 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:35:07,673 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:35:07,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:35:07,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:35:07,674 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:35:07,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:35:07,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:35:07,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:35:07,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:35:07,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:35:07,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:35:07,676 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:35:07,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:35:07,676 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:35:07,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:35:07,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:35:07,677 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:35:07,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:35:07,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:35:07,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:07,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:35:07,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:35:07,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:35:07,678 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:35:07,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:35:07,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:35:07,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:35:07,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:35:07,974 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:35:07,975 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1250.c [2020-07-10 18:35:08,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90378ab3b/c22e6a76578c4fc9837f9c0bd81b5ba9/FLAGf4ad61f50 [2020-07-10 18:35:08,505 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:35:08,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1250.c [2020-07-10 18:35:08,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90378ab3b/c22e6a76578c4fc9837f9c0bd81b5ba9/FLAGf4ad61f50 [2020-07-10 18:35:08,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90378ab3b/c22e6a76578c4fc9837f9c0bd81b5ba9 [2020-07-10 18:35:08,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:35:08,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:35:08,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:08,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:35:08,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:35:08,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:08" (1/1) ... [2020-07-10 18:35:08,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e8b64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:08, skipping insertion in model container [2020-07-10 18:35:08,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:08" (1/1) ... [2020-07-10 18:35:08,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:35:08,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:35:09,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:09,128 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:35:09,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:09,322 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:35:09,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09 WrapperNode [2020-07-10 18:35:09,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:09,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:35:09,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:35:09,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:35:09,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (1/1) ... [2020-07-10 18:35:09,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (1/1) ... [2020-07-10 18:35:09,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (1/1) ... [2020-07-10 18:35:09,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (1/1) ... [2020-07-10 18:35:09,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (1/1) ... [2020-07-10 18:35:09,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (1/1) ... [2020-07-10 18:35:09,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (1/1) ... [2020-07-10 18:35:09,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:35:09,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:35:09,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:35:09,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:35:09,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (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-10 18:35:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:35:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:35:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 18:35:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 18:35:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-10 18:35:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:35:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:35:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 18:35:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 18:35:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 18:35:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 18:35:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 18:35:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:35:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:35:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-10 18:35:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:35:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:35:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:35:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 18:35:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:35:09,952 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:35:09,952 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 18:35:09,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:09 BoogieIcfgContainer [2020-07-10 18:35:09,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:35:09,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:35:09,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:35:09,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:35:09,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:35:08" (1/3) ... [2020-07-10 18:35:09,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a0f333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:09, skipping insertion in model container [2020-07-10 18:35:09,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:09" (2/3) ... [2020-07-10 18:35:09,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a0f333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:09, skipping insertion in model container [2020-07-10 18:35:09,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:09" (3/3) ... [2020-07-10 18:35:09,966 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2020-07-10 18:35:09,977 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:35:09,986 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:35:10,000 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:35:10,022 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:35:10,022 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:35:10,023 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:35:10,023 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:35:10,023 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:35:10,023 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:35:10,024 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:35:10,024 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:35:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-07-10 18:35:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 18:35:10,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:10,057 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] [2020-07-10 18:35:10,057 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash -262911209, now seen corresponding path program 1 times [2020-07-10 18:35:10,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:10,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023842827] [2020-07-10 18:35:10,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,310 INFO L280 TraceCheckUtils]: 0: Hoare triple {110#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-10 18:35:10,311 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-10 18:35:10,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-10 18:35:10,312 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:10,313 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {82#true} {82#true} #118#return; {82#true} is VALID [2020-07-10 18:35:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:10,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-10 18:35:10,364 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-10 18:35:10,365 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-10 18:35:10,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {83#false} is VALID [2020-07-10 18:35:10,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-10 18:35:10,366 INFO L280 TraceCheckUtils]: 6: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:10,367 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {83#false} {82#true} #114#return; {83#false} is VALID [2020-07-10 18:35:10,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:10,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} ~y := #in~y; {82#true} is VALID [2020-07-10 18:35:10,371 INFO L263 TraceCheckUtils]: 2: Hoare triple {82#true} call #t~ret4 := __fpclassify_double(~x); {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:10,371 INFO L280 TraceCheckUtils]: 3: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:10,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-10 18:35:10,372 INFO L280 TraceCheckUtils]: 5: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-10 18:35:10,373 INFO L280 TraceCheckUtils]: 6: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-10 18:35:10,374 INFO L280 TraceCheckUtils]: 7: Hoare triple {83#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {83#false} is VALID [2020-07-10 18:35:10,374 INFO L280 TraceCheckUtils]: 8: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-10 18:35:10,374 INFO L280 TraceCheckUtils]: 9: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:10,375 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {83#false} {82#true} #114#return; {83#false} is VALID [2020-07-10 18:35:10,375 INFO L280 TraceCheckUtils]: 11: Hoare triple {83#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {83#false} is VALID [2020-07-10 18:35:10,375 INFO L280 TraceCheckUtils]: 12: Hoare triple {83#false} assume 0 == #t~ret4; {83#false} is VALID [2020-07-10 18:35:10,376 INFO L280 TraceCheckUtils]: 13: Hoare triple {83#false} havoc #t~ret4; {83#false} is VALID [2020-07-10 18:35:10,376 INFO L280 TraceCheckUtils]: 14: Hoare triple {83#false} #res := ~y; {83#false} is VALID [2020-07-10 18:35:10,377 INFO L280 TraceCheckUtils]: 15: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:10,377 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {83#false} {82#true} #110#return; {83#false} is VALID [2020-07-10 18:35:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#true} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:10,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {82#true} is VALID [2020-07-10 18:35:10,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:10,391 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {82#true} {83#false} #112#return; {83#false} is VALID [2020-07-10 18:35:10,392 INFO L263 TraceCheckUtils]: 0: Hoare triple {82#true} call ULTIMATE.init(); {110#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:10,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {110#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-10 18:35:10,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-10 18:35:10,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-10 18:35:10,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:10,394 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {82#true} {82#true} #118#return; {82#true} is VALID [2020-07-10 18:35:10,394 INFO L263 TraceCheckUtils]: 6: Hoare triple {82#true} call #t~ret9 := main(); {82#true} is VALID [2020-07-10 18:35:10,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {82#true} is VALID [2020-07-10 18:35:10,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {82#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {82#true} is VALID [2020-07-10 18:35:10,397 INFO L263 TraceCheckUtils]: 9: Hoare triple {82#true} call #t~ret7 := fmax_double(~x~0, ~y~0); {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:10,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:10,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {82#true} ~y := #in~y; {82#true} is VALID [2020-07-10 18:35:10,399 INFO L263 TraceCheckUtils]: 12: Hoare triple {82#true} call #t~ret4 := __fpclassify_double(~x); {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:10,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:10,400 INFO L280 TraceCheckUtils]: 14: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-10 18:35:10,401 INFO L280 TraceCheckUtils]: 15: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-10 18:35:10,402 INFO L280 TraceCheckUtils]: 16: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-10 18:35:10,402 INFO L280 TraceCheckUtils]: 17: Hoare triple {83#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {83#false} is VALID [2020-07-10 18:35:10,402 INFO L280 TraceCheckUtils]: 18: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-10 18:35:10,403 INFO L280 TraceCheckUtils]: 19: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:10,403 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {83#false} {82#true} #114#return; {83#false} is VALID [2020-07-10 18:35:10,403 INFO L280 TraceCheckUtils]: 21: Hoare triple {83#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {83#false} is VALID [2020-07-10 18:35:10,404 INFO L280 TraceCheckUtils]: 22: Hoare triple {83#false} assume 0 == #t~ret4; {83#false} is VALID [2020-07-10 18:35:10,404 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#false} havoc #t~ret4; {83#false} is VALID [2020-07-10 18:35:10,404 INFO L280 TraceCheckUtils]: 24: Hoare triple {83#false} #res := ~y; {83#false} is VALID [2020-07-10 18:35:10,405 INFO L280 TraceCheckUtils]: 25: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:10,405 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {83#false} {82#true} #110#return; {83#false} is VALID [2020-07-10 18:35:10,405 INFO L280 TraceCheckUtils]: 27: Hoare triple {83#false} ~res~0 := #t~ret7; {83#false} is VALID [2020-07-10 18:35:10,406 INFO L280 TraceCheckUtils]: 28: Hoare triple {83#false} havoc #t~ret7; {83#false} is VALID [2020-07-10 18:35:10,406 INFO L263 TraceCheckUtils]: 29: Hoare triple {83#false} call #t~ret8 := isnan_double(~res~0); {82#true} is VALID [2020-07-10 18:35:10,406 INFO L280 TraceCheckUtils]: 30: Hoare triple {82#true} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:10,407 INFO L280 TraceCheckUtils]: 31: Hoare triple {82#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {82#true} is VALID [2020-07-10 18:35:10,407 INFO L280 TraceCheckUtils]: 32: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:10,407 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {82#true} {83#false} #112#return; {83#false} is VALID [2020-07-10 18:35:10,408 INFO L280 TraceCheckUtils]: 34: Hoare triple {83#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {83#false} is VALID [2020-07-10 18:35:10,408 INFO L280 TraceCheckUtils]: 35: Hoare triple {83#false} assume 0 == #t~ret8; {83#false} is VALID [2020-07-10 18:35:10,408 INFO L280 TraceCheckUtils]: 36: Hoare triple {83#false} havoc #t~ret8; {83#false} is VALID [2020-07-10 18:35:10,409 INFO L280 TraceCheckUtils]: 37: Hoare triple {83#false} assume !false; {83#false} is VALID [2020-07-10 18:35:10,414 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-10 18:35:10,415 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:10,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023842827] [2020-07-10 18:35:10,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:10,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 18:35:10,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703022628] [2020-07-10 18:35:10,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-10 18:35:10,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:10,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 18:35:10,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:10,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 18:35:10,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 18:35:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 18:35:10,515 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-07-10 18:35:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:11,128 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2020-07-10 18:35:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 18:35:11,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-10 18:35:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2020-07-10 18:35:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2020-07-10 18:35:11,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2020-07-10 18:35:11,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:11,401 INFO L225 Difference]: With dead ends: 144 [2020-07-10 18:35:11,401 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 18:35:11,405 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-10 18:35:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 18:35:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-10 18:35:11,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:11,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:11,516 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:11,516 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:11,524 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-10 18:35:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-10 18:35:11,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:11,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:11,527 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:11,527 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:11,534 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-10 18:35:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-10 18:35:11,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:11,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:11,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:11,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 18:35:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2020-07-10 18:35:11,543 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 38 [2020-07-10 18:35:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:11,544 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2020-07-10 18:35:11,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 18:35:11,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 79 transitions. [2020-07-10 18:35:11,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-10 18:35:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:35:11,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:11,658 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] [2020-07-10 18:35:11,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:35:11,659 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:11,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1870357407, now seen corresponding path program 1 times [2020-07-10 18:35:11,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:11,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956975484] [2020-07-10 18:35:11,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:11,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {701#true} is VALID [2020-07-10 18:35:11,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} #valid := #valid[0 := 0]; {701#true} is VALID [2020-07-10 18:35:11,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} assume 0 < #StackHeapBarrier; {701#true} is VALID [2020-07-10 18:35:11,770 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:11,771 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {701#true} {701#true} #118#return; {701#true} is VALID [2020-07-10 18:35:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:11,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:11,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-10 18:35:11,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-10 18:35:11,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {701#true} is VALID [2020-07-10 18:35:11,917 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {701#true} is VALID [2020-07-10 18:35:11,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {701#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {701#true} is VALID [2020-07-10 18:35:11,917 INFO L280 TraceCheckUtils]: 6: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-10 18:35:11,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {701#true} is VALID [2020-07-10 18:35:11,918 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-10 18:35:11,918 INFO L280 TraceCheckUtils]: 9: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-10 18:35:11,919 INFO L280 TraceCheckUtils]: 10: Hoare triple {701#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {701#true} is VALID [2020-07-10 18:35:11,919 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-10 18:35:11,919 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {701#true} is VALID [2020-07-10 18:35:11,920 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-10 18:35:11,920 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-10 18:35:11,920 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {701#true} is VALID [2020-07-10 18:35:11,921 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {701#true} is VALID [2020-07-10 18:35:11,921 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-10 18:35:11,921 INFO L280 TraceCheckUtils]: 18: Hoare triple {701#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {701#true} is VALID [2020-07-10 18:35:11,922 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:11,923 INFO L280 TraceCheckUtils]: 20: Hoare triple {768#(<= 2 |__fpclassify_double_#res|)} assume true; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:11,924 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #114#return; {767#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:11,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:11,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} ~y := #in~y; {701#true} is VALID [2020-07-10 18:35:11,927 INFO L263 TraceCheckUtils]: 2: Hoare triple {701#true} call #t~ret4 := __fpclassify_double(~x); {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:11,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:11,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-10 18:35:11,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-10 18:35:11,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {701#true} is VALID [2020-07-10 18:35:11,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {701#true} is VALID [2020-07-10 18:35:11,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {701#true} is VALID [2020-07-10 18:35:11,929 INFO L280 TraceCheckUtils]: 9: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-10 18:35:11,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {701#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {701#true} is VALID [2020-07-10 18:35:11,930 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-10 18:35:11,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-10 18:35:11,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {701#true} is VALID [2020-07-10 18:35:11,930 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-10 18:35:11,931 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {701#true} is VALID [2020-07-10 18:35:11,931 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-10 18:35:11,931 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-10 18:35:11,932 INFO L280 TraceCheckUtils]: 18: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {701#true} is VALID [2020-07-10 18:35:11,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {701#true} is VALID [2020-07-10 18:35:11,932 INFO L280 TraceCheckUtils]: 20: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-10 18:35:11,933 INFO L280 TraceCheckUtils]: 21: Hoare triple {701#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {701#true} is VALID [2020-07-10 18:35:11,934 INFO L280 TraceCheckUtils]: 22: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:11,934 INFO L280 TraceCheckUtils]: 23: Hoare triple {768#(<= 2 |__fpclassify_double_#res|)} assume true; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:11,936 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #114#return; {767#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:11,936 INFO L280 TraceCheckUtils]: 25: Hoare triple {767#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {767#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:11,937 INFO L280 TraceCheckUtils]: 26: Hoare triple {767#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {702#false} is VALID [2020-07-10 18:35:11,937 INFO L280 TraceCheckUtils]: 27: Hoare triple {702#false} havoc #t~ret4; {702#false} is VALID [2020-07-10 18:35:11,938 INFO L280 TraceCheckUtils]: 28: Hoare triple {702#false} #res := ~y; {702#false} is VALID [2020-07-10 18:35:11,938 INFO L280 TraceCheckUtils]: 29: Hoare triple {702#false} assume true; {702#false} is VALID [2020-07-10 18:35:11,938 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {702#false} {701#true} #110#return; {702#false} is VALID [2020-07-10 18:35:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:11,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {701#true} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:11,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {701#true} is VALID [2020-07-10 18:35:11,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:11,946 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {701#true} {702#false} #112#return; {702#false} is VALID [2020-07-10 18:35:11,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:11,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {701#true} is VALID [2020-07-10 18:35:11,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} #valid := #valid[0 := 0]; {701#true} is VALID [2020-07-10 18:35:11,948 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} assume 0 < #StackHeapBarrier; {701#true} is VALID [2020-07-10 18:35:11,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:11,949 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {701#true} {701#true} #118#return; {701#true} is VALID [2020-07-10 18:35:11,949 INFO L263 TraceCheckUtils]: 6: Hoare triple {701#true} call #t~ret9 := main(); {701#true} is VALID [2020-07-10 18:35:11,949 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {701#true} is VALID [2020-07-10 18:35:11,950 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {701#true} is VALID [2020-07-10 18:35:11,951 INFO L263 TraceCheckUtils]: 9: Hoare triple {701#true} call #t~ret7 := fmax_double(~x~0, ~y~0); {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:11,951 INFO L280 TraceCheckUtils]: 10: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:11,952 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} ~y := #in~y; {701#true} is VALID [2020-07-10 18:35:11,953 INFO L263 TraceCheckUtils]: 12: Hoare triple {701#true} call #t~ret4 := __fpclassify_double(~x); {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:11,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:11,954 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-10 18:35:11,954 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-10 18:35:11,954 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {701#true} is VALID [2020-07-10 18:35:11,955 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {701#true} is VALID [2020-07-10 18:35:11,955 INFO L280 TraceCheckUtils]: 18: Hoare triple {701#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {701#true} is VALID [2020-07-10 18:35:11,955 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-10 18:35:11,956 INFO L280 TraceCheckUtils]: 20: Hoare triple {701#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {701#true} is VALID [2020-07-10 18:35:11,956 INFO L280 TraceCheckUtils]: 21: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-10 18:35:11,956 INFO L280 TraceCheckUtils]: 22: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-10 18:35:11,956 INFO L280 TraceCheckUtils]: 23: Hoare triple {701#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {701#true} is VALID [2020-07-10 18:35:11,957 INFO L280 TraceCheckUtils]: 24: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-10 18:35:11,957 INFO L280 TraceCheckUtils]: 25: Hoare triple {701#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {701#true} is VALID [2020-07-10 18:35:11,957 INFO L280 TraceCheckUtils]: 26: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-10 18:35:11,958 INFO L280 TraceCheckUtils]: 27: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-10 18:35:11,958 INFO L280 TraceCheckUtils]: 28: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {701#true} is VALID [2020-07-10 18:35:11,958 INFO L280 TraceCheckUtils]: 29: Hoare triple {701#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {701#true} is VALID [2020-07-10 18:35:11,958 INFO L280 TraceCheckUtils]: 30: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-10 18:35:11,959 INFO L280 TraceCheckUtils]: 31: Hoare triple {701#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {701#true} is VALID [2020-07-10 18:35:11,959 INFO L280 TraceCheckUtils]: 32: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:11,960 INFO L280 TraceCheckUtils]: 33: Hoare triple {768#(<= 2 |__fpclassify_double_#res|)} assume true; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:11,961 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #114#return; {767#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:11,962 INFO L280 TraceCheckUtils]: 35: Hoare triple {767#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {767#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:11,963 INFO L280 TraceCheckUtils]: 36: Hoare triple {767#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {702#false} is VALID [2020-07-10 18:35:11,963 INFO L280 TraceCheckUtils]: 37: Hoare triple {702#false} havoc #t~ret4; {702#false} is VALID [2020-07-10 18:35:11,963 INFO L280 TraceCheckUtils]: 38: Hoare triple {702#false} #res := ~y; {702#false} is VALID [2020-07-10 18:35:11,964 INFO L280 TraceCheckUtils]: 39: Hoare triple {702#false} assume true; {702#false} is VALID [2020-07-10 18:35:11,964 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {702#false} {701#true} #110#return; {702#false} is VALID [2020-07-10 18:35:11,964 INFO L280 TraceCheckUtils]: 41: Hoare triple {702#false} ~res~0 := #t~ret7; {702#false} is VALID [2020-07-10 18:35:11,965 INFO L280 TraceCheckUtils]: 42: Hoare triple {702#false} havoc #t~ret7; {702#false} is VALID [2020-07-10 18:35:11,965 INFO L263 TraceCheckUtils]: 43: Hoare triple {702#false} call #t~ret8 := isnan_double(~res~0); {701#true} is VALID [2020-07-10 18:35:11,965 INFO L280 TraceCheckUtils]: 44: Hoare triple {701#true} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:11,965 INFO L280 TraceCheckUtils]: 45: Hoare triple {701#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {701#true} is VALID [2020-07-10 18:35:11,966 INFO L280 TraceCheckUtils]: 46: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:11,966 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {701#true} {702#false} #112#return; {702#false} is VALID [2020-07-10 18:35:11,966 INFO L280 TraceCheckUtils]: 48: Hoare triple {702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {702#false} is VALID [2020-07-10 18:35:11,966 INFO L280 TraceCheckUtils]: 49: Hoare triple {702#false} assume 0 == #t~ret8; {702#false} is VALID [2020-07-10 18:35:11,967 INFO L280 TraceCheckUtils]: 50: Hoare triple {702#false} havoc #t~ret8; {702#false} is VALID [2020-07-10 18:35:11,967 INFO L280 TraceCheckUtils]: 51: Hoare triple {702#false} assume !false; {702#false} is VALID [2020-07-10 18:35:11,970 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-10 18:35:11,971 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:11,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956975484] [2020-07-10 18:35:11,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:11,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:11,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344931093] [2020-07-10 18:35:11,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:11,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:11,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:12,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:12,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:12,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:12,031 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2020-07-10 18:35:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:12,586 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-10 18:35:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:12,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:12,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-10 18:35:12,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:12,738 INFO L225 Difference]: With dead ends: 93 [2020-07-10 18:35:12,739 INFO L226 Difference]: Without dead ends: 77 [2020-07-10 18:35:12,740 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-10 18:35:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-10 18:35:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-07-10 18:35:12,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:12,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 76 states. [2020-07-10 18:35:12,809 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 76 states. [2020-07-10 18:35:12,809 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 76 states. [2020-07-10 18:35:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:12,814 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-10 18:35:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-10 18:35:12,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:12,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:12,815 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 77 states. [2020-07-10 18:35:12,816 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 77 states. [2020-07-10 18:35:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:12,821 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-10 18:35:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-10 18:35:12,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:12,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:12,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:12,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 18:35:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-07-10 18:35:12,833 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 52 [2020-07-10 18:35:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:12,833 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-07-10 18:35:12,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:12,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2020-07-10 18:35:12,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-07-10 18:35:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 18:35:12,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:12,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:12,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:35:12,950 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash 116411547, now seen corresponding path program 1 times [2020-07-10 18:35:12,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:12,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137475562] [2020-07-10 18:35:12,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {1311#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1266#true} is VALID [2020-07-10 18:35:13,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} #valid := #valid[0 := 0]; {1266#true} is VALID [2020-07-10 18:35:13,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume 0 < #StackHeapBarrier; {1266#true} is VALID [2020-07-10 18:35:13,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:13,035 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1266#true} {1266#true} #118#return; {1266#true} is VALID [2020-07-10 18:35:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:13,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-10 18:35:13,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-10 18:35:13,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1266#true} is VALID [2020-07-10 18:35:13,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1266#true} is VALID [2020-07-10 18:35:13,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {1266#true} is VALID [2020-07-10 18:35:13,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-10 18:35:13,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {1266#true} is VALID [2020-07-10 18:35:13,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-10 18:35:13,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-10 18:35:13,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {1266#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {1266#true} is VALID [2020-07-10 18:35:13,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-10 18:35:13,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {1266#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {1266#true} is VALID [2020-07-10 18:35:13,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-10 18:35:13,182 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-10 18:35:13,183 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1266#true} is VALID [2020-07-10 18:35:13,183 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1266#true} is VALID [2020-07-10 18:35:13,183 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-10 18:35:13,184 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1266#true} is VALID [2020-07-10 18:35:13,184 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1266#true} is VALID [2020-07-10 18:35:13,184 INFO L280 TraceCheckUtils]: 20: Hoare triple {1266#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1266#true} is VALID [2020-07-10 18:35:13,185 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1266#true} is VALID [2020-07-10 18:35:13,185 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,186 INFO L280 TraceCheckUtils]: 23: Hoare triple {1339#(= 1 |__fpclassify_double_#res|)} assume true; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,187 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #114#return; {1338#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:13,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:13,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} ~y := #in~y; {1266#true} is VALID [2020-07-10 18:35:13,190 INFO L263 TraceCheckUtils]: 2: Hoare triple {1266#true} call #t~ret4 := __fpclassify_double(~x); {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:13,191 INFO L280 TraceCheckUtils]: 3: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:13,191 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-10 18:35:13,191 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-10 18:35:13,192 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1266#true} is VALID [2020-07-10 18:35:13,192 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1266#true} is VALID [2020-07-10 18:35:13,192 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {1266#true} is VALID [2020-07-10 18:35:13,192 INFO L280 TraceCheckUtils]: 9: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-10 18:35:13,193 INFO L280 TraceCheckUtils]: 10: Hoare triple {1266#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {1266#true} is VALID [2020-07-10 18:35:13,193 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-10 18:35:13,193 INFO L280 TraceCheckUtils]: 12: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-10 18:35:13,193 INFO L280 TraceCheckUtils]: 13: Hoare triple {1266#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {1266#true} is VALID [2020-07-10 18:35:13,194 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-10 18:35:13,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {1266#true} is VALID [2020-07-10 18:35:13,194 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-10 18:35:13,195 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-10 18:35:13,195 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1266#true} is VALID [2020-07-10 18:35:13,195 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1266#true} is VALID [2020-07-10 18:35:13,195 INFO L280 TraceCheckUtils]: 20: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-10 18:35:13,196 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1266#true} is VALID [2020-07-10 18:35:13,196 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1266#true} is VALID [2020-07-10 18:35:13,196 INFO L280 TraceCheckUtils]: 23: Hoare triple {1266#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1266#true} is VALID [2020-07-10 18:35:13,196 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1266#true} is VALID [2020-07-10 18:35:13,197 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,198 INFO L280 TraceCheckUtils]: 26: Hoare triple {1339#(= 1 |__fpclassify_double_#res|)} assume true; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,199 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #114#return; {1338#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:13,200 INFO L280 TraceCheckUtils]: 28: Hoare triple {1338#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1338#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:13,202 INFO L280 TraceCheckUtils]: 29: Hoare triple {1338#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1267#false} is VALID [2020-07-10 18:35:13,203 INFO L280 TraceCheckUtils]: 30: Hoare triple {1267#false} havoc #t~ret4; {1267#false} is VALID [2020-07-10 18:35:13,203 INFO L280 TraceCheckUtils]: 31: Hoare triple {1267#false} #res := ~y; {1267#false} is VALID [2020-07-10 18:35:13,203 INFO L280 TraceCheckUtils]: 32: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-10 18:35:13,203 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1267#false} {1266#true} #110#return; {1267#false} is VALID [2020-07-10 18:35:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {1266#true} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:13,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1266#true} is VALID [2020-07-10 18:35:13,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:13,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1267#false} #112#return; {1267#false} is VALID [2020-07-10 18:35:13,213 INFO L263 TraceCheckUtils]: 0: Hoare triple {1266#true} call ULTIMATE.init(); {1311#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:13,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {1311#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1266#true} is VALID [2020-07-10 18:35:13,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} #valid := #valid[0 := 0]; {1266#true} is VALID [2020-07-10 18:35:13,214 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume 0 < #StackHeapBarrier; {1266#true} is VALID [2020-07-10 18:35:13,215 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:13,215 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1266#true} {1266#true} #118#return; {1266#true} is VALID [2020-07-10 18:35:13,215 INFO L263 TraceCheckUtils]: 6: Hoare triple {1266#true} call #t~ret9 := main(); {1266#true} is VALID [2020-07-10 18:35:13,215 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1266#true} is VALID [2020-07-10 18:35:13,216 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1266#true} is VALID [2020-07-10 18:35:13,217 INFO L263 TraceCheckUtils]: 9: Hoare triple {1266#true} call #t~ret7 := fmax_double(~x~0, ~y~0); {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:13,217 INFO L280 TraceCheckUtils]: 10: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:13,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} ~y := #in~y; {1266#true} is VALID [2020-07-10 18:35:13,219 INFO L263 TraceCheckUtils]: 12: Hoare triple {1266#true} call #t~ret4 := __fpclassify_double(~x); {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:13,219 INFO L280 TraceCheckUtils]: 13: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:13,220 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-10 18:35:13,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-10 18:35:13,220 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1266#true} is VALID [2020-07-10 18:35:13,220 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1266#true} is VALID [2020-07-10 18:35:13,221 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L31 {1266#true} is VALID [2020-07-10 18:35:13,221 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-10 18:35:13,221 INFO L280 TraceCheckUtils]: 20: Hoare triple {1266#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L32-1 {1266#true} is VALID [2020-07-10 18:35:13,221 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-10 18:35:13,222 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-10 18:35:13,222 INFO L280 TraceCheckUtils]: 23: Hoare triple {1266#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L33 {1266#true} is VALID [2020-07-10 18:35:13,222 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-10 18:35:13,222 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L33-2 {1266#true} is VALID [2020-07-10 18:35:13,223 INFO L280 TraceCheckUtils]: 26: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-10 18:35:13,223 INFO L280 TraceCheckUtils]: 27: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-10 18:35:13,223 INFO L280 TraceCheckUtils]: 28: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1266#true} is VALID [2020-07-10 18:35:13,223 INFO L280 TraceCheckUtils]: 29: Hoare triple {1266#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1266#true} is VALID [2020-07-10 18:35:13,224 INFO L280 TraceCheckUtils]: 30: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-10 18:35:13,224 INFO L280 TraceCheckUtils]: 31: Hoare triple {1266#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1266#true} is VALID [2020-07-10 18:35:13,224 INFO L280 TraceCheckUtils]: 32: Hoare triple {1266#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1266#true} is VALID [2020-07-10 18:35:13,224 INFO L280 TraceCheckUtils]: 33: Hoare triple {1266#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1266#true} is VALID [2020-07-10 18:35:13,225 INFO L280 TraceCheckUtils]: 34: Hoare triple {1266#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1266#true} is VALID [2020-07-10 18:35:13,226 INFO L280 TraceCheckUtils]: 35: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,227 INFO L280 TraceCheckUtils]: 36: Hoare triple {1339#(= 1 |__fpclassify_double_#res|)} assume true; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,229 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #114#return; {1338#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:13,229 INFO L280 TraceCheckUtils]: 38: Hoare triple {1338#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1338#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:13,230 INFO L280 TraceCheckUtils]: 39: Hoare triple {1338#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1267#false} is VALID [2020-07-10 18:35:13,230 INFO L280 TraceCheckUtils]: 40: Hoare triple {1267#false} havoc #t~ret4; {1267#false} is VALID [2020-07-10 18:35:13,230 INFO L280 TraceCheckUtils]: 41: Hoare triple {1267#false} #res := ~y; {1267#false} is VALID [2020-07-10 18:35:13,231 INFO L280 TraceCheckUtils]: 42: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-10 18:35:13,231 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1267#false} {1266#true} #110#return; {1267#false} is VALID [2020-07-10 18:35:13,231 INFO L280 TraceCheckUtils]: 44: Hoare triple {1267#false} ~res~0 := #t~ret7; {1267#false} is VALID [2020-07-10 18:35:13,231 INFO L280 TraceCheckUtils]: 45: Hoare triple {1267#false} havoc #t~ret7; {1267#false} is VALID [2020-07-10 18:35:13,232 INFO L263 TraceCheckUtils]: 46: Hoare triple {1267#false} call #t~ret8 := isnan_double(~res~0); {1266#true} is VALID [2020-07-10 18:35:13,232 INFO L280 TraceCheckUtils]: 47: Hoare triple {1266#true} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:13,232 INFO L280 TraceCheckUtils]: 48: Hoare triple {1266#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1266#true} is VALID [2020-07-10 18:35:13,232 INFO L280 TraceCheckUtils]: 49: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:13,233 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1266#true} {1267#false} #112#return; {1267#false} is VALID [2020-07-10 18:35:13,233 INFO L280 TraceCheckUtils]: 51: Hoare triple {1267#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1267#false} is VALID [2020-07-10 18:35:13,233 INFO L280 TraceCheckUtils]: 52: Hoare triple {1267#false} assume 0 == #t~ret8; {1267#false} is VALID [2020-07-10 18:35:13,233 INFO L280 TraceCheckUtils]: 53: Hoare triple {1267#false} havoc #t~ret8; {1267#false} is VALID [2020-07-10 18:35:13,234 INFO L280 TraceCheckUtils]: 54: Hoare triple {1267#false} assume !false; {1267#false} is VALID [2020-07-10 18:35:13,237 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-10 18:35:13,237 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:13,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137475562] [2020-07-10 18:35:13,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:13,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:13,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621460003] [2020-07-10 18:35:13,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-10 18:35:13,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:13,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:13,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:13,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:13,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:13,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:13,298 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 6 states. [2020-07-10 18:35:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:13,889 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2020-07-10 18:35:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:13,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-10 18:35:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:13,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-10 18:35:14,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:14,030 INFO L225 Difference]: With dead ends: 97 [2020-07-10 18:35:14,030 INFO L226 Difference]: Without dead ends: 81 [2020-07-10 18:35:14,032 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-10 18:35:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-10 18:35:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2020-07-10 18:35:14,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:14,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 76 states. [2020-07-10 18:35:14,114 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 76 states. [2020-07-10 18:35:14,115 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 76 states. [2020-07-10 18:35:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:14,122 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2020-07-10 18:35:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-10 18:35:14,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:14,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:14,124 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 81 states. [2020-07-10 18:35:14,124 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 81 states. [2020-07-10 18:35:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:14,129 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2020-07-10 18:35:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-10 18:35:14,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:14,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:14,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:14,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 18:35:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-07-10 18:35:14,139 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 55 [2020-07-10 18:35:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:14,139 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-07-10 18:35:14,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:14,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2020-07-10 18:35:14,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-07-10 18:35:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 18:35:14,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:14,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:14,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:35:14,232 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:14,233 INFO L82 PathProgramCache]: Analyzing trace with hash -278535077, now seen corresponding path program 1 times [2020-07-10 18:35:14,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:14,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763903266] [2020-07-10 18:35:14,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:14,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:35:14,453 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.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) 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-10 18:35:14,461 INFO L168 Benchmark]: Toolchain (without parser) took 5582.82 ms. Allocated memory was 142.1 MB in the beginning and 270.5 MB in the end (delta: 128.5 MB). Free memory was 103.7 MB in the beginning and 184.0 MB in the end (delta: -80.3 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:14,462 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:35:14,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.24 ms. Allocated memory was 142.1 MB in the beginning and 207.1 MB in the end (delta: 65.0 MB). Free memory was 103.3 MB in the beginning and 186.1 MB in the end (delta: -82.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:14,463 INFO L168 Benchmark]: Boogie Preprocessor took 81.82 ms. Allocated memory is still 207.1 MB. Free memory was 186.1 MB in the beginning and 183.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:14,464 INFO L168 Benchmark]: RCFGBuilder took 552.34 ms. Allocated memory is still 207.1 MB. Free memory was 183.8 MB in the beginning and 149.1 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:14,465 INFO L168 Benchmark]: TraceAbstraction took 4498.58 ms. Allocated memory was 207.1 MB in the beginning and 270.5 MB in the end (delta: 63.4 MB). Free memory was 148.5 MB in the beginning and 184.0 MB in the end (delta: -35.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:14,469 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.18 ms. Allocated memory is still 142.1 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 444.24 ms. Allocated memory was 142.1 MB in the beginning and 207.1 MB in the end (delta: 65.0 MB). Free memory was 103.3 MB in the beginning and 186.1 MB in the end (delta: -82.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.82 ms. Allocated memory is still 207.1 MB. Free memory was 186.1 MB in the beginning and 183.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 552.34 ms. Allocated memory is still 207.1 MB. Free memory was 183.8 MB in the beginning and 149.1 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4498.58 ms. Allocated memory was 207.1 MB in the beginning and 270.5 MB in the end (delta: 63.4 MB). Free memory was 148.5 MB in the beginning and 184.0 MB in the end (delta: -35.6 MB). Peak memory consumption was 27.8 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...