/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/float_req_bl_1250.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:35:45,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:35:45,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:35:45,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:35:45,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:35:45,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:35:45,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:35:45,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:35:45,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:35:45,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:35:45,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:35:45,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:35:45,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:35:45,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:35:45,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:35:45,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:35:45,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:35:45,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:35:45,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:35:45,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:35:45,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:35:45,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:35:45,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:35:45,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:35:45,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:35:45,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:35:45,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:35:45,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:35:45,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:35:45,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:35:45,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:35:45,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:35:45,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:35:45,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:35:45,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:35:45,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:35:45,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:35:45,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:35:45,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:35:45,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:35:45,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:35:45,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:35:45,652 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:35:45,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:35:45,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:35:45,654 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:35:45,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:35:45,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:35:45,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:35:45,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:35:45,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:35:45,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:35:45,655 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:35:45,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:35:45,656 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:35:45,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:35:45,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:35:45,656 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:35:45,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:35:45,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:35:45,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:45,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:35:45,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:35:45,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:35:45,658 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:35:45,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:35:45,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:35:45,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:35:45,999 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:35:46,000 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:35:46,001 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1250.c [2020-07-10 18:35:46,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9c6a763/1edcd1a81bd14bab95e0a89c06caff38/FLAGa75f8e575 [2020-07-10 18:35:46,544 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:35:46,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1250.c [2020-07-10 18:35:46,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9c6a763/1edcd1a81bd14bab95e0a89c06caff38/FLAGa75f8e575 [2020-07-10 18:35:46,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9c6a763/1edcd1a81bd14bab95e0a89c06caff38 [2020-07-10 18:35:46,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:35:46,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:35:46,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:46,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:35:46,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:35:46,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:46" (1/1) ... [2020-07-10 18:35:46,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba7554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:46, skipping insertion in model container [2020-07-10 18:35:46,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:46" (1/1) ... [2020-07-10 18:35:46,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:35:46,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:35:47,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:47,216 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:35:47,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:47,360 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:35:47,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47 WrapperNode [2020-07-10 18:35:47,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:47,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:35:47,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:35:47,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:35:47,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... [2020-07-10 18:35:47,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... [2020-07-10 18:35:47,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... [2020-07-10 18:35:47,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... [2020-07-10 18:35:47,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... [2020-07-10 18:35:47,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... [2020-07-10 18:35:47,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... [2020-07-10 18:35:47,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:35:47,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:35:47,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:35:47,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:35:47,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:47,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:35:47,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:35:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-10 18:35:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-10 18:35:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-10 18:35:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:35:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:35:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-10 18:35:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 18:35:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 18:35:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:35:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:35:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-10 18:35:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-10 18:35:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:35:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:35:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:35:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:35:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 18:35:47,973 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:35:47,973 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 18:35:47,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:47 BoogieIcfgContainer [2020-07-10 18:35:47,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:35:47,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:35:47,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:35:47,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:35:47,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:35:46" (1/3) ... [2020-07-10 18:35:47,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7035029b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:47, skipping insertion in model container [2020-07-10 18:35:47,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:47" (2/3) ... [2020-07-10 18:35:47,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7035029b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:47, skipping insertion in model container [2020-07-10 18:35:47,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:47" (3/3) ... [2020-07-10 18:35:47,987 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2020-07-10 18:35:48,000 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:35:48,008 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:35:48,023 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:35:48,042 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:35:48,042 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:35:48,043 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:35:48,043 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:35:48,043 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:35:48,044 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:35:48,044 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:35:48,044 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:35:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-07-10 18:35:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 18:35:48,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:48,074 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] [2020-07-10 18:35:48,075 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1283430724, now seen corresponding path program 1 times [2020-07-10 18:35:48,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:48,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474128114] [2020-07-10 18:35:48,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {76#true} is VALID [2020-07-10 18:35:48,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-10 18:35:48,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-10 18:35:48,364 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:48,364 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-10 18:35:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:48,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-10 18:35:48,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-10 18:35:48,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-10 18:35:48,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-10 18:35:48,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:48,476 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-10 18:35:48,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:48,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-10 18:35:48,481 INFO L263 TraceCheckUtils]: 2: Hoare triple {76#true} call #t~ret2 := __fpclassify_float(~x); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:48,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:48,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-10 18:35:48,483 INFO L280 TraceCheckUtils]: 5: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-10 18:35:48,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-10 18:35:48,484 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-10 18:35:48,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:48,484 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-10 18:35:48,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-10 18:35:48,485 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-10 18:35:48,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-10 18:35:48,486 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-10 18:35:48,487 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:48,487 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-10 18:35:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:48,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-10 18:35:48,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:48,502 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-10 18:35:48,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {76#true} call ULTIMATE.init(); {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:48,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {76#true} is VALID [2020-07-10 18:35:48,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-10 18:35:48,504 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-10 18:35:48,505 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:48,505 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-10 18:35:48,505 INFO L263 TraceCheckUtils]: 6: Hoare triple {76#true} call #t~ret7 := main(); {76#true} is VALID [2020-07-10 18:35:48,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-10 18:35:48,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {76#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-10 18:35:48,508 INFO L263 TraceCheckUtils]: 9: Hoare triple {76#true} call #t~ret5 := fmax_float(~x~0, ~y~0); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:48,508 INFO L280 TraceCheckUtils]: 10: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:48,509 INFO L280 TraceCheckUtils]: 11: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-10 18:35:48,510 INFO L263 TraceCheckUtils]: 12: Hoare triple {76#true} call #t~ret2 := __fpclassify_float(~x); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:48,511 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:48,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-10 18:35:48,512 INFO L280 TraceCheckUtils]: 15: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-10 18:35:48,512 INFO L280 TraceCheckUtils]: 16: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-10 18:35:48,512 INFO L280 TraceCheckUtils]: 17: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-10 18:35:48,513 INFO L280 TraceCheckUtils]: 18: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:48,513 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-10 18:35:48,514 INFO L280 TraceCheckUtils]: 20: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-10 18:35:48,514 INFO L280 TraceCheckUtils]: 21: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-10 18:35:48,514 INFO L280 TraceCheckUtils]: 22: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-10 18:35:48,515 INFO L280 TraceCheckUtils]: 23: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-10 18:35:48,515 INFO L280 TraceCheckUtils]: 24: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:48,515 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-10 18:35:48,516 INFO L280 TraceCheckUtils]: 26: Hoare triple {77#false} ~res~0 := #t~ret5; {77#false} is VALID [2020-07-10 18:35:48,516 INFO L280 TraceCheckUtils]: 27: Hoare triple {77#false} havoc #t~ret5; {77#false} is VALID [2020-07-10 18:35:48,516 INFO L263 TraceCheckUtils]: 28: Hoare triple {77#false} call #t~ret6 := isnan_float(~res~0); {76#true} is VALID [2020-07-10 18:35:48,517 INFO L280 TraceCheckUtils]: 29: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:48,517 INFO L280 TraceCheckUtils]: 30: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-10 18:35:48,517 INFO L280 TraceCheckUtils]: 31: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:48,518 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-10 18:35:48,518 INFO L280 TraceCheckUtils]: 33: Hoare triple {77#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {77#false} is VALID [2020-07-10 18:35:48,518 INFO L280 TraceCheckUtils]: 34: Hoare triple {77#false} assume 0 == #t~ret6; {77#false} is VALID [2020-07-10 18:35:48,519 INFO L280 TraceCheckUtils]: 35: Hoare triple {77#false} havoc #t~ret6; {77#false} is VALID [2020-07-10 18:35:48,519 INFO L280 TraceCheckUtils]: 36: Hoare triple {77#false} assume !false; {77#false} is VALID [2020-07-10 18:35:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:35:48,524 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:48,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474128114] [2020-07-10 18:35:48,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:48,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 18:35:48,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397931317] [2020-07-10 18:35:48,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-10 18:35:48,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:48,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 18:35:48,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:48,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 18:35:48,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 18:35:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 18:35:48,635 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2020-07-10 18:35:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:49,288 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-07-10 18:35:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 18:35:49,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-10 18:35:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-10 18:35:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-10 18:35:49,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2020-07-10 18:35:49,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:49,523 INFO L225 Difference]: With dead ends: 132 [2020-07-10 18:35:49,524 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 18:35:49,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:35:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 18:35:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-10 18:35:49,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:49,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:49,646 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:49,647 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:49,655 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-10 18:35:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 18:35:49,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:49,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:49,657 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:49,657 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:49,664 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-10 18:35:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 18:35:49,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:49,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:49,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:49,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 18:35:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2020-07-10 18:35:49,672 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 37 [2020-07-10 18:35:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:49,673 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2020-07-10 18:35:49,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 18:35:49,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 73 transitions. [2020-07-10 18:35:49,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 18:35:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 18:35:49,777 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:49,778 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] [2020-07-10 18:35:49,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:35:49,778 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash -611644563, now seen corresponding path program 1 times [2020-07-10 18:35:49,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:49,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196411331] [2020-07-10 18:35:49,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:49,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {645#true} is VALID [2020-07-10 18:35:49,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-10 18:35:49,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-10 18:35:49,879 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:49,880 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-10 18:35:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:49,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:49,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-10 18:35:49,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L22-2 {645#true} is VALID [2020-07-10 18:35:49,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L23 {645#true} is VALID [2020-07-10 18:35:49,993 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {645#true} is VALID [2020-07-10 18:35:49,993 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-10 18:35:49,994 INFO L280 TraceCheckUtils]: 6: Hoare triple {645#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L25-1 {645#true} is VALID [2020-07-10 18:35:49,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-10 18:35:49,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-10 18:35:49,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L23-1 {645#true} is VALID [2020-07-10 18:35:49,995 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-10 18:35:49,995 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-10 18:35:49,996 INFO L280 TraceCheckUtils]: 12: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-10 18:35:49,997 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:49,997 INFO L280 TraceCheckUtils]: 14: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:49,999 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:49,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:50,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-10 18:35:50,001 INFO L263 TraceCheckUtils]: 2: Hoare triple {645#true} call #t~ret2 := __fpclassify_float(~x); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:50,002 INFO L280 TraceCheckUtils]: 3: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:50,002 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-10 18:35:50,002 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L22-2 {645#true} is VALID [2020-07-10 18:35:50,003 INFO L280 TraceCheckUtils]: 6: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L23 {645#true} is VALID [2020-07-10 18:35:50,003 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {645#true} is VALID [2020-07-10 18:35:50,003 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-10 18:35:50,003 INFO L280 TraceCheckUtils]: 9: Hoare triple {645#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L25-1 {645#true} is VALID [2020-07-10 18:35:50,004 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-10 18:35:50,004 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-10 18:35:50,004 INFO L280 TraceCheckUtils]: 12: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L23-1 {645#true} is VALID [2020-07-10 18:35:50,005 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-10 18:35:50,005 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-10 18:35:50,005 INFO L280 TraceCheckUtils]: 15: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-10 18:35:50,006 INFO L280 TraceCheckUtils]: 16: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:50,007 INFO L280 TraceCheckUtils]: 17: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:50,009 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:50,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {699#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {699#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:50,010 INFO L280 TraceCheckUtils]: 20: Hoare triple {699#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-10 18:35:50,011 INFO L280 TraceCheckUtils]: 21: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-10 18:35:50,011 INFO L280 TraceCheckUtils]: 22: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-10 18:35:50,011 INFO L280 TraceCheckUtils]: 23: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-10 18:35:50,011 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-10 18:35:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:50,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:50,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-10 18:35:50,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:50,020 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-10 18:35:50,021 INFO L263 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:50,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {645#true} is VALID [2020-07-10 18:35:50,021 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-10 18:35:50,022 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-10 18:35:50,022 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:50,022 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-10 18:35:50,023 INFO L263 TraceCheckUtils]: 6: Hoare triple {645#true} call #t~ret7 := main(); {645#true} is VALID [2020-07-10 18:35:50,023 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-10 18:35:50,023 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-10 18:35:50,025 INFO L263 TraceCheckUtils]: 9: Hoare triple {645#true} call #t~ret5 := fmax_float(~x~0, ~y~0); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:50,025 INFO L280 TraceCheckUtils]: 10: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:50,025 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-10 18:35:50,027 INFO L263 TraceCheckUtils]: 12: Hoare triple {645#true} call #t~ret2 := __fpclassify_float(~x); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:50,027 INFO L280 TraceCheckUtils]: 13: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:50,027 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-10 18:35:50,028 INFO L280 TraceCheckUtils]: 15: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L22-2 {645#true} is VALID [2020-07-10 18:35:50,028 INFO L280 TraceCheckUtils]: 16: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L23 {645#true} is VALID [2020-07-10 18:35:50,028 INFO L280 TraceCheckUtils]: 17: Hoare triple {645#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {645#true} is VALID [2020-07-10 18:35:50,028 INFO L280 TraceCheckUtils]: 18: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-10 18:35:50,029 INFO L280 TraceCheckUtils]: 19: Hoare triple {645#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L25-1 {645#true} is VALID [2020-07-10 18:35:50,029 INFO L280 TraceCheckUtils]: 20: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-10 18:35:50,029 INFO L280 TraceCheckUtils]: 21: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-10 18:35:50,030 INFO L280 TraceCheckUtils]: 22: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L23-1 {645#true} is VALID [2020-07-10 18:35:50,030 INFO L280 TraceCheckUtils]: 23: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-10 18:35:50,030 INFO L280 TraceCheckUtils]: 24: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-10 18:35:50,030 INFO L280 TraceCheckUtils]: 25: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-10 18:35:50,031 INFO L280 TraceCheckUtils]: 26: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:50,032 INFO L280 TraceCheckUtils]: 27: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:50,033 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:50,034 INFO L280 TraceCheckUtils]: 29: Hoare triple {699#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {699#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:50,035 INFO L280 TraceCheckUtils]: 30: Hoare triple {699#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-10 18:35:50,035 INFO L280 TraceCheckUtils]: 31: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-10 18:35:50,035 INFO L280 TraceCheckUtils]: 32: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-10 18:35:50,036 INFO L280 TraceCheckUtils]: 33: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-10 18:35:50,036 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-10 18:35:50,036 INFO L280 TraceCheckUtils]: 35: Hoare triple {646#false} ~res~0 := #t~ret5; {646#false} is VALID [2020-07-10 18:35:50,037 INFO L280 TraceCheckUtils]: 36: Hoare triple {646#false} havoc #t~ret5; {646#false} is VALID [2020-07-10 18:35:50,037 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#false} call #t~ret6 := isnan_float(~res~0); {645#true} is VALID [2020-07-10 18:35:50,037 INFO L280 TraceCheckUtils]: 38: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:50,037 INFO L280 TraceCheckUtils]: 39: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-10 18:35:50,038 INFO L280 TraceCheckUtils]: 40: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:50,038 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-10 18:35:50,038 INFO L280 TraceCheckUtils]: 42: Hoare triple {646#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {646#false} is VALID [2020-07-10 18:35:50,039 INFO L280 TraceCheckUtils]: 43: Hoare triple {646#false} assume 0 == #t~ret6; {646#false} is VALID [2020-07-10 18:35:50,039 INFO L280 TraceCheckUtils]: 44: Hoare triple {646#false} havoc #t~ret6; {646#false} is VALID [2020-07-10 18:35:50,039 INFO L280 TraceCheckUtils]: 45: Hoare triple {646#false} assume !false; {646#false} is VALID [2020-07-10 18:35:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:35:50,043 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:50,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196411331] [2020-07-10 18:35:50,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:50,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:50,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190835027] [2020-07-10 18:35:50,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-10 18:35:50,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:50,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:50,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:50,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:50,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:50,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:50,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:50,098 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2020-07-10 18:35:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:50,730 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 18:35:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:50,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-10 18:35:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:50,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-10 18:35:50,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:50,863 INFO L225 Difference]: With dead ends: 87 [2020-07-10 18:35:50,864 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 18:35:50,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:35:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 18:35:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2020-07-10 18:35:50,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:50,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2020-07-10 18:35:50,965 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2020-07-10 18:35:50,965 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2020-07-10 18:35:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:50,970 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-10 18:35:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-10 18:35:50,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:50,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:50,972 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2020-07-10 18:35:50,972 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2020-07-10 18:35:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:50,977 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-10 18:35:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-10 18:35:50,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:50,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:50,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:50,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 18:35:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-10 18:35:50,983 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 46 [2020-07-10 18:35:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:50,983 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-10 18:35:50,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:50,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-10 18:35:51,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-10 18:35:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 18:35:51,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:51,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:51,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:35:51,088 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:51,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1210069817, now seen corresponding path program 1 times [2020-07-10 18:35:51,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:51,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223157617] [2020-07-10 18:35:51,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:51,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1162#true} is VALID [2020-07-10 18:35:51,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-10 18:35:51,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-10 18:35:51,205 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:51,205 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-10 18:35:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:51,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:51,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-10 18:35:51,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L22-2 {1162#true} is VALID [2020-07-10 18:35:51,334 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L23 {1162#true} is VALID [2020-07-10 18:35:51,335 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {1162#true} is VALID [2020-07-10 18:35:51,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-10 18:35:51,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L25-1 {1162#true} is VALID [2020-07-10 18:35:51,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-10 18:35:51,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-10 18:35:51,336 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L23-1 {1162#true} is VALID [2020-07-10 18:35:51,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-10 18:35:51,337 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-10 18:35:51,337 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-10 18:35:51,337 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-10 18:35:51,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-10 18:35:51,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-10 18:35:51,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:51,340 INFO L280 TraceCheckUtils]: 17: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:51,341 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:51,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:51,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-10 18:35:51,343 INFO L263 TraceCheckUtils]: 2: Hoare triple {1162#true} call #t~ret2 := __fpclassify_float(~x); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:51,344 INFO L280 TraceCheckUtils]: 3: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:51,344 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-10 18:35:51,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L22-2 {1162#true} is VALID [2020-07-10 18:35:51,344 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L23 {1162#true} is VALID [2020-07-10 18:35:51,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {1162#true} is VALID [2020-07-10 18:35:51,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-10 18:35:51,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L25-1 {1162#true} is VALID [2020-07-10 18:35:51,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-10 18:35:51,351 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-10 18:35:51,351 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L23-1 {1162#true} is VALID [2020-07-10 18:35:51,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-10 18:35:51,352 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-10 18:35:51,352 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-10 18:35:51,353 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-10 18:35:51,353 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-10 18:35:51,353 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-10 18:35:51,354 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:51,355 INFO L280 TraceCheckUtils]: 20: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:51,356 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:51,357 INFO L280 TraceCheckUtils]: 22: Hoare triple {1222#(= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1222#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:51,358 INFO L280 TraceCheckUtils]: 23: Hoare triple {1222#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-10 18:35:51,358 INFO L280 TraceCheckUtils]: 24: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-10 18:35:51,358 INFO L280 TraceCheckUtils]: 25: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-10 18:35:51,359 INFO L280 TraceCheckUtils]: 26: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-10 18:35:51,359 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-10 18:35:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:51,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:51,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-10 18:35:51,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:51,366 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-10 18:35:51,368 INFO L263 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:51,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1162#true} is VALID [2020-07-10 18:35:51,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-10 18:35:51,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-10 18:35:51,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:51,369 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-10 18:35:51,369 INFO L263 TraceCheckUtils]: 6: Hoare triple {1162#true} call #t~ret7 := main(); {1162#true} is VALID [2020-07-10 18:35:51,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-10 18:35:51,370 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-10 18:35:51,371 INFO L263 TraceCheckUtils]: 9: Hoare triple {1162#true} call #t~ret5 := fmax_float(~x~0, ~y~0); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:51,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:51,372 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-10 18:35:51,373 INFO L263 TraceCheckUtils]: 12: Hoare triple {1162#true} call #t~ret2 := __fpclassify_float(~x); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:51,373 INFO L280 TraceCheckUtils]: 13: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:51,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-10 18:35:51,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L22-2 {1162#true} is VALID [2020-07-10 18:35:51,374 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L23 {1162#true} is VALID [2020-07-10 18:35:51,375 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {1162#true} is VALID [2020-07-10 18:35:51,375 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-10 18:35:51,375 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L25-1 {1162#true} is VALID [2020-07-10 18:35:51,375 INFO L280 TraceCheckUtils]: 20: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-10 18:35:51,376 INFO L280 TraceCheckUtils]: 21: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-10 18:35:51,376 INFO L280 TraceCheckUtils]: 22: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L23-1 {1162#true} is VALID [2020-07-10 18:35:51,376 INFO L280 TraceCheckUtils]: 23: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-10 18:35:51,376 INFO L280 TraceCheckUtils]: 24: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-10 18:35:51,377 INFO L280 TraceCheckUtils]: 25: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-10 18:35:51,377 INFO L280 TraceCheckUtils]: 26: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-10 18:35:51,377 INFO L280 TraceCheckUtils]: 27: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-10 18:35:51,377 INFO L280 TraceCheckUtils]: 28: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-10 18:35:51,378 INFO L280 TraceCheckUtils]: 29: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:51,379 INFO L280 TraceCheckUtils]: 30: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:51,380 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:51,380 INFO L280 TraceCheckUtils]: 32: Hoare triple {1222#(= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1222#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 18:35:51,381 INFO L280 TraceCheckUtils]: 33: Hoare triple {1222#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-10 18:35:51,381 INFO L280 TraceCheckUtils]: 34: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-10 18:35:51,382 INFO L280 TraceCheckUtils]: 35: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-10 18:35:51,382 INFO L280 TraceCheckUtils]: 36: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-10 18:35:51,382 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-10 18:35:51,382 INFO L280 TraceCheckUtils]: 38: Hoare triple {1163#false} ~res~0 := #t~ret5; {1163#false} is VALID [2020-07-10 18:35:51,383 INFO L280 TraceCheckUtils]: 39: Hoare triple {1163#false} havoc #t~ret5; {1163#false} is VALID [2020-07-10 18:35:51,383 INFO L263 TraceCheckUtils]: 40: Hoare triple {1163#false} call #t~ret6 := isnan_float(~res~0); {1162#true} is VALID [2020-07-10 18:35:51,383 INFO L280 TraceCheckUtils]: 41: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:51,383 INFO L280 TraceCheckUtils]: 42: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-10 18:35:51,384 INFO L280 TraceCheckUtils]: 43: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:51,384 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-10 18:35:51,384 INFO L280 TraceCheckUtils]: 45: Hoare triple {1163#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1163#false} is VALID [2020-07-10 18:35:51,384 INFO L280 TraceCheckUtils]: 46: Hoare triple {1163#false} assume 0 == #t~ret6; {1163#false} is VALID [2020-07-10 18:35:51,385 INFO L280 TraceCheckUtils]: 47: Hoare triple {1163#false} havoc #t~ret6; {1163#false} is VALID [2020-07-10 18:35:51,385 INFO L280 TraceCheckUtils]: 48: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2020-07-10 18:35:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:35:51,388 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:51,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223157617] [2020-07-10 18:35:51,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:51,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:51,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120269417] [2020-07-10 18:35:51,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:51,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:51,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:51,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:51,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:51,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:51,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:51,438 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 6 states. [2020-07-10 18:35:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:52,053 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-07-10 18:35:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:52,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:52,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-10 18:35:52,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:52,176 INFO L225 Difference]: With dead ends: 91 [2020-07-10 18:35:52,176 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 18:35:52,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:35:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 18:35:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2020-07-10 18:35:52,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:52,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 70 states. [2020-07-10 18:35:52,251 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 70 states. [2020-07-10 18:35:52,251 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 70 states. [2020-07-10 18:35:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:52,255 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-10 18:35:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-10 18:35:52,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:52,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:52,257 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 75 states. [2020-07-10 18:35:52,257 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 75 states. [2020-07-10 18:35:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:52,261 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-10 18:35:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-10 18:35:52,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:52,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:52,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:52,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 18:35:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-10 18:35:52,266 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 49 [2020-07-10 18:35:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:52,266 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-10 18:35:52,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:52,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-10 18:35:52,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-10 18:35:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 18:35:52,365 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:52,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:52,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:35:52,366 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 815123193, now seen corresponding path program 1 times [2020-07-10 18:35:52,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:52,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980154464] [2020-07-10 18:35:52,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:52,612 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:52,613 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 18:35:52,613 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 18:35:52,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:35:52,631 WARN L170 areAnnotationChecker]: isnan_floatENTRY has no Hoare annotation [2020-07-10 18:35:52,631 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 18:35:52,631 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 18:35:52,631 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 18:35:52,631 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 18:35:52,631 WARN L170 areAnnotationChecker]: fmax_floatENTRY has no Hoare annotation [2020-07-10 18:35:52,631 WARN L170 areAnnotationChecker]: __fpclassify_floatENTRY has no Hoare annotation [2020-07-10 18:35:52,632 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 18:35:52,632 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:52,632 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:52,632 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 18:35:52,632 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 18:35:52,632 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 18:35:52,632 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: isnan_floatFINAL has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 18:35:52,633 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 18:35:52,634 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 18:35:52,634 WARN L170 areAnnotationChecker]: isnan_floatEXIT has no Hoare annotation [2020-07-10 18:35:52,634 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 18:35:52,634 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-10 18:35:52,634 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-10 18:35:52,634 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 18:35:52,635 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 18:35:52,635 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 18:35:52,635 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-10 18:35:52,635 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 18:35:52,635 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-10 18:35:52,635 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-10 18:35:52,635 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-10 18:35:52,636 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 18:35:52,636 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 18:35:52,636 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 18:35:52,636 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 18:35:52,636 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-10 18:35:52,636 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-10 18:35:52,636 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 18:35:52,637 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 18:35:52,637 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 18:35:52,637 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-10 18:35:52,637 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 18:35:52,637 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2020-07-10 18:35:52,637 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 18:35:52,637 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 18:35:52,638 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 18:35:52,638 WARN L170 areAnnotationChecker]: L64-3 has no Hoare annotation [2020-07-10 18:35:52,638 WARN L170 areAnnotationChecker]: L64-4 has no Hoare annotation [2020-07-10 18:35:52,638 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 18:35:52,638 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 18:35:52,638 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 18:35:52,638 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 18:35:52,639 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 18:35:52,639 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 18:35:52,639 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 18:35:52,639 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 18:35:52,639 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 18:35:52,639 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 18:35:52,640 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 18:35:52,640 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 18:35:52,640 WARN L170 areAnnotationChecker]: fmax_floatFINAL has no Hoare annotation [2020-07-10 18:35:52,640 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 18:35:52,640 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2020-07-10 18:35:52,640 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 18:35:52,640 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 18:35:52,641 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 18:35:52,641 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 18:35:52,641 WARN L170 areAnnotationChecker]: fmax_floatEXIT has no Hoare annotation [2020-07-10 18:35:52,641 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 18:35:52,641 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 18:35:52,641 WARN L170 areAnnotationChecker]: L25-3 has no Hoare annotation [2020-07-10 18:35:52,641 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 18:35:52,642 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 18:35:52,642 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-10 18:35:52,642 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 18:35:52,642 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-10 18:35:52,642 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 18:35:52,642 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 18:35:52,642 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-10 18:35:52,643 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-10 18:35:52,643 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 18:35:52,643 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 18:35:52,643 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 18:35:52,643 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-10 18:35:52,643 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-10 18:35:52,644 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 18:35:52,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 06:35:52 BoogieIcfgContainer [2020-07-10 18:35:52,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 18:35:52,651 INFO L168 Benchmark]: Toolchain (without parser) took 5718.39 ms. Allocated memory was 142.1 MB in the beginning and 299.9 MB in the end (delta: 157.8 MB). Free memory was 98.7 MB in the beginning and 170.1 MB in the end (delta: -71.4 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:52,652 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.1 MB. Free memory is still 117.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:35:52,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.30 ms. Allocated memory was 142.1 MB in the beginning and 198.7 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 177.2 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:52,654 INFO L168 Benchmark]: Boogie Preprocessor took 41.72 ms. Allocated memory is still 198.7 MB. Free memory was 177.2 MB in the beginning and 174.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:52,655 INFO L168 Benchmark]: RCFGBuilder took 574.89 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 142.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:52,656 INFO L168 Benchmark]: TraceAbstraction took 4667.89 ms. Allocated memory was 198.7 MB in the beginning and 299.9 MB in the end (delta: 101.2 MB). Free memory was 141.6 MB in the beginning and 170.1 MB in the end (delta: -28.5 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:52,659 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.24 ms. Allocated memory is still 142.1 MB. Free memory is still 117.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 427.30 ms. Allocated memory was 142.1 MB in the beginning and 198.7 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 177.2 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.72 ms. Allocated memory is still 198.7 MB. Free memory was 177.2 MB in the beginning and 174.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 574.89 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 142.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4667.89 ms. Allocated memory was 198.7 MB in the beginning and 299.9 MB in the end (delta: 101.2 MB). Free memory was 141.6 MB in the beginning and 170.1 MB in the end (delta: -28.5 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 65]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L60] float x = 0.0f / 0.0f; [L61] float y = 0.0f / 0.0f; [L62] CALL, EXPR fmax_float(x, y) [L43] CALL, EXPR __fpclassify_float(x) [L20] __uint32_t w; [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; [L43] RET, EXPR __fpclassify_float(x) [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; [L62] RET, EXPR fmax_float(x, y) [L62] float res = fmax_float(x, y); [L64] CALL, EXPR isnan_float(res) [L54] return x != x; [L64] RET, EXPR isnan_float(res) [L64] COND TRUE !isnan_float(res) [L65] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 221 SDtfs, 59 SDslu, 387 SDs, 0 SdLazy, 288 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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...