/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_1252a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:35:09,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:35:09,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:35:09,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:35:09,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:35:09,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:35:09,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:35:09,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:35:09,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:35:09,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:35:09,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:35:09,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:35:09,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:35:09,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:35:09,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:35:09,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:35:09,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:35:09,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:35:09,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:35:09,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:35:09,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:35:09,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:35:09,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:35:09,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:35:09,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:35:09,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:35:09,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:35:09,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:35:09,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:35:09,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:35:09,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:35:09,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:35:09,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:35:09,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:35:09,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:35:09,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:35:09,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:35:09,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:35:09,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:35:09,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:35:09,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:35:09,125 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:09,141 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:35:09,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:35:09,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:35:09,144 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:35:09,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:35:09,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:35:09,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:35:09,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:35:09,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:35:09,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:35:09,146 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:35:09,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:35:09,147 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:35:09,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:35:09,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:35:09,148 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:35:09,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:35:09,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:35:09,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:09,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:35:09,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:35:09,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:35:09,150 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:35:09,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:35:09,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:35:09,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:35:09,492 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:35:09,492 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:35:09,493 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c [2020-07-10 18:35:09,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b7e7fef/1d13e6018327491c835cf393ccd8e2ff/FLAG50e5ad796 [2020-07-10 18:35:10,068 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:35:10,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c [2020-07-10 18:35:10,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b7e7fef/1d13e6018327491c835cf393ccd8e2ff/FLAG50e5ad796 [2020-07-10 18:35:10,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b7e7fef/1d13e6018327491c835cf393ccd8e2ff [2020-07-10 18:35:10,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:35:10,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:35:10,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:10,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:35:10,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:35:10,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:10" (1/1) ... [2020-07-10 18:35:10,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73021cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:10, skipping insertion in model container [2020-07-10 18:35:10,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:10" (1/1) ... [2020-07-10 18:35:10,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:35:10,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:35:10,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:10,727 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:35:10,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:10,894 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:35:10,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:10 WrapperNode [2020-07-10 18:35:10,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:10,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:35:10,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:35:10,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:35:10,905 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:10" (1/1) ... [2020-07-10 18:35:10,905 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:10" (1/1) ... [2020-07-10 18:35:10,913 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:10" (1/1) ... [2020-07-10 18:35:10,914 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:10" (1/1) ... [2020-07-10 18:35:10,929 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:10" (1/1) ... [2020-07-10 18:35:10,936 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:10" (1/1) ... [2020-07-10 18:35:10,938 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:10" (1/1) ... [2020-07-10 18:35:10,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:35:10,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:35:10,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:35:10,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:35:10,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:10" (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:11,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:35:11,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:35:11,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 18:35:11,014 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-10 18:35:11,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-10 18:35:11,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:35:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:35:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 18:35:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 18:35:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 18:35:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 18:35:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:35:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:35:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-10 18:35:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-10 18:35:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:35:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:35:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:35:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:35:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 18:35:11,606 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:35:11,606 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 18:35:11,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:11 BoogieIcfgContainer [2020-07-10 18:35:11,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:35:11,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:35:11,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:35:11,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:35:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:35:10" (1/3) ... [2020-07-10 18:35:11,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbba46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:11, skipping insertion in model container [2020-07-10 18:35:11,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:10" (2/3) ... [2020-07-10 18:35:11,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbba46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:11, skipping insertion in model container [2020-07-10 18:35:11,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:11" (3/3) ... [2020-07-10 18:35:11,621 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2020-07-10 18:35:11,632 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:35:11,641 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:35:11,656 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:35:11,679 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:35:11,679 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:35:11,679 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:35:11,680 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:35:11,680 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:35:11,680 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:35:11,680 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:35:11,681 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:35:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2020-07-10 18:35:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 18:35:11,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:11,713 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] [2020-07-10 18:35:11,714 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1930633076, now seen corresponding path program 1 times [2020-07-10 18:35:11,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:11,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1452265891] [2020-07-10 18:35:11,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:11,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {98#true} is VALID [2020-07-10 18:35:11,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-10 18:35:11,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-10 18:35:11,971 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-10 18:35:11,972 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-10 18:35:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:12,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:12,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-10 18:35:12,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-10 18:35:12,025 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-10 18:35:12,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-10 18:35:12,026 INFO L280 TraceCheckUtils]: 5: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-10 18:35:12,026 INFO L280 TraceCheckUtils]: 6: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:12,026 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-10 18:35:12,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:12,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-10 18:35:12,030 INFO L263 TraceCheckUtils]: 2: Hoare triple {98#true} call #t~ret4 := __fpclassify_double(~x); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:12,030 INFO L280 TraceCheckUtils]: 3: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:12,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-10 18:35:12,031 INFO L280 TraceCheckUtils]: 5: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-10 18:35:12,032 INFO L280 TraceCheckUtils]: 6: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-10 18:35:12,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-10 18:35:12,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-10 18:35:12,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:12,033 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-10 18:35:12,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-10 18:35:12,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-10 18:35:12,035 INFO L280 TraceCheckUtils]: 13: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-10 18:35:12,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-10 18:35:12,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:12,036 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-10 18:35:12,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:12,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {98#true} is VALID [2020-07-10 18:35:12,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-10 18:35:12,043 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-10 18:35:12,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-10 18:35:12,044 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-10 18:35:12,044 INFO L263 TraceCheckUtils]: 6: Hoare triple {98#true} call #t~ret12 := main(); {98#true} is VALID [2020-07-10 18:35:12,044 INFO L280 TraceCheckUtils]: 7: Hoare triple {98#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0); {98#true} is VALID [2020-07-10 18:35:12,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#true} ~y~0 := 0.0; {98#true} is VALID [2020-07-10 18:35:12,047 INFO L263 TraceCheckUtils]: 9: Hoare triple {98#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:12,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:12,048 INFO L280 TraceCheckUtils]: 11: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-10 18:35:12,049 INFO L263 TraceCheckUtils]: 12: Hoare triple {98#true} call #t~ret4 := __fpclassify_double(~x); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:12,050 INFO L280 TraceCheckUtils]: 13: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:12,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-10 18:35:12,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-10 18:35:12,051 INFO L280 TraceCheckUtils]: 16: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-10 18:35:12,052 INFO L280 TraceCheckUtils]: 17: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-10 18:35:12,052 INFO L280 TraceCheckUtils]: 18: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-10 18:35:12,053 INFO L280 TraceCheckUtils]: 19: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:12,053 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-10 18:35:12,053 INFO L280 TraceCheckUtils]: 21: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-10 18:35:12,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-10 18:35:12,054 INFO L280 TraceCheckUtils]: 23: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-10 18:35:12,054 INFO L280 TraceCheckUtils]: 24: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-10 18:35:12,055 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:12,055 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-10 18:35:12,056 INFO L280 TraceCheckUtils]: 27: Hoare triple {99#false} ~res~0 := #t~ret9; {99#false} is VALID [2020-07-10 18:35:12,056 INFO L280 TraceCheckUtils]: 28: Hoare triple {99#false} havoc #t~ret9; {99#false} is VALID [2020-07-10 18:35:12,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {99#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {99#false} is VALID [2020-07-10 18:35:12,057 INFO L280 TraceCheckUtils]: 30: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-10 18:35:12,057 INFO L280 TraceCheckUtils]: 31: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-10 18:35:12,058 INFO L280 TraceCheckUtils]: 32: Hoare triple {99#false} havoc #t~ret10; {99#false} is VALID [2020-07-10 18:35:12,058 INFO L280 TraceCheckUtils]: 33: Hoare triple {99#false} havoc #t~short11; {99#false} is VALID [2020-07-10 18:35:12,058 INFO L280 TraceCheckUtils]: 34: Hoare triple {99#false} assume !false; {99#false} is VALID [2020-07-10 18:35:12,063 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:12,063 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:12,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1452265891] [2020-07-10 18:35:12,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:12,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 18:35:12,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385431881] [2020-07-10 18:35:12,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-10 18:35:12,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:12,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 18:35:12,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:12,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 18:35:12,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:12,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 18:35:12,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 18:35:12,168 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2020-07-10 18:35:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:12,899 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2020-07-10 18:35:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 18:35:12,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-10 18:35:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-10 18:35:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-10 18:35:12,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2020-07-10 18:35:13,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:13,227 INFO L225 Difference]: With dead ends: 176 [2020-07-10 18:35:13,227 INFO L226 Difference]: Without dead ends: 87 [2020-07-10 18:35:13,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:35:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-10 18:35:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-07-10 18:35:13,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:13,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:13,348 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:13,348 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:13,358 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 18:35:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-10 18:35:13,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:13,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:13,361 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:13,361 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:13,369 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 18:35:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-10 18:35:13,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:13,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:13,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:13,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-10 18:35:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-07-10 18:35:13,380 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 35 [2020-07-10 18:35:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:13,381 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-07-10 18:35:13,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 18:35:13,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 95 transitions. [2020-07-10 18:35:13,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-10 18:35:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 18:35:13,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:13,503 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] [2020-07-10 18:35:13,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:35:13,504 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:13,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -330335414, now seen corresponding path program 1 times [2020-07-10 18:35:13,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:13,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928175001] [2020-07-10 18:35:13,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {837#true} is VALID [2020-07-10 18:35:13,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-10 18:35:13,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-10 18:35:13,611 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 18:35:13,611 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-10 18:35:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:13,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:13,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-10 18:35:13,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-10 18:35:13,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-10 18:35:13,721 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-10 18:35:13,721 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-10 18:35:13,721 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-10 18:35:13,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-10 18:35:13,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-10 18:35:13,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-10 18:35:13,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-10 18:35:13,723 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-10 18:35:13,723 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-10 18:35:13,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-10 18:35:13,724 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-10 18:35:13,724 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-10 18:35:13,724 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-10 18:35:13,725 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-10 18:35:13,725 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-10 18:35:13,726 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,730 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:13,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:13,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-10 18:35:13,732 INFO L263 TraceCheckUtils]: 2: Hoare triple {837#true} call #t~ret4 := __fpclassify_double(~x); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:13,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:13,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-10 18:35:13,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-10 18:35:13,734 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-10 18:35:13,734 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-10 18:35:13,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-10 18:35:13,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-10 18:35:13,735 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-10 18:35:13,735 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-10 18:35:13,735 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-10 18:35:13,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-10 18:35:13,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-10 18:35:13,736 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-10 18:35:13,737 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-10 18:35:13,737 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-10 18:35:13,737 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-10 18:35:13,738 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-10 18:35:13,738 INFO L280 TraceCheckUtils]: 20: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-10 18:35:13,738 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-10 18:35:13,739 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,740 INFO L280 TraceCheckUtils]: 23: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,741 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:13,742 INFO L280 TraceCheckUtils]: 25: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:13,743 INFO L280 TraceCheckUtils]: 26: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-10 18:35:13,743 INFO L280 TraceCheckUtils]: 27: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-10 18:35:13,744 INFO L280 TraceCheckUtils]: 28: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-10 18:35:13,744 INFO L280 TraceCheckUtils]: 29: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-10 18:35:13,744 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-10 18:35:13,747 INFO L263 TraceCheckUtils]: 0: Hoare triple {837#true} call ULTIMATE.init(); {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:13,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {837#true} is VALID [2020-07-10 18:35:13,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-10 18:35:13,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-10 18:35:13,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 18:35:13,748 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-10 18:35:13,749 INFO L263 TraceCheckUtils]: 6: Hoare triple {837#true} call #t~ret12 := main(); {837#true} is VALID [2020-07-10 18:35:13,749 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0); {837#true} is VALID [2020-07-10 18:35:13,749 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} ~y~0 := 0.0; {837#true} is VALID [2020-07-10 18:35:13,751 INFO L263 TraceCheckUtils]: 9: Hoare triple {837#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:13,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:13,751 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-10 18:35:13,753 INFO L263 TraceCheckUtils]: 12: Hoare triple {837#true} call #t~ret4 := __fpclassify_double(~x); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:13,753 INFO L280 TraceCheckUtils]: 13: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:13,753 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-10 18:35:13,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-10 18:35:13,754 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-10 18:35:13,754 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-10 18:35:13,754 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-10 18:35:13,755 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-10 18:35:13,755 INFO L280 TraceCheckUtils]: 20: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-10 18:35:13,755 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-10 18:35:13,755 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-10 18:35:13,756 INFO L280 TraceCheckUtils]: 23: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-10 18:35:13,756 INFO L280 TraceCheckUtils]: 24: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-10 18:35:13,756 INFO L280 TraceCheckUtils]: 25: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-10 18:35:13,757 INFO L280 TraceCheckUtils]: 26: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-10 18:35:13,757 INFO L280 TraceCheckUtils]: 27: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-10 18:35:13,757 INFO L280 TraceCheckUtils]: 28: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-10 18:35:13,757 INFO L280 TraceCheckUtils]: 29: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-10 18:35:13,758 INFO L280 TraceCheckUtils]: 30: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-10 18:35:13,758 INFO L280 TraceCheckUtils]: 31: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-10 18:35:13,759 INFO L280 TraceCheckUtils]: 32: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,759 INFO L280 TraceCheckUtils]: 33: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:13,761 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:13,761 INFO L280 TraceCheckUtils]: 35: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:13,762 INFO L280 TraceCheckUtils]: 36: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-10 18:35:13,762 INFO L280 TraceCheckUtils]: 37: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-10 18:35:13,762 INFO L280 TraceCheckUtils]: 38: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-10 18:35:13,763 INFO L280 TraceCheckUtils]: 39: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-10 18:35:13,763 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-10 18:35:13,763 INFO L280 TraceCheckUtils]: 41: Hoare triple {838#false} ~res~0 := #t~ret9; {838#false} is VALID [2020-07-10 18:35:13,764 INFO L280 TraceCheckUtils]: 42: Hoare triple {838#false} havoc #t~ret9; {838#false} is VALID [2020-07-10 18:35:13,764 INFO L280 TraceCheckUtils]: 43: Hoare triple {838#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {838#false} is VALID [2020-07-10 18:35:13,764 INFO L280 TraceCheckUtils]: 44: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-10 18:35:13,764 INFO L280 TraceCheckUtils]: 45: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-10 18:35:13,765 INFO L280 TraceCheckUtils]: 46: Hoare triple {838#false} havoc #t~ret10; {838#false} is VALID [2020-07-10 18:35:13,765 INFO L280 TraceCheckUtils]: 47: Hoare triple {838#false} havoc #t~short11; {838#false} is VALID [2020-07-10 18:35:13,765 INFO L280 TraceCheckUtils]: 48: Hoare triple {838#false} assume !false; {838#false} is VALID [2020-07-10 18:35:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:35:13,768 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:13,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1928175001] [2020-07-10 18:35:13,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:13,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:13,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633967520] [2020-07-10 18:35:13,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:13,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:13,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:13,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:13,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:13,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:13,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:13,822 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2020-07-10 18:35:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:14,512 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2020-07-10 18:35:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:14,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:14,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-10 18:35:14,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:14,712 INFO L225 Difference]: With dead ends: 123 [2020-07-10 18:35:14,712 INFO L226 Difference]: Without dead ends: 92 [2020-07-10 18:35:14,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:35:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-10 18:35:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-07-10 18:35:14,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:14,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2020-07-10 18:35:14,814 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2020-07-10 18:35:14,814 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2020-07-10 18:35:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:14,820 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-10 18:35:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-10 18:35:14,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:14,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:14,822 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2020-07-10 18:35:14,822 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2020-07-10 18:35:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:14,827 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-10 18:35:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-10 18:35:14,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:14,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:14,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:14,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-10 18:35:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-10 18:35:14,836 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 49 [2020-07-10 18:35:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:14,837 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-10 18:35:14,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:14,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-10 18:35:14,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-10 18:35:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:35:14,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:14,937 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:14,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:35:14,938 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash -389367439, now seen corresponding path program 1 times [2020-07-10 18:35:14,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:14,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215439527] [2020-07-10 18:35:14,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:15,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1518#true} is VALID [2020-07-10 18:35:15,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-10 18:35:15,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-10 18:35:15,045 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-10 18:35:15,045 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-10 18:35:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:15,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:15,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-10 18:35:15,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-10 18:35:15,166 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-10 18:35:15,166 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-10 18:35:15,167 INFO L280 TraceCheckUtils]: 5: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-10 18:35:15,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-10 18:35:15,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-10 18:35:15,167 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-10 18:35:15,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-10 18:35:15,168 INFO L280 TraceCheckUtils]: 10: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-10 18:35:15,168 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-10 18:35:15,169 INFO L280 TraceCheckUtils]: 12: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-10 18:35:15,169 INFO L280 TraceCheckUtils]: 13: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-10 18:35:15,169 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-10 18:35:15,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-10 18:35:15,170 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-10 18:35:15,170 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-10 18:35:15,170 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-10 18:35:15,171 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-10 18:35:15,171 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-10 18:35:15,171 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-10 18:35:15,172 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:15,173 INFO L280 TraceCheckUtils]: 23: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:15,174 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:15,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:15,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-10 18:35:15,177 INFO L263 TraceCheckUtils]: 2: Hoare triple {1518#true} call #t~ret4 := __fpclassify_double(~x); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:15,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:15,177 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-10 18:35:15,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-10 18:35:15,178 INFO L280 TraceCheckUtils]: 6: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-10 18:35:15,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-10 18:35:15,179 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-10 18:35:15,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-10 18:35:15,179 INFO L280 TraceCheckUtils]: 10: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-10 18:35:15,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-10 18:35:15,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-10 18:35:15,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-10 18:35:15,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-10 18:35:15,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-10 18:35:15,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-10 18:35:15,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-10 18:35:15,181 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-10 18:35:15,182 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-10 18:35:15,182 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-10 18:35:15,182 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-10 18:35:15,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-10 18:35:15,183 INFO L280 TraceCheckUtils]: 23: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-10 18:35:15,183 INFO L280 TraceCheckUtils]: 24: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-10 18:35:15,184 INFO L280 TraceCheckUtils]: 25: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:15,185 INFO L280 TraceCheckUtils]: 26: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:15,186 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:15,186 INFO L280 TraceCheckUtils]: 28: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:15,187 INFO L280 TraceCheckUtils]: 29: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-10 18:35:15,188 INFO L280 TraceCheckUtils]: 30: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-10 18:35:15,188 INFO L280 TraceCheckUtils]: 31: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-10 18:35:15,188 INFO L280 TraceCheckUtils]: 32: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-10 18:35:15,189 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-10 18:35:15,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {1518#true} call ULTIMATE.init(); {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:15,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1518#true} is VALID [2020-07-10 18:35:15,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-10 18:35:15,192 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-10 18:35:15,192 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-10 18:35:15,192 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-10 18:35:15,192 INFO L263 TraceCheckUtils]: 6: Hoare triple {1518#true} call #t~ret12 := main(); {1518#true} is VALID [2020-07-10 18:35:15,193 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0); {1518#true} is VALID [2020-07-10 18:35:15,193 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} ~y~0 := 0.0; {1518#true} is VALID [2020-07-10 18:35:15,194 INFO L263 TraceCheckUtils]: 9: Hoare triple {1518#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:15,195 INFO L280 TraceCheckUtils]: 10: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:15,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-10 18:35:15,196 INFO L263 TraceCheckUtils]: 12: Hoare triple {1518#true} call #t~ret4 := __fpclassify_double(~x); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:15,196 INFO L280 TraceCheckUtils]: 13: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:15,197 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-10 18:35:15,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-10 18:35:15,197 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-10 18:35:15,198 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-10 18:35:15,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-10 18:35:15,198 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-10 18:35:15,198 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-10 18:35:15,199 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-10 18:35:15,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-10 18:35:15,199 INFO L280 TraceCheckUtils]: 23: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-10 18:35:15,199 INFO L280 TraceCheckUtils]: 24: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-10 18:35:15,200 INFO L280 TraceCheckUtils]: 25: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-10 18:35:15,200 INFO L280 TraceCheckUtils]: 26: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-10 18:35:15,200 INFO L280 TraceCheckUtils]: 27: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-10 18:35:15,200 INFO L280 TraceCheckUtils]: 28: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-10 18:35:15,201 INFO L280 TraceCheckUtils]: 29: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-10 18:35:15,201 INFO L280 TraceCheckUtils]: 30: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-10 18:35:15,201 INFO L280 TraceCheckUtils]: 31: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-10 18:35:15,201 INFO L280 TraceCheckUtils]: 32: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-10 18:35:15,202 INFO L280 TraceCheckUtils]: 33: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-10 18:35:15,202 INFO L280 TraceCheckUtils]: 34: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-10 18:35:15,203 INFO L280 TraceCheckUtils]: 35: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:15,203 INFO L280 TraceCheckUtils]: 36: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:15,205 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:15,205 INFO L280 TraceCheckUtils]: 38: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:15,206 INFO L280 TraceCheckUtils]: 39: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-10 18:35:15,206 INFO L280 TraceCheckUtils]: 40: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-10 18:35:15,207 INFO L280 TraceCheckUtils]: 41: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-10 18:35:15,207 INFO L280 TraceCheckUtils]: 42: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-10 18:35:15,207 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-10 18:35:15,207 INFO L280 TraceCheckUtils]: 44: Hoare triple {1519#false} ~res~0 := #t~ret9; {1519#false} is VALID [2020-07-10 18:35:15,208 INFO L280 TraceCheckUtils]: 45: Hoare triple {1519#false} havoc #t~ret9; {1519#false} is VALID [2020-07-10 18:35:15,208 INFO L280 TraceCheckUtils]: 46: Hoare triple {1519#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {1519#false} is VALID [2020-07-10 18:35:15,208 INFO L280 TraceCheckUtils]: 47: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-10 18:35:15,209 INFO L280 TraceCheckUtils]: 48: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-10 18:35:15,209 INFO L280 TraceCheckUtils]: 49: Hoare triple {1519#false} havoc #t~ret10; {1519#false} is VALID [2020-07-10 18:35:15,209 INFO L280 TraceCheckUtils]: 50: Hoare triple {1519#false} havoc #t~short11; {1519#false} is VALID [2020-07-10 18:35:15,209 INFO L280 TraceCheckUtils]: 51: Hoare triple {1519#false} assume !false; {1519#false} is VALID [2020-07-10 18:35:15,212 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:15,213 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:15,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215439527] [2020-07-10 18:35:15,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:15,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:15,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524568476] [2020-07-10 18:35:15,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:15,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:15,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:15,267 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:15,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:15,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:15,268 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 6 states. [2020-07-10 18:35:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:15,988 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-10 18:35:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:15,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:15,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-10 18:35:16,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:16,158 INFO L225 Difference]: With dead ends: 127 [2020-07-10 18:35:16,158 INFO L226 Difference]: Without dead ends: 96 [2020-07-10 18:35:16,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-10 18:35:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2020-07-10 18:35:16,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:16,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 91 states. [2020-07-10 18:35:16,230 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 91 states. [2020-07-10 18:35:16,230 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 91 states. [2020-07-10 18:35:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:16,235 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-10 18:35:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-10 18:35:16,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:16,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:16,236 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 96 states. [2020-07-10 18:35:16,237 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 96 states. [2020-07-10 18:35:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:16,242 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-10 18:35:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-10 18:35:16,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:16,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:16,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:16,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-10 18:35:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-10 18:35:16,248 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 52 [2020-07-10 18:35:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:16,248 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-10 18:35:16,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:16,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-10 18:35:16,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-10 18:35:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:35:16,367 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:16,367 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:16,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:35:16,368 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash 323107249, now seen corresponding path program 1 times [2020-07-10 18:35:16,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:16,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118264460] [2020-07-10 18:35:16,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:16,552 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:16,553 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 18:35:16,553 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 18:35:16,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:35:16,571 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 18:35:16,571 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-10 18:35:16,571 WARN L170 areAnnotationChecker]: fmax_doubleENTRY has no Hoare annotation [2020-07-10 18:35:16,571 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 18:35:16,571 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 18:35:16,571 WARN L170 areAnnotationChecker]: __signbit_doubleENTRY has no Hoare annotation [2020-07-10 18:35:16,571 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-10 18:35:16,572 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 18:35:16,573 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L63-3 has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 18:35:16,574 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: __signbit_doubleFINAL has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 18:35:16,575 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: __signbit_doubleEXIT has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 18:35:16,576 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-10 18:35:16,577 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: fmax_doubleFINAL has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: L84-4 has no Hoare annotation [2020-07-10 18:35:16,578 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: L84-6 has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: L84-6 has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: fmax_doubleEXIT has no Hoare annotation [2020-07-10 18:35:16,579 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L66-3 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L84-7 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L84-9 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L54-3 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L54-4 has no Hoare annotation [2020-07-10 18:35:16,580 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L84-8 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L84-10 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 18:35:16,581 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 18:35:16,582 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: L57-5 has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 18:35:16,583 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-10 18:35:16,584 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 18:35:16,584 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 18:35:16,584 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:16,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 06:35:16 BoogieIcfgContainer [2020-07-10 18:35:16,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 18:35:16,591 INFO L168 Benchmark]: Toolchain (without parser) took 6106.44 ms. Allocated memory was 147.3 MB in the beginning and 272.1 MB in the end (delta: 124.8 MB). Free memory was 104.3 MB in the beginning and 101.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:16,592 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 147.3 MB. Free memory was 122.8 MB in the beginning and 122.5 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:16,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.56 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 104.0 MB in the beginning and 181.2 MB in the end (delta: -77.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:16,593 INFO L168 Benchmark]: Boogie Preprocessor took 46.17 ms. Allocated memory is still 203.9 MB. Free memory was 181.2 MB in the beginning and 178.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:16,594 INFO L168 Benchmark]: RCFGBuilder took 670.96 ms. Allocated memory is still 203.9 MB. Free memory was 178.8 MB in the beginning and 139.9 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:16,595 INFO L168 Benchmark]: TraceAbstraction took 4973.86 ms. Allocated memory was 203.9 MB in the beginning and 272.1 MB in the end (delta: 68.2 MB). Free memory was 139.3 MB in the beginning and 101.7 MB in the end (delta: 37.5 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:16,598 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.16 ms. Allocated memory is still 147.3 MB. Free memory was 122.8 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 408.56 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 104.0 MB in the beginning and 181.2 MB in the end (delta: -77.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.17 ms. Allocated memory is still 203.9 MB. Free memory was 181.2 MB in the beginning and 178.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 670.96 ms. Allocated memory is still 203.9 MB. Free memory was 178.8 MB in the beginning and 139.9 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4973.86 ms. Allocated memory was 203.9 MB in the beginning and 272.1 MB in the end (delta: 68.2 MB). Free memory was 139.3 MB in the beginning and 101.7 MB in the end (delta: 37.5 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L81] CALL, EXPR fmax_double(x, y) [L52] CALL, EXPR __fpclassify_double(x) [L24] __uint32_t msw, lsw; [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] RET, EXPR __fpclassify_double(x) [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] RET, EXPR fmax_double(x, y) [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 285 SDtfs, 59 SDslu, 523 SDs, 0 SdLazy, 377 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred 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...