/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_1230.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:35:04,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:35:04,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:35:04,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:35:04,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:35:04,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:35:04,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:35:04,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:35:04,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:35:04,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:35:04,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:35:04,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:35:04,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:35:04,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:35:04,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:35:04,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:35:04,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:35:04,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:35:04,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:35:04,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:35:04,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:35:04,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:35:04,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:35:04,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:35:04,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:35:04,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:35:04,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:35:04,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:35:04,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:35:04,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:35:04,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:35:04,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:35:04,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:35:04,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:35:04,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:35:04,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:35:04,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:35:04,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:35:04,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:35:04,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:35:04,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:35:04,754 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:04,764 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:35:04,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:35:04,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:35:04,766 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:35:04,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:35:04,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:35:04,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:35:04,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:35:04,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:35:04,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:35:04,767 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:35:04,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:35:04,768 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:35:04,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:35:04,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:35:04,768 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:35:04,768 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:35:04,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:35:04,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:04,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:35:04,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:35:04,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:35:04,769 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:35:05,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:35:05,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:35:05,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:35:05,095 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:35:05,095 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:35:05,096 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-07-10 18:35:05,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/414bd96b0/7567edb1124d40bbbf054cf21d0b47e0/FLAG6367939cb [2020-07-10 18:35:05,616 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:35:05,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-07-10 18:35:05,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/414bd96b0/7567edb1124d40bbbf054cf21d0b47e0/FLAG6367939cb [2020-07-10 18:35:05,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/414bd96b0/7567edb1124d40bbbf054cf21d0b47e0 [2020-07-10 18:35:05,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:35:05,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:35:05,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:05,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:35:06,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:35:06,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:05" (1/1) ... [2020-07-10 18:35:06,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad076de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:06, skipping insertion in model container [2020-07-10 18:35:06,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:05" (1/1) ... [2020-07-10 18:35:06,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:35:06,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:35:06,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:06,248 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:35:06,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:06,390 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:35:06,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:06 WrapperNode [2020-07-10 18:35:06,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:06,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:35:06,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:35:06,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:35:06,406 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:06" (1/1) ... [2020-07-10 18:35:06,406 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:06" (1/1) ... [2020-07-10 18:35:06,415 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:06" (1/1) ... [2020-07-10 18:35:06,416 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:06" (1/1) ... [2020-07-10 18:35:06,434 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:06" (1/1) ... [2020-07-10 18:35:06,440 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:06" (1/1) ... [2020-07-10 18:35:06,441 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:06" (1/1) ... [2020-07-10 18:35:06,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:35:06,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:35:06,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:35:06,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:35:06,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:06" (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:06,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:35:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:35:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 18:35:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 18:35:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-10 18:35:06,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:35:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:35:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 18:35:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 18:35:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 18:35:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 18:35:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 18:35:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:35:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:35:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-10 18:35:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:35:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:35:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:35:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:35:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 18:35:06,970 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:35:06,970 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 18:35:06,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:06 BoogieIcfgContainer [2020-07-10 18:35:06,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:35:06,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:35:06,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:35:06,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:35:06,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:35:05" (1/3) ... [2020-07-10 18:35:06,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7778daa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:06, skipping insertion in model container [2020-07-10 18:35:06,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:06" (2/3) ... [2020-07-10 18:35:06,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7778daa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:06, skipping insertion in model container [2020-07-10 18:35:06,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:06" (3/3) ... [2020-07-10 18:35:06,992 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2020-07-10 18:35:07,004 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:35:07,012 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:35:07,029 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:35:07,054 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:35:07,054 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:35:07,054 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:35:07,055 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:35:07,055 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:35:07,055 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:35:07,055 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:35:07,056 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:35:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-07-10 18:35:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 18:35:07,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:07,106 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:07,106 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 6613302, now seen corresponding path program 1 times [2020-07-10 18:35:07,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:07,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1678861931] [2020-07-10 18:35:07,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:07,387 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:07,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-10 18:35:07,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-10 18:35:07,388 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:07,389 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {82#true} {82#true} #114#return; {82#true} is VALID [2020-07-10 18:35:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:07,449 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:07,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-10 18:35:07,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-10 18:35:07,452 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-10 18:35:07,452 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:07,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-10 18:35:07,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:07,454 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {83#false} {82#true} #118#return; {83#false} is VALID [2020-07-10 18:35:07,455 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:07,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} ~y := #in~y; {82#true} is VALID [2020-07-10 18:35:07,458 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:07,458 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:07,459 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-10 18:35:07,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-10 18:35:07,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-10 18:35:07,461 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:07,461 INFO L280 TraceCheckUtils]: 8: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-10 18:35:07,462 INFO L280 TraceCheckUtils]: 9: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:07,462 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {83#false} {82#true} #118#return; {83#false} is VALID [2020-07-10 18:35:07,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {83#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {83#false} is VALID [2020-07-10 18:35:07,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {83#false} assume 0 == #t~ret4; {83#false} is VALID [2020-07-10 18:35:07,463 INFO L280 TraceCheckUtils]: 13: Hoare triple {83#false} havoc #t~ret4; {83#false} is VALID [2020-07-10 18:35:07,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {83#false} #res := ~y; {83#false} is VALID [2020-07-10 18:35:07,464 INFO L280 TraceCheckUtils]: 15: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:07,464 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {83#false} {82#true} #110#return; {83#false} is VALID [2020-07-10 18:35:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:07,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#true} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:07,480 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:07,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:07,481 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {82#true} {83#false} #112#return; {83#false} is VALID [2020-07-10 18:35:07,482 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:07,483 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:07,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-10 18:35:07,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-10 18:35:07,484 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:07,484 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {82#true} {82#true} #114#return; {82#true} is VALID [2020-07-10 18:35:07,485 INFO L263 TraceCheckUtils]: 6: Hoare triple {82#true} call #t~ret9 := main(); {82#true} is VALID [2020-07-10 18:35:07,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {82#true} is VALID [2020-07-10 18:35:07,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {82#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {82#true} is VALID [2020-07-10 18:35:07,488 INFO L263 TraceCheckUtils]: 9: Hoare triple {82#true} call #t~ret7 := fmin_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:07,488 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:07,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {82#true} ~y := #in~y; {82#true} is VALID [2020-07-10 18:35:07,490 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:07,491 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:07,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-10 18:35:07,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-10 18:35:07,493 INFO L280 TraceCheckUtils]: 16: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-10 18:35:07,493 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:07,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-10 18:35:07,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:07,494 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {83#false} {82#true} #118#return; {83#false} is VALID [2020-07-10 18:35:07,494 INFO L280 TraceCheckUtils]: 21: Hoare triple {83#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {83#false} is VALID [2020-07-10 18:35:07,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {83#false} assume 0 == #t~ret4; {83#false} is VALID [2020-07-10 18:35:07,495 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#false} havoc #t~ret4; {83#false} is VALID [2020-07-10 18:35:07,495 INFO L280 TraceCheckUtils]: 24: Hoare triple {83#false} #res := ~y; {83#false} is VALID [2020-07-10 18:35:07,496 INFO L280 TraceCheckUtils]: 25: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-10 18:35:07,496 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {83#false} {82#true} #110#return; {83#false} is VALID [2020-07-10 18:35:07,496 INFO L280 TraceCheckUtils]: 27: Hoare triple {83#false} ~res~0 := #t~ret7; {83#false} is VALID [2020-07-10 18:35:07,497 INFO L280 TraceCheckUtils]: 28: Hoare triple {83#false} havoc #t~ret7; {83#false} is VALID [2020-07-10 18:35:07,497 INFO L263 TraceCheckUtils]: 29: Hoare triple {83#false} call #t~ret8 := isnan_double(~res~0); {82#true} is VALID [2020-07-10 18:35:07,497 INFO L280 TraceCheckUtils]: 30: Hoare triple {82#true} ~x := #in~x; {82#true} is VALID [2020-07-10 18:35:07,498 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:07,498 INFO L280 TraceCheckUtils]: 32: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-10 18:35:07,498 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {82#true} {83#false} #112#return; {83#false} is VALID [2020-07-10 18:35:07,499 INFO L280 TraceCheckUtils]: 34: Hoare triple {83#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {83#false} is VALID [2020-07-10 18:35:07,499 INFO L280 TraceCheckUtils]: 35: Hoare triple {83#false} assume 0 == #t~ret8; {83#false} is VALID [2020-07-10 18:35:07,500 INFO L280 TraceCheckUtils]: 36: Hoare triple {83#false} havoc #t~ret8; {83#false} is VALID [2020-07-10 18:35:07,500 INFO L280 TraceCheckUtils]: 37: Hoare triple {83#false} assume !false; {83#false} is VALID [2020-07-10 18:35:07,505 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:07,506 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:07,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1678861931] [2020-07-10 18:35:07,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:07,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 18:35:07,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990926356] [2020-07-10 18:35:07,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-10 18:35:07,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:07,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 18:35:07,596 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:07,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 18:35:07,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 18:35:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 18:35:07,609 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-07-10 18:35:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:08,233 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2020-07-10 18:35:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 18:35:08,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-10 18:35:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2020-07-10 18:35:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2020-07-10 18:35:08,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2020-07-10 18:35:08,494 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:08,511 INFO L225 Difference]: With dead ends: 144 [2020-07-10 18:35:08,511 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 18:35:08,516 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:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 18:35:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-10 18:35:08,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:08,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:08,632 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:08,633 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:08,642 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-10 18:35:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-10 18:35:08,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:08,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:08,644 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:08,644 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 18:35:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:08,652 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-10 18:35:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-10 18:35:08,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:08,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:08,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:08,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 18:35:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2020-07-10 18:35:08,662 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 38 [2020-07-10 18:35:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:08,663 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2020-07-10 18:35:08,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 18:35:08,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 79 transitions. [2020-07-10 18:35:08,779 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:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-10 18:35:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:35:08,782 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:08,782 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:08,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:35:08,783 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1569895040, now seen corresponding path program 1 times [2020-07-10 18:35:08,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:08,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [688112442] [2020-07-10 18:35:08,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:08,907 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:08,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} #valid := #valid[0 := 0]; {701#true} is VALID [2020-07-10 18:35:08,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} assume 0 < #StackHeapBarrier; {701#true} is VALID [2020-07-10 18:35:08,908 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:08,908 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {701#true} {701#true} #114#return; {701#true} is VALID [2020-07-10 18:35:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:09,038 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:09,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-10 18:35:09,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-10 18:35:09,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {701#true} is VALID [2020-07-10 18:35:09,040 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {701#true} is VALID [2020-07-10 18:35:09,040 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: L22 {701#true} is VALID [2020-07-10 18:35:09,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-10 18:35:09,041 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: L23-1 {701#true} is VALID [2020-07-10 18:35:09,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-10 18:35:09,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-10 18:35:09,042 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: L24 {701#true} is VALID [2020-07-10 18:35:09,042 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-10 18:35:09,043 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: L24-2 {701#true} is VALID [2020-07-10 18:35:09,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-10 18:35:09,043 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-10 18:35:09,044 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {701#true} is VALID [2020-07-10 18:35:09,044 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:09,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-10 18:35:09,045 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:09,046 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:09,047 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:09,048 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #118#return; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:09,049 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:09,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} ~y := #in~y; {701#true} is VALID [2020-07-10 18:35:09,050 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:09,051 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:09,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-10 18:35:09,052 INFO L280 TraceCheckUtils]: 5: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-10 18:35:09,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {701#true} is VALID [2020-07-10 18:35:09,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {701#true} is VALID [2020-07-10 18:35:09,053 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: L22 {701#true} is VALID [2020-07-10 18:35:09,053 INFO L280 TraceCheckUtils]: 9: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-10 18:35:09,053 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: L23-1 {701#true} is VALID [2020-07-10 18:35:09,054 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-10 18:35:09,054 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-10 18:35:09,054 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: L24 {701#true} is VALID [2020-07-10 18:35:09,054 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-10 18:35:09,055 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: L24-2 {701#true} is VALID [2020-07-10 18:35:09,055 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-10 18:35:09,055 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-10 18:35:09,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {701#true} is VALID [2020-07-10 18:35:09,056 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:09,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-10 18:35:09,057 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:09,058 INFO L280 TraceCheckUtils]: 22: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:09,059 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:09,060 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #118#return; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:09,061 INFO L280 TraceCheckUtils]: 25: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:09,061 INFO L280 TraceCheckUtils]: 26: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {702#false} is VALID [2020-07-10 18:35:09,062 INFO L280 TraceCheckUtils]: 27: Hoare triple {702#false} havoc #t~ret4; {702#false} is VALID [2020-07-10 18:35:09,062 INFO L280 TraceCheckUtils]: 28: Hoare triple {702#false} #res := ~y; {702#false} is VALID [2020-07-10 18:35:09,062 INFO L280 TraceCheckUtils]: 29: Hoare triple {702#false} assume true; {702#false} is VALID [2020-07-10 18:35:09,063 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {702#false} {701#true} #110#return; {702#false} is VALID [2020-07-10 18:35:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:09,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {701#true} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:09,069 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:09,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:09,070 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {701#true} {702#false} #112#return; {702#false} is VALID [2020-07-10 18:35:09,071 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:09,072 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:09,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} #valid := #valid[0 := 0]; {701#true} is VALID [2020-07-10 18:35:09,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} assume 0 < #StackHeapBarrier; {701#true} is VALID [2020-07-10 18:35:09,073 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:09,073 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {701#true} {701#true} #114#return; {701#true} is VALID [2020-07-10 18:35:09,073 INFO L263 TraceCheckUtils]: 6: Hoare triple {701#true} call #t~ret9 := main(); {701#true} is VALID [2020-07-10 18:35:09,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {701#true} is VALID [2020-07-10 18:35:09,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {701#true} is VALID [2020-07-10 18:35:09,075 INFO L263 TraceCheckUtils]: 9: Hoare triple {701#true} call #t~ret7 := fmin_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:09,076 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:09,076 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} ~y := #in~y; {701#true} is VALID [2020-07-10 18:35:09,077 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:09,077 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:09,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-10 18:35:09,078 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-10 18:35:09,078 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {701#true} is VALID [2020-07-10 18:35:09,079 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {701#true} is VALID [2020-07-10 18:35:09,079 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: L22 {701#true} is VALID [2020-07-10 18:35:09,079 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-10 18:35:09,080 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: L23-1 {701#true} is VALID [2020-07-10 18:35:09,080 INFO L280 TraceCheckUtils]: 21: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-10 18:35:09,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-10 18:35:09,080 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: L24 {701#true} is VALID [2020-07-10 18:35:09,081 INFO L280 TraceCheckUtils]: 24: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-10 18:35:09,081 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: L24-2 {701#true} is VALID [2020-07-10 18:35:09,081 INFO L280 TraceCheckUtils]: 26: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-10 18:35:09,081 INFO L280 TraceCheckUtils]: 27: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-10 18:35:09,082 INFO L280 TraceCheckUtils]: 28: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {701#true} is VALID [2020-07-10 18:35:09,082 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:09,082 INFO L280 TraceCheckUtils]: 30: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-10 18:35:09,083 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:09,084 INFO L280 TraceCheckUtils]: 32: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:09,084 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:09,085 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #118#return; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:09,086 INFO L280 TraceCheckUtils]: 35: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:09,087 INFO L280 TraceCheckUtils]: 36: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {702#false} is VALID [2020-07-10 18:35:09,087 INFO L280 TraceCheckUtils]: 37: Hoare triple {702#false} havoc #t~ret4; {702#false} is VALID [2020-07-10 18:35:09,087 INFO L280 TraceCheckUtils]: 38: Hoare triple {702#false} #res := ~y; {702#false} is VALID [2020-07-10 18:35:09,087 INFO L280 TraceCheckUtils]: 39: Hoare triple {702#false} assume true; {702#false} is VALID [2020-07-10 18:35:09,088 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {702#false} {701#true} #110#return; {702#false} is VALID [2020-07-10 18:35:09,088 INFO L280 TraceCheckUtils]: 41: Hoare triple {702#false} ~res~0 := #t~ret7; {702#false} is VALID [2020-07-10 18:35:09,088 INFO L280 TraceCheckUtils]: 42: Hoare triple {702#false} havoc #t~ret7; {702#false} is VALID [2020-07-10 18:35:09,089 INFO L263 TraceCheckUtils]: 43: Hoare triple {702#false} call #t~ret8 := isnan_double(~res~0); {701#true} is VALID [2020-07-10 18:35:09,089 INFO L280 TraceCheckUtils]: 44: Hoare triple {701#true} ~x := #in~x; {701#true} is VALID [2020-07-10 18:35:09,089 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:09,089 INFO L280 TraceCheckUtils]: 46: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-10 18:35:09,090 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {701#true} {702#false} #112#return; {702#false} is VALID [2020-07-10 18:35:09,090 INFO L280 TraceCheckUtils]: 48: Hoare triple {702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {702#false} is VALID [2020-07-10 18:35:09,090 INFO L280 TraceCheckUtils]: 49: Hoare triple {702#false} assume 0 == #t~ret8; {702#false} is VALID [2020-07-10 18:35:09,090 INFO L280 TraceCheckUtils]: 50: Hoare triple {702#false} havoc #t~ret8; {702#false} is VALID [2020-07-10 18:35:09,091 INFO L280 TraceCheckUtils]: 51: Hoare triple {702#false} assume !false; {702#false} is VALID [2020-07-10 18:35:09,094 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:09,094 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:09,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [688112442] [2020-07-10 18:35:09,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:09,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:09,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468914693] [2020-07-10 18:35:09,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:09,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:09,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:09,155 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:09,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:09,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:09,156 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2020-07-10 18:35:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:09,827 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-10 18:35:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:09,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:09,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-10 18:35:09,955 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:09,960 INFO L225 Difference]: With dead ends: 93 [2020-07-10 18:35:09,960 INFO L226 Difference]: Without dead ends: 77 [2020-07-10 18:35:09,962 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:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-10 18:35:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-07-10 18:35:10,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:10,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 76 states. [2020-07-10 18:35:10,038 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 76 states. [2020-07-10 18:35:10,038 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 76 states. [2020-07-10 18:35:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:10,049 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-10 18:35:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-10 18:35:10,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:10,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:10,050 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 77 states. [2020-07-10 18:35:10,050 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 77 states. [2020-07-10 18:35:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:10,055 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-10 18:35:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-10 18:35:10,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:10,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:10,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:10,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 18:35:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-07-10 18:35:10,061 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 52 [2020-07-10 18:35:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:10,061 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-07-10 18:35:10,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:10,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2020-07-10 18:35:10,152 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:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-07-10 18:35:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 18:35:10,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:10,155 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:10,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:35:10,156 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1915658490, now seen corresponding path program 1 times [2020-07-10 18:35:10,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:10,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2142313281] [2020-07-10 18:35:10,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,250 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:10,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} #valid := #valid[0 := 0]; {1266#true} is VALID [2020-07-10 18:35:10,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume 0 < #StackHeapBarrier; {1266#true} is VALID [2020-07-10 18:35:10,251 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:10,251 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1266#true} {1266#true} #114#return; {1266#true} is VALID [2020-07-10 18:35:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,393 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:10,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-10 18:35:10,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-10 18:35:10,394 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1266#true} is VALID [2020-07-10 18:35:10,397 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1266#true} is VALID [2020-07-10 18:35:10,398 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: L22 {1266#true} is VALID [2020-07-10 18:35:10,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-10 18:35:10,398 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: L23-1 {1266#true} is VALID [2020-07-10 18:35:10,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-10 18:35:10,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-10 18:35:10,399 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: L24 {1266#true} is VALID [2020-07-10 18:35:10,399 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-10 18:35:10,401 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: L24-2 {1266#true} is VALID [2020-07-10 18:35:10,402 INFO L280 TraceCheckUtils]: 13: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-10 18:35:10,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-10 18:35:10,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1266#true} is VALID [2020-07-10 18:35:10,402 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:10,403 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-10 18:35:10,403 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:10,404 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:10,405 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:10,405 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:10,406 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:10,407 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:10,408 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #118#return; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:10,408 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:10,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} ~y := #in~y; {1266#true} is VALID [2020-07-10 18:35:10,410 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:10,410 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:10,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-10 18:35:10,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-10 18:35:10,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1266#true} is VALID [2020-07-10 18:35:10,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1266#true} is VALID [2020-07-10 18:35:10,411 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: L22 {1266#true} is VALID [2020-07-10 18:35:10,412 INFO L280 TraceCheckUtils]: 9: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-10 18:35:10,412 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: L23-1 {1266#true} is VALID [2020-07-10 18:35:10,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-10 18:35:10,412 INFO L280 TraceCheckUtils]: 12: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-10 18:35:10,413 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: L24 {1266#true} is VALID [2020-07-10 18:35:10,413 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-10 18:35:10,413 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: L24-2 {1266#true} is VALID [2020-07-10 18:35:10,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-10 18:35:10,414 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-10 18:35:10,414 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1266#true} is VALID [2020-07-10 18:35:10,414 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:10,415 INFO L280 TraceCheckUtils]: 20: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-10 18:35:10,415 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:10,415 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:10,415 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:10,416 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:10,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:10,420 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:10,422 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #118#return; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:10,422 INFO L280 TraceCheckUtils]: 28: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:10,423 INFO L280 TraceCheckUtils]: 29: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1267#false} is VALID [2020-07-10 18:35:10,423 INFO L280 TraceCheckUtils]: 30: Hoare triple {1267#false} havoc #t~ret4; {1267#false} is VALID [2020-07-10 18:35:10,423 INFO L280 TraceCheckUtils]: 31: Hoare triple {1267#false} #res := ~y; {1267#false} is VALID [2020-07-10 18:35:10,424 INFO L280 TraceCheckUtils]: 32: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-10 18:35:10,424 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1267#false} {1266#true} #110#return; {1267#false} is VALID [2020-07-10 18:35:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:10,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {1266#true} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:10,433 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:10,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:10,433 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1267#false} #112#return; {1267#false} is VALID [2020-07-10 18:35:10,434 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:10,435 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:10,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} #valid := #valid[0 := 0]; {1266#true} is VALID [2020-07-10 18:35:10,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume 0 < #StackHeapBarrier; {1266#true} is VALID [2020-07-10 18:35:10,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:10,436 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1266#true} {1266#true} #114#return; {1266#true} is VALID [2020-07-10 18:35:10,436 INFO L263 TraceCheckUtils]: 6: Hoare triple {1266#true} call #t~ret9 := main(); {1266#true} is VALID [2020-07-10 18:35:10,436 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1266#true} is VALID [2020-07-10 18:35:10,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1266#true} is VALID [2020-07-10 18:35:10,438 INFO L263 TraceCheckUtils]: 9: Hoare triple {1266#true} call #t~ret7 := fmin_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:10,438 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:10,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} ~y := #in~y; {1266#true} is VALID [2020-07-10 18:35:10,440 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:10,440 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:10,440 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-10 18:35:10,441 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-10 18:35:10,441 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1266#true} is VALID [2020-07-10 18:35:10,441 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1266#true} is VALID [2020-07-10 18:35:10,442 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: L22 {1266#true} is VALID [2020-07-10 18:35:10,442 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-10 18:35:10,442 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: L23-1 {1266#true} is VALID [2020-07-10 18:35:10,442 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-10 18:35:10,443 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-10 18:35:10,443 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: L24 {1266#true} is VALID [2020-07-10 18:35:10,443 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-10 18:35:10,443 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: L24-2 {1266#true} is VALID [2020-07-10 18:35:10,444 INFO L280 TraceCheckUtils]: 26: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-10 18:35:10,444 INFO L280 TraceCheckUtils]: 27: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-10 18:35:10,444 INFO L280 TraceCheckUtils]: 28: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1266#true} is VALID [2020-07-10 18:35:10,444 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:10,445 INFO L280 TraceCheckUtils]: 30: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-10 18:35:10,445 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:10,445 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:10,445 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:10,446 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:10,447 INFO L280 TraceCheckUtils]: 35: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:10,448 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:10,450 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #118#return; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:10,451 INFO L280 TraceCheckUtils]: 38: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 18:35:10,452 INFO L280 TraceCheckUtils]: 39: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1267#false} is VALID [2020-07-10 18:35:10,452 INFO L280 TraceCheckUtils]: 40: Hoare triple {1267#false} havoc #t~ret4; {1267#false} is VALID [2020-07-10 18:35:10,453 INFO L280 TraceCheckUtils]: 41: Hoare triple {1267#false} #res := ~y; {1267#false} is VALID [2020-07-10 18:35:10,453 INFO L280 TraceCheckUtils]: 42: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-10 18:35:10,453 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1267#false} {1266#true} #110#return; {1267#false} is VALID [2020-07-10 18:35:10,453 INFO L280 TraceCheckUtils]: 44: Hoare triple {1267#false} ~res~0 := #t~ret7; {1267#false} is VALID [2020-07-10 18:35:10,454 INFO L280 TraceCheckUtils]: 45: Hoare triple {1267#false} havoc #t~ret7; {1267#false} is VALID [2020-07-10 18:35:10,454 INFO L263 TraceCheckUtils]: 46: Hoare triple {1267#false} call #t~ret8 := isnan_double(~res~0); {1266#true} is VALID [2020-07-10 18:35:10,454 INFO L280 TraceCheckUtils]: 47: Hoare triple {1266#true} ~x := #in~x; {1266#true} is VALID [2020-07-10 18:35:10,454 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:10,455 INFO L280 TraceCheckUtils]: 49: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-10 18:35:10,455 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1266#true} {1267#false} #112#return; {1267#false} is VALID [2020-07-10 18:35:10,455 INFO L280 TraceCheckUtils]: 51: Hoare triple {1267#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1267#false} is VALID [2020-07-10 18:35:10,455 INFO L280 TraceCheckUtils]: 52: Hoare triple {1267#false} assume 0 == #t~ret8; {1267#false} is VALID [2020-07-10 18:35:10,456 INFO L280 TraceCheckUtils]: 53: Hoare triple {1267#false} havoc #t~ret8; {1267#false} is VALID [2020-07-10 18:35:10,456 INFO L280 TraceCheckUtils]: 54: Hoare triple {1267#false} assume !false; {1267#false} is VALID [2020-07-10 18:35:10,459 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,459 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:10,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2142313281] [2020-07-10 18:35:10,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:10,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:10,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303979001] [2020-07-10 18:35:10,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-10 18:35:10,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:10,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:10,529 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:10,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:10,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:10,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:10,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:10,530 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 6 states. [2020-07-10 18:35:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:11,145 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2020-07-10 18:35:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:11,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-10 18:35:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 18:35:11,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-10 18:35:11,257 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:11,260 INFO L225 Difference]: With dead ends: 97 [2020-07-10 18:35:11,260 INFO L226 Difference]: Without dead ends: 81 [2020-07-10 18:35:11,261 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:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-10 18:35:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2020-07-10 18:35:11,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:11,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 76 states. [2020-07-10 18:35:11,324 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 76 states. [2020-07-10 18:35:11,324 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 76 states. [2020-07-10 18:35:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:11,329 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2020-07-10 18:35:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-10 18:35:11,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:11,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:11,331 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 81 states. [2020-07-10 18:35:11,331 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 81 states. [2020-07-10 18:35:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:11,335 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2020-07-10 18:35:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-10 18:35:11,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:11,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:11,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:11,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 18:35:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-07-10 18:35:11,341 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 55 [2020-07-10 18:35:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:11,341 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-07-10 18:35:11,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:11,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2020-07-10 18:35:11,447 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:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-07-10 18:35:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 18:35:11,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:11,450 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:11,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:35:11,450 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:11,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:11,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1520711866, now seen corresponding path program 1 times [2020-07-10 18:35:11,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:11,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902937596] [2020-07-10 18:35:11,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:11,697 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:11,697 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 18:35:11,697 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 18:35:11,698 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:35:11,718 WARN L170 areAnnotationChecker]: isnan_doubleENTRY has no Hoare annotation [2020-07-10 18:35:11,718 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 18:35:11,718 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-10 18:35:11,718 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 18:35:11,719 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 18:35:11,719 WARN L170 areAnnotationChecker]: fmin_doubleENTRY has no Hoare annotation [2020-07-10 18:35:11,719 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 18:35:11,719 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 18:35:11,719 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:11,719 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 18:35:11,719 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: isnan_doubleFINAL has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 18:35:11,720 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 18:35:11,721 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 18:35:11,721 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 18:35:11,721 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 18:35:11,721 WARN L170 areAnnotationChecker]: isnan_doubleEXIT has no Hoare annotation [2020-07-10 18:35:11,721 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 18:35:11,721 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 18:35:11,721 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 18:35:11,722 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-10 18:35:11,722 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 18:35:11,722 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-10 18:35:11,722 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 18:35:11,722 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 18:35:11,723 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 18:35:11,723 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 18:35:11,723 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-10 18:35:11,723 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-10 18:35:11,723 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-10 18:35:11,723 WARN L170 areAnnotationChecker]: L65-2 has no Hoare annotation [2020-07-10 18:35:11,723 WARN L170 areAnnotationChecker]: L65-2 has no Hoare annotation [2020-07-10 18:35:11,724 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 18:35:11,724 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 18:35:11,724 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 18:35:11,724 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 18:35:11,724 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-10 18:35:11,724 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-10 18:35:11,725 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 18:35:11,725 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 18:35:11,725 WARN L170 areAnnotationChecker]: L65-3 has no Hoare annotation [2020-07-10 18:35:11,725 WARN L170 areAnnotationChecker]: L65-4 has no Hoare annotation [2020-07-10 18:35:11,726 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 18:35:11,726 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-10 18:35:11,726 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 18:35:11,726 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 18:35:11,726 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 18:35:11,726 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 18:35:11,727 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 18:35:11,727 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 18:35:11,727 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 18:35:11,727 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 18:35:11,727 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-10 18:35:11,727 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 18:35:11,728 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 18:35:11,728 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 18:35:11,728 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 18:35:11,728 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 18:35:11,728 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 18:35:11,728 WARN L170 areAnnotationChecker]: fmin_doubleFINAL has no Hoare annotation [2020-07-10 18:35:11,729 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 18:35:11,729 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-10 18:35:11,729 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 18:35:11,729 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-10 18:35:11,729 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 18:35:11,729 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 18:35:11,730 WARN L170 areAnnotationChecker]: fmin_doubleEXIT has no Hoare annotation [2020-07-10 18:35:11,730 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 18:35:11,732 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 18:35:11,733 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 18:35:11,733 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-10 18:35:11,733 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 18:35:11,733 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-10 18:35:11,733 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 18:35:11,733 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-10 18:35:11,734 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 18:35:11,734 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 18:35:11,734 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 18:35:11,734 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-10 18:35:11,734 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 18:35:11,734 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 18:35:11,734 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-10 18:35:11,735 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-10 18:35:11,735 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-10 18:35:11,735 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 18:35:11,735 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-10 18:35:11,735 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 18:35:11,735 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 18:35:11,735 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 18:35:11,736 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 18:35:11,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 06:35:11 BoogieIcfgContainer [2020-07-10 18:35:11,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 18:35:11,745 INFO L168 Benchmark]: Toolchain (without parser) took 5749.66 ms. Allocated memory was 135.8 MB in the beginning and 297.8 MB in the end (delta: 162.0 MB). Free memory was 100.4 MB in the beginning and 115.8 MB in the end (delta: -15.4 MB). Peak memory consumption was 146.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:11,752 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 18:35:11,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.28 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 179.1 MB in the end (delta: -78.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:11,755 INFO L168 Benchmark]: Boogie Preprocessor took 52.21 ms. Allocated memory is still 200.3 MB. Free memory was 179.1 MB in the beginning and 176.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:11,756 INFO L168 Benchmark]: RCFGBuilder took 530.25 ms. Allocated memory is still 200.3 MB. Free memory was 176.5 MB in the beginning and 142.1 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:11,762 INFO L168 Benchmark]: TraceAbstraction took 4765.37 ms. Allocated memory was 200.3 MB in the beginning and 297.8 MB in the end (delta: 97.5 MB). Free memory was 141.4 MB in the beginning and 115.8 MB in the end (delta: 25.6 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:11,768 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 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 395.28 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 179.1 MB in the end (delta: -78.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.21 ms. Allocated memory is still 200.3 MB. Free memory was 179.1 MB in the beginning and 176.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 530.25 ms. Allocated memory is still 200.3 MB. Free memory was 176.5 MB in the beginning and 142.1 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4765.37 ms. Allocated memory was 200.3 MB in the beginning and 297.8 MB in the end (delta: 97.5 MB). Free memory was 141.4 MB in the beginning and 115.8 MB in the end (delta: 25.6 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 66]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62. Possible FailurePath: [L61] double x = 0.0 / 0.0; [L62] double y = 0.0 / 0.0; [L63] CALL, EXPR fmin_double(x, y) [L45] CALL, EXPR __fpclassify_double(x) [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] RET, EXPR __fpclassify_double(x) [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L63] RET, EXPR fmin_double(x, y) [L63] double res = fmin_double(x, y); [L65] CALL, EXPR isnan_double(res) [L16] return x != x; [L65] RET, EXPR isnan_double(res) [L65] COND TRUE !isnan_double(res) [L66] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 239 SDtfs, 65 SDslu, 416 SDs, 0 SdLazy, 313 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...