/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-267fbe0 [2020-07-18 00:13:23,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:13:23,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:13:23,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:13:23,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:13:23,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:13:23,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:13:23,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:13:23,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:13:23,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:13:23,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:13:23,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:13:23,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:13:23,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:13:23,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:13:23,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:13:23,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:13:23,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:13:23,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:13:23,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:13:23,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:13:23,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:13:23,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:13:23,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:13:23,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:13:23,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:13:23,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:13:23,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:13:23,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:13:23,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:13:23,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:13:23,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:13:23,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:13:23,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:13:23,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:13:23,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:13:23,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:13:23,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:13:23,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:13:23,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:13:23,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:13:23,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:13:23,899 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:13:23,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:13:23,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:13:23,901 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:13:23,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:13:23,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:13:23,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:13:23,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:13:23,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:13:23,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:13:23,902 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:13:23,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:13:23,902 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:13:23,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:13:23,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:13:23,903 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:13:23,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:13:23,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:13:23,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:13:23,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:13:23,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:13:23,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:13:23,904 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:13:24,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:13:24,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:13:24,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:13:24,236 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:13:24,236 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:13:24,237 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-18 00:13:24,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10d80f1/5b44cf379ac640818d88fc9f997565b2/FLAG52b5154a9 [2020-07-18 00:13:24,736 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:13:24,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c [2020-07-18 00:13:24,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10d80f1/5b44cf379ac640818d88fc9f997565b2/FLAG52b5154a9 [2020-07-18 00:13:25,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10d80f1/5b44cf379ac640818d88fc9f997565b2 [2020-07-18 00:13:25,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:13:25,185 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:13:25,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:25,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:13:25,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:13:25,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b7ff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25, skipping insertion in model container [2020-07-18 00:13:25,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:13:25,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:13:25,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:25,446 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:13:25,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:25,614 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:13:25,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25 WrapperNode [2020-07-18 00:13:25,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:25,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:13:25,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:13:25,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:13:25,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (1/1) ... [2020-07-18 00:13:25,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:13:25,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:13:25,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:13:25,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:13:25,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (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-18 00:13:25,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:13:25,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:13:25,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-18 00:13:25,738 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-18 00:13:25,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-18 00:13:25,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:13:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:13:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-18 00:13:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-18 00:13:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:13:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 00:13:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:13:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:13:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-18 00:13:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-18 00:13:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:13:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:13:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:13:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:13:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 00:13:26,339 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:13:26,339 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 00:13:26,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:26 BoogieIcfgContainer [2020-07-18 00:13:26,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:13:26,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:13:26,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:13:26,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:13:26,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:13:25" (1/3) ... [2020-07-18 00:13:26,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf0f002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:26, skipping insertion in model container [2020-07-18 00:13:26,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:25" (2/3) ... [2020-07-18 00:13:26,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf0f002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:26, skipping insertion in model container [2020-07-18 00:13:26,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:26" (3/3) ... [2020-07-18 00:13:26,354 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2020-07-18 00:13:26,366 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:13:26,375 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:13:26,392 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:13:26,415 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:13:26,415 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:13:26,416 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:13:26,416 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:13:26,416 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:13:26,416 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:13:26,417 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:13:26,417 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:13:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2020-07-18 00:13:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:13:26,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:26,449 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-18 00:13:26,449 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1930633076, now seen corresponding path program 1 times [2020-07-18 00:13:26,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:26,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855351205] [2020-07-18 00:13:26,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:26,668 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-18 00:13:26,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-18 00:13:26,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-18 00:13:26,669 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-18 00:13:26,671 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-18 00:13:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:26,722 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-18 00:13:26,723 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-18 00:13:26,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-18 00:13:26,724 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-18 00:13:26,724 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-18 00:13:26,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-18 00:13:26,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 00:13:26,726 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-18 00:13:26,726 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-18 00:13:26,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-18 00:13:26,729 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-18 00:13:26,729 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-18 00:13:26,730 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-18 00:13:26,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-18 00:13:26,731 INFO L280 TraceCheckUtils]: 6: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-18 00:13:26,731 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-18 00:13:26,732 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-18 00:13:26,732 INFO L280 TraceCheckUtils]: 9: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 00:13:26,732 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-18 00:13:26,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-18 00:13:26,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-18 00:13:26,733 INFO L280 TraceCheckUtils]: 13: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-18 00:13:26,734 INFO L280 TraceCheckUtils]: 14: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-18 00:13:26,734 INFO L280 TraceCheckUtils]: 15: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 00:13:26,734 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-18 00:13:26,738 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-18 00:13:26,739 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-18 00:13:26,739 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-18 00:13:26,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-18 00:13:26,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-18 00:13:26,740 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-18 00:13:26,740 INFO L263 TraceCheckUtils]: 6: Hoare triple {98#true} call #t~ret12 := main(); {98#true} is VALID [2020-07-18 00:13:26,741 INFO L280 TraceCheckUtils]: 7: Hoare triple {98#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0); {98#true} is VALID [2020-07-18 00:13:26,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#true} ~y~0 := 0.0; {98#true} is VALID [2020-07-18 00:13:26,743 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-18 00:13:26,743 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-18 00:13:26,744 INFO L280 TraceCheckUtils]: 11: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-18 00:13:26,745 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-18 00:13:26,746 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-18 00:13:26,746 INFO L280 TraceCheckUtils]: 14: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-18 00:13:26,746 INFO L280 TraceCheckUtils]: 15: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-18 00:13:26,747 INFO L280 TraceCheckUtils]: 16: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-18 00:13:26,747 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-18 00:13:26,748 INFO L280 TraceCheckUtils]: 18: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-18 00:13:26,748 INFO L280 TraceCheckUtils]: 19: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 00:13:26,748 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-18 00:13:26,749 INFO L280 TraceCheckUtils]: 21: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-18 00:13:26,749 INFO L280 TraceCheckUtils]: 22: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-18 00:13:26,750 INFO L280 TraceCheckUtils]: 23: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-18 00:13:26,750 INFO L280 TraceCheckUtils]: 24: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-18 00:13:26,751 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 00:13:26,751 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-18 00:13:26,751 INFO L280 TraceCheckUtils]: 27: Hoare triple {99#false} ~res~0 := #t~ret9; {99#false} is VALID [2020-07-18 00:13:26,752 INFO L280 TraceCheckUtils]: 28: Hoare triple {99#false} havoc #t~ret9; {99#false} is VALID [2020-07-18 00:13:26,752 INFO L280 TraceCheckUtils]: 29: Hoare triple {99#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {99#false} is VALID [2020-07-18 00:13:26,753 INFO L280 TraceCheckUtils]: 30: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-18 00:13:26,753 INFO L280 TraceCheckUtils]: 31: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-18 00:13:26,753 INFO L280 TraceCheckUtils]: 32: Hoare triple {99#false} havoc #t~ret10; {99#false} is VALID [2020-07-18 00:13:26,754 INFO L280 TraceCheckUtils]: 33: Hoare triple {99#false} havoc #t~short11; {99#false} is VALID [2020-07-18 00:13:26,754 INFO L280 TraceCheckUtils]: 34: Hoare triple {99#false} assume !false; {99#false} is VALID [2020-07-18 00:13:26,760 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-18 00:13:26,763 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:26,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855351205] [2020-07-18 00:13:26,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:26,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:13:26,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23847744] [2020-07-18 00:13:26,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-18 00:13:26,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:26,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:13:26,841 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-18 00:13:26,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:13:26,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:13:26,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:13:26,854 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2020-07-18 00:13:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:27,578 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2020-07-18 00:13:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:13:27,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-18 00:13:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-18 00:13:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-18 00:13:27,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2020-07-18 00:13:27,867 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-18 00:13:27,897 INFO L225 Difference]: With dead ends: 176 [2020-07-18 00:13:27,905 INFO L226 Difference]: Without dead ends: 87 [2020-07-18 00:13:27,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-18 00:13:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-18 00:13:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-07-18 00:13:28,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:28,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2020-07-18 00:13:28,039 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-18 00:13:28,040 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-18 00:13:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:28,049 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-18 00:13:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-18 00:13:28,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:28,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:28,051 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-18 00:13:28,051 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-18 00:13:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:28,059 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-18 00:13:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-18 00:13:28,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:28,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:28,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:28,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-18 00:13:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-07-18 00:13:28,069 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 35 [2020-07-18 00:13:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:28,069 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-07-18 00:13:28,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:13:28,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 95 transitions. [2020-07-18 00:13:28,226 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-18 00:13:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-18 00:13:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 00:13:28,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:28,229 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-18 00:13:28,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:13:28,231 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -330335414, now seen corresponding path program 1 times [2020-07-18 00:13:28,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:28,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344561620] [2020-07-18 00:13:28,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,369 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-18 00:13:28,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-18 00:13:28,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-18 00:13:28,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-18 00:13:28,370 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-18 00:13:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,490 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-18 00:13:28,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-18 00:13:28,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-18 00:13:28,491 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-18 00:13:28,492 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-18 00:13:28,492 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-18 00:13:28,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-18 00:13:28,493 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-18 00:13:28,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-18 00:13:28,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-18 00:13:28,494 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-18 00:13:28,494 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-18 00:13:28,495 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-18 00:13:28,495 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-18 00:13:28,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-18 00:13:28,496 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-18 00:13:28,496 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-18 00:13:28,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-18 00:13:28,497 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-18 00:13:28,498 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:28,499 INFO L280 TraceCheckUtils]: 20: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:28,500 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-18 00:13:28,501 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-18 00:13:28,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-18 00:13:28,503 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-18 00:13:28,503 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-18 00:13:28,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-18 00:13:28,504 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-18 00:13:28,504 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-18 00:13:28,505 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-18 00:13:28,505 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-18 00:13:28,505 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-18 00:13:28,505 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-18 00:13:28,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-18 00:13:28,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-18 00:13:28,506 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-18 00:13:28,507 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-18 00:13:28,507 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-18 00:13:28,507 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-18 00:13:28,508 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-18 00:13:28,508 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-18 00:13:28,508 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-18 00:13:28,509 INFO L280 TraceCheckUtils]: 20: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-18 00:13:28,509 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-18 00:13:28,510 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:28,511 INFO L280 TraceCheckUtils]: 23: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:28,512 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-18 00:13:28,513 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-18 00:13:28,513 INFO L280 TraceCheckUtils]: 26: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-18 00:13:28,514 INFO L280 TraceCheckUtils]: 27: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-18 00:13:28,514 INFO L280 TraceCheckUtils]: 28: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-18 00:13:28,514 INFO L280 TraceCheckUtils]: 29: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-18 00:13:28,515 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-18 00:13:28,517 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-18 00:13:28,517 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-18 00:13:28,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-18 00:13:28,518 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-18 00:13:28,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-18 00:13:28,519 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-18 00:13:28,519 INFO L263 TraceCheckUtils]: 6: Hoare triple {837#true} call #t~ret12 := main(); {837#true} is VALID [2020-07-18 00:13:28,519 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0); {837#true} is VALID [2020-07-18 00:13:28,520 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} ~y~0 := 0.0; {837#true} is VALID [2020-07-18 00:13:28,521 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-18 00:13:28,522 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-18 00:13:28,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-18 00:13:28,523 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-18 00:13:28,523 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-18 00:13:28,524 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-18 00:13:28,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-18 00:13:28,524 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-18 00:13:28,525 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-18 00:13:28,525 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-18 00:13:28,525 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-18 00:13:28,526 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-18 00:13:28,526 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-18 00:13:28,526 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-18 00:13:28,526 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-18 00:13:28,527 INFO L280 TraceCheckUtils]: 24: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-18 00:13:28,527 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-18 00:13:28,527 INFO L280 TraceCheckUtils]: 26: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-18 00:13:28,528 INFO L280 TraceCheckUtils]: 27: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-18 00:13:28,528 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-18 00:13:28,528 INFO L280 TraceCheckUtils]: 29: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-18 00:13:28,529 INFO L280 TraceCheckUtils]: 30: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-18 00:13:28,529 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-18 00:13:28,530 INFO L280 TraceCheckUtils]: 32: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:28,530 INFO L280 TraceCheckUtils]: 33: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:28,532 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-18 00:13:28,532 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-18 00:13:28,533 INFO L280 TraceCheckUtils]: 36: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-18 00:13:28,534 INFO L280 TraceCheckUtils]: 37: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-18 00:13:28,534 INFO L280 TraceCheckUtils]: 38: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-18 00:13:28,534 INFO L280 TraceCheckUtils]: 39: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-18 00:13:28,535 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-18 00:13:28,535 INFO L280 TraceCheckUtils]: 41: Hoare triple {838#false} ~res~0 := #t~ret9; {838#false} is VALID [2020-07-18 00:13:28,535 INFO L280 TraceCheckUtils]: 42: Hoare triple {838#false} havoc #t~ret9; {838#false} is VALID [2020-07-18 00:13:28,535 INFO L280 TraceCheckUtils]: 43: Hoare triple {838#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {838#false} is VALID [2020-07-18 00:13:28,536 INFO L280 TraceCheckUtils]: 44: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-18 00:13:28,536 INFO L280 TraceCheckUtils]: 45: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-18 00:13:28,536 INFO L280 TraceCheckUtils]: 46: Hoare triple {838#false} havoc #t~ret10; {838#false} is VALID [2020-07-18 00:13:28,536 INFO L280 TraceCheckUtils]: 47: Hoare triple {838#false} havoc #t~short11; {838#false} is VALID [2020-07-18 00:13:28,537 INFO L280 TraceCheckUtils]: 48: Hoare triple {838#false} assume !false; {838#false} is VALID [2020-07-18 00:13:28,540 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-18 00:13:28,543 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:28,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344561620] [2020-07-18 00:13:28,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:28,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:13:28,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693959991] [2020-07-18 00:13:28,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-18 00:13:28,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:28,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:13:28,596 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-18 00:13:28,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:13:28,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:13:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:13:28,598 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2020-07-18 00:13:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:29,315 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2020-07-18 00:13:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:13:29,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-18 00:13:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 00:13:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 00:13:29,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-18 00:13:29,479 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-18 00:13:29,485 INFO L225 Difference]: With dead ends: 123 [2020-07-18 00:13:29,486 INFO L226 Difference]: Without dead ends: 92 [2020-07-18 00:13:29,487 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:13:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-18 00:13:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-07-18 00:13:29,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:29,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2020-07-18 00:13:29,558 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2020-07-18 00:13:29,558 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2020-07-18 00:13:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:29,565 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-18 00:13:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-18 00:13:29,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:29,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:29,567 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2020-07-18 00:13:29,567 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2020-07-18 00:13:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:29,573 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-18 00:13:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-18 00:13:29,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:29,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:29,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:29,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-18 00:13:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-18 00:13:29,580 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 49 [2020-07-18 00:13:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:29,580 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-18 00:13:29,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:13:29,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-18 00:13:29,672 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-18 00:13:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-18 00:13:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:13:29,675 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:29,675 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-18 00:13:29,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:13:29,676 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash -389367439, now seen corresponding path program 1 times [2020-07-18 00:13:29,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:29,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205213136] [2020-07-18 00:13:29,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,781 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-18 00:13:29,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-18 00:13:29,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-18 00:13:29,782 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-18 00:13:29,782 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-18 00:13:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,901 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-18 00:13:29,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-18 00:13:29,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-18 00:13:29,902 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-18 00:13:29,902 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-18 00:13:29,903 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-18 00:13:29,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-18 00:13:29,903 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-18 00:13:29,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-18 00:13:29,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-18 00:13:29,904 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-18 00:13:29,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-18 00:13:29,905 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-18 00:13:29,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-18 00:13:29,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-18 00:13:29,905 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-18 00:13:29,906 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-18 00:13:29,906 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-18 00:13:29,906 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-18 00:13:29,907 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-18 00:13:29,907 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-18 00:13:29,907 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-18 00:13:29,908 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:29,909 INFO L280 TraceCheckUtils]: 23: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:29,910 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-18 00:13:29,912 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-18 00:13:29,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-18 00:13:29,913 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-18 00:13:29,914 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-18 00:13:29,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-18 00:13:29,914 INFO L280 TraceCheckUtils]: 5: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-18 00:13:29,914 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-18 00:13:29,915 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-18 00:13:29,915 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-18 00:13:29,915 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-18 00:13:29,916 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-18 00:13:29,916 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-18 00:13:29,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-18 00:13:29,916 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-18 00:13:29,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-18 00:13:29,917 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-18 00:13:29,917 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-18 00:13:29,918 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-18 00:13:29,918 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-18 00:13:29,918 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-18 00:13:29,918 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-18 00:13:29,919 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-18 00:13:29,919 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-18 00:13:29,919 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-18 00:13:29,919 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-18 00:13:29,920 INFO L280 TraceCheckUtils]: 25: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:29,921 INFO L280 TraceCheckUtils]: 26: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:29,922 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-18 00:13:29,923 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-18 00:13:29,924 INFO L280 TraceCheckUtils]: 29: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-18 00:13:29,924 INFO L280 TraceCheckUtils]: 30: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-18 00:13:29,924 INFO L280 TraceCheckUtils]: 31: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-18 00:13:29,925 INFO L280 TraceCheckUtils]: 32: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-18 00:13:29,925 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-18 00:13:29,927 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-18 00:13:29,927 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-18 00:13:29,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-18 00:13:29,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-18 00:13:29,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-18 00:13:29,928 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-18 00:13:29,929 INFO L263 TraceCheckUtils]: 6: Hoare triple {1518#true} call #t~ret12 := main(); {1518#true} is VALID [2020-07-18 00:13:29,929 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0); {1518#true} is VALID [2020-07-18 00:13:29,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} ~y~0 := 0.0; {1518#true} is VALID [2020-07-18 00:13:29,931 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-18 00:13:29,931 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-18 00:13:29,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-18 00:13:29,933 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-18 00:13:29,933 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-18 00:13:29,933 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-18 00:13:29,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-18 00:13:29,934 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-18 00:13:29,934 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-18 00:13:29,934 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-18 00:13:29,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-18 00:13:29,935 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-18 00:13:29,935 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-18 00:13:29,935 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-18 00:13:29,936 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-18 00:13:29,936 INFO L280 TraceCheckUtils]: 24: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-18 00:13:29,936 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-18 00:13:29,936 INFO L280 TraceCheckUtils]: 26: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-18 00:13:29,937 INFO L280 TraceCheckUtils]: 27: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-18 00:13:29,937 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-18 00:13:29,937 INFO L280 TraceCheckUtils]: 29: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-18 00:13:29,937 INFO L280 TraceCheckUtils]: 30: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-18 00:13:29,938 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-18 00:13:29,938 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-18 00:13:29,938 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-18 00:13:29,938 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-18 00:13:29,939 INFO L280 TraceCheckUtils]: 35: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:29,940 INFO L280 TraceCheckUtils]: 36: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 00:13:29,941 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-18 00:13:29,942 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-18 00:13:29,942 INFO L280 TraceCheckUtils]: 39: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-18 00:13:29,943 INFO L280 TraceCheckUtils]: 40: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-18 00:13:29,943 INFO L280 TraceCheckUtils]: 41: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-18 00:13:29,943 INFO L280 TraceCheckUtils]: 42: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-18 00:13:29,943 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-18 00:13:29,944 INFO L280 TraceCheckUtils]: 44: Hoare triple {1519#false} ~res~0 := #t~ret9; {1519#false} is VALID [2020-07-18 00:13:29,944 INFO L280 TraceCheckUtils]: 45: Hoare triple {1519#false} havoc #t~ret9; {1519#false} is VALID [2020-07-18 00:13:29,944 INFO L280 TraceCheckUtils]: 46: Hoare triple {1519#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {1519#false} is VALID [2020-07-18 00:13:29,944 INFO L280 TraceCheckUtils]: 47: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-18 00:13:29,945 INFO L280 TraceCheckUtils]: 48: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-18 00:13:29,945 INFO L280 TraceCheckUtils]: 49: Hoare triple {1519#false} havoc #t~ret10; {1519#false} is VALID [2020-07-18 00:13:29,945 INFO L280 TraceCheckUtils]: 50: Hoare triple {1519#false} havoc #t~short11; {1519#false} is VALID [2020-07-18 00:13:29,945 INFO L280 TraceCheckUtils]: 51: Hoare triple {1519#false} assume !false; {1519#false} is VALID [2020-07-18 00:13:29,948 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-18 00:13:29,951 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:29,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205213136] [2020-07-18 00:13:29,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:29,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:13:29,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838429472] [2020-07-18 00:13:29,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-18 00:13:29,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:29,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:13:30,016 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-18 00:13:30,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:13:30,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:30,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:13:30,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:13:30,018 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 6 states. [2020-07-18 00:13:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:30,732 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-18 00:13:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:13:30,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-18 00:13:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 00:13:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 00:13:30,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-18 00:13:30,923 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-18 00:13:30,927 INFO L225 Difference]: With dead ends: 127 [2020-07-18 00:13:30,927 INFO L226 Difference]: Without dead ends: 96 [2020-07-18 00:13:30,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:13:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-18 00:13:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2020-07-18 00:13:31,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:31,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 91 states. [2020-07-18 00:13:31,002 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 91 states. [2020-07-18 00:13:31,002 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 91 states. [2020-07-18 00:13:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:31,008 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-18 00:13:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-18 00:13:31,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:31,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:31,009 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 96 states. [2020-07-18 00:13:31,009 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 96 states. [2020-07-18 00:13:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:31,015 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-18 00:13:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-18 00:13:31,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:31,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:31,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:31,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-18 00:13:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-18 00:13:31,021 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 52 [2020-07-18 00:13:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:31,022 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-18 00:13:31,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:13:31,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-18 00:13:31,143 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-18 00:13:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-18 00:13:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:13:31,145 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:31,145 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-18 00:13:31,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:13:31,146 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:31,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:31,146 INFO L82 PathProgramCache]: Analyzing trace with hash 323107249, now seen corresponding path program 1 times [2020-07-18 00:13:31,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:31,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227460349] [2020-07-18 00:13:31,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:13:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:13:31,373 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:31,373 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 00:13:31,374 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 00:13:31,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:13:31,396 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 00:13:31,396 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: fmax_doubleENTRY has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: __signbit_doubleENTRY has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-18 00:13:31,397 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-18 00:13:31,398 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-18 00:13:31,399 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: L63-3 has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-18 00:13:31,400 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: __signbit_doubleFINAL has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-18 00:13:31,401 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: __signbit_doubleEXIT has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-18 00:13:31,402 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-18 00:13:31,403 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: fmax_doubleFINAL has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: L84-4 has no Hoare annotation [2020-07-18 00:13:31,404 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L84-6 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L84-6 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: fmax_doubleEXIT has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-18 00:13:31,405 WARN L170 areAnnotationChecker]: L66-3 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L84-7 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L84-9 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L54-3 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L54-4 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L84-8 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L84-10 has no Hoare annotation [2020-07-18 00:13:31,406 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-18 00:13:31,407 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-18 00:13:31,408 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-18 00:13:31,408 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-18 00:13:31,408 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-18 00:13:31,408 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-18 00:13:31,409 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-18 00:13:31,409 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 00:13:31,409 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-18 00:13:31,409 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-18 00:13:31,410 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 00:13:31,410 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-18 00:13:31,410 WARN L170 areAnnotationChecker]: L57-5 has no Hoare annotation [2020-07-18 00:13:31,410 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-18 00:13:31,410 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-18 00:13:31,410 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-18 00:13:31,410 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-18 00:13:31,411 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-18 00:13:31,411 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-18 00:13:31,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:13:31 BoogieIcfgContainer [2020-07-18 00:13:31,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:13:31,420 INFO L168 Benchmark]: Toolchain (without parser) took 6235.32 ms. Allocated memory was 137.9 MB in the beginning and 287.8 MB in the end (delta: 149.9 MB). Free memory was 103.1 MB in the beginning and 178.5 MB in the end (delta: -75.4 MB). Peak memory consumption was 74.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:31,421 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:13:31,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.41 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.7 MB in the beginning and 178.8 MB in the end (delta: -76.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:31,430 INFO L168 Benchmark]: Boogie Preprocessor took 49.14 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 176.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:31,431 INFO L168 Benchmark]: RCFGBuilder took 680.89 ms. Allocated memory is still 201.9 MB. Free memory was 176.8 MB in the beginning and 137.2 MB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:31,437 INFO L168 Benchmark]: TraceAbstraction took 5069.74 ms. Allocated memory was 201.9 MB in the beginning and 287.8 MB in the end (delta: 86.0 MB). Free memory was 137.2 MB in the beginning and 178.5 MB in the end (delta: -41.3 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:31,443 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 428.41 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.7 MB in the beginning and 178.8 MB in the end (delta: -76.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.14 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 176.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 680.89 ms. Allocated memory is still 201.9 MB. Free memory was 176.8 MB in the beginning and 137.2 MB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5069.74 ms. Allocated memory was 201.9 MB in the beginning and 287.8 MB in the end (delta: 86.0 MB). Free memory was 137.2 MB in the beginning and 178.5 MB in the end (delta: -41.3 MB). Peak memory consumption was 44.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.9s, 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, 80 GetRequests, 65 SyntacticMatches, 2 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...