/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-46f3038-m [2020-07-08 15:54:30,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:54:30,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:54:31,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:54:31,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:54:31,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:54:31,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:54:31,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:54:31,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:54:31,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:54:31,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:54:31,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:54:31,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:54:31,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:54:31,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:54:31,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:54:31,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:54:31,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:54:31,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:54:31,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:54:31,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:54:31,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:54:31,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:54:31,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:54:31,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:54:31,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:54:31,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:54:31,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:54:31,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:54:31,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:54:31,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:54:31,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:54:31,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:54:31,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:54:31,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:54:31,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:54:31,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:54:31,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:54:31,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:54:31,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:54:31,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:54:31,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:54:31,095 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:54:31,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:54:31,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:54:31,097 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:54:31,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:54:31,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:54:31,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:54:31,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:54:31,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:54:31,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:54:31,098 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:54:31,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:54:31,099 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:54:31,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:54:31,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:54:31,099 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:54:31,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:54:31,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:54:31,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:54:31,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:54:31,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:54:31,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:54:31,101 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:54:31,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:54:31,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:54:31,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:54:31,406 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:54:31,407 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:54:31,408 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-08 15:54:31,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc4c0594/d1aee2de5b5642dca71fccf3eab93c03/FLAG6b26fa681 [2020-07-08 15:54:31,911 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:54:31,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1250.c [2020-07-08 15:54:31,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc4c0594/d1aee2de5b5642dca71fccf3eab93c03/FLAG6b26fa681 [2020-07-08 15:54:32,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc4c0594/d1aee2de5b5642dca71fccf3eab93c03 [2020-07-08 15:54:32,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:54:32,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:54:32,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:32,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:54:32,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:54:32,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cdcd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32, skipping insertion in model container [2020-07-08 15:54:32,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:54:32,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:54:32,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:32,569 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:54:32,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:32,623 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:54:32,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32 WrapperNode [2020-07-08 15:54:32,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:32,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:54:32,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:54:32,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:54:32,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (1/1) ... [2020-07-08 15:54:32,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:54:32,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:54:32,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:54:32,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:54:32,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (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-08 15:54:32,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:54:32,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:54:32,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-08 15:54:32,824 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-08 15:54:32,824 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-08 15:54:32,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:54:32,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:54:32,824 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-08 15:54:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 15:54:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 15:54:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 15:54:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 15:54:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-08 15:54:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-08 15:54:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:54:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:54:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:54:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 15:54:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 15:54:33,324 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:54:33,325 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 15:54:33,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:33 BoogieIcfgContainer [2020-07-08 15:54:33,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:54:33,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:54:33,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:54:33,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:54:33,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:54:32" (1/3) ... [2020-07-08 15:54:33,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5b4336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:33, skipping insertion in model container [2020-07-08 15:54:33,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:32" (2/3) ... [2020-07-08 15:54:33,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5b4336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:33, skipping insertion in model container [2020-07-08 15:54:33,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:33" (3/3) ... [2020-07-08 15:54:33,338 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2020-07-08 15:54:33,350 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:54:33,359 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:54:33,374 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:54:33,398 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:54:33,398 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:54:33,399 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:54:33,399 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:54:33,399 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:54:33,399 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:54:33,399 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:54:33,400 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:54:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-07-08 15:54:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 15:54:33,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:33,433 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-08 15:54:33,433 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:33,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1283430724, now seen corresponding path program 1 times [2020-07-08 15:54:33,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:33,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980961432] [2020-07-08 15:54:33,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:33,674 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-08 15:54:33,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-08 15:54:33,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-08 15:54:33,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-08 15:54:33,677 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-08 15:54:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:33,729 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-08 15:54:33,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-08 15:54:33,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-08 15:54:33,731 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-08 15:54:33,732 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-08 15:54:33,732 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-08 15:54:33,733 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-08 15:54:33,734 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-08 15:54:33,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-08 15:54:33,737 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-08 15:54:33,737 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-08 15:54:33,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-08 15:54:33,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-08 15:54:33,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-08 15:54:33,740 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-08 15:54:33,741 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-08 15:54:33,741 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-08 15:54:33,742 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-08 15:54:33,742 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-08 15:54:33,742 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-08 15:54:33,743 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-08 15:54:33,743 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-08 15:54:33,744 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-08 15:54:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:33,757 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-08 15:54:33,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-08 15:54:33,758 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-08 15:54:33,759 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-08 15:54:33,761 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-08 15:54:33,761 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-08 15:54:33,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-08 15:54:33,762 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-08 15:54:33,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-08 15:54:33,763 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-08 15:54:33,763 INFO L263 TraceCheckUtils]: 6: Hoare triple {76#true} call #t~ret7 := main(); {76#true} is VALID [2020-07-08 15:54:33,764 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-08 15:54:33,764 INFO L280 TraceCheckUtils]: 8: Hoare triple {76#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-08 15:54:33,766 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-08 15:54:33,767 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-08 15:54:33,767 INFO L280 TraceCheckUtils]: 11: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-08 15:54:33,769 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-08 15:54:33,770 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-08 15:54:33,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-08 15:54:33,771 INFO L280 TraceCheckUtils]: 15: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-08 15:54:33,772 INFO L280 TraceCheckUtils]: 16: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-08 15:54:33,772 INFO L280 TraceCheckUtils]: 17: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-08 15:54:33,773 INFO L280 TraceCheckUtils]: 18: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-08 15:54:33,773 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-08 15:54:33,773 INFO L280 TraceCheckUtils]: 20: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-08 15:54:33,774 INFO L280 TraceCheckUtils]: 21: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-08 15:54:33,774 INFO L280 TraceCheckUtils]: 22: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-08 15:54:33,774 INFO L280 TraceCheckUtils]: 23: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-08 15:54:33,775 INFO L280 TraceCheckUtils]: 24: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-08 15:54:33,775 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-08 15:54:33,775 INFO L280 TraceCheckUtils]: 26: Hoare triple {77#false} ~res~0 := #t~ret5; {77#false} is VALID [2020-07-08 15:54:33,776 INFO L280 TraceCheckUtils]: 27: Hoare triple {77#false} havoc #t~ret5; {77#false} is VALID [2020-07-08 15:54:33,776 INFO L263 TraceCheckUtils]: 28: Hoare triple {77#false} call #t~ret6 := isnan_float(~res~0); {76#true} is VALID [2020-07-08 15:54:33,776 INFO L280 TraceCheckUtils]: 29: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-08 15:54:33,777 INFO L280 TraceCheckUtils]: 30: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-08 15:54:33,777 INFO L280 TraceCheckUtils]: 31: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-08 15:54:33,778 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-08 15:54:33,778 INFO L280 TraceCheckUtils]: 33: Hoare triple {77#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {77#false} is VALID [2020-07-08 15:54:33,778 INFO L280 TraceCheckUtils]: 34: Hoare triple {77#false} assume 0 == #t~ret6; {77#false} is VALID [2020-07-08 15:54:33,779 INFO L280 TraceCheckUtils]: 35: Hoare triple {77#false} havoc #t~ret6; {77#false} is VALID [2020-07-08 15:54:33,779 INFO L280 TraceCheckUtils]: 36: Hoare triple {77#false} assume !false; {77#false} is VALID [2020-07-08 15:54:33,784 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-08 15:54:33,785 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:33,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980961432] [2020-07-08 15:54:33,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:33,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 15:54:33,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419026100] [2020-07-08 15:54:33,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-08 15:54:33,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:33,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 15:54:33,880 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-08 15:54:33,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 15:54:33,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 15:54:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 15:54:33,895 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2020-07-08 15:54:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:34,488 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-07-08 15:54:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 15:54:34,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-08 15:54:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:54:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-08 15:54:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:54:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-08 15:54:34,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2020-07-08 15:54:34,723 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-08 15:54:34,739 INFO L225 Difference]: With dead ends: 132 [2020-07-08 15:54:34,740 INFO L226 Difference]: Without dead ends: 66 [2020-07-08 15:54:34,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:54:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-08 15:54:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-08 15:54:34,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:34,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-08 15:54:34,870 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-08 15:54:34,871 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-08 15:54:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:34,879 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-08 15:54:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-08 15:54:34,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:34,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:34,882 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-08 15:54:34,882 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-08 15:54:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:34,890 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-08 15:54:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-08 15:54:34,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:34,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:34,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:34,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-08 15:54:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2020-07-08 15:54:34,900 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 37 [2020-07-08 15:54:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:34,901 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2020-07-08 15:54:34,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 15:54:34,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 73 transitions. [2020-07-08 15:54:35,007 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-08 15:54:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-08 15:54:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 15:54:35,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:35,010 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-08 15:54:35,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:54:35,011 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash -611644563, now seen corresponding path program 1 times [2020-07-08 15:54:35,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:35,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [458302217] [2020-07-08 15:54:35,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:35,139 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-08 15:54:35,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-08 15:54:35,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-08 15:54:35,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-08 15:54:35,141 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-08 15:54:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:35,287 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-08 15:54:35,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-08 15:54:35,288 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-08 15:54:35,289 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-08 15:54:35,289 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-08 15:54:35,289 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-08 15:54:35,290 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-08 15:54:35,290 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-08 15:54:35,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-08 15:54:35,291 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-08 15:54:35,291 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-08 15:54:35,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-08 15:54:35,292 INFO L280 TraceCheckUtils]: 12: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-08 15:54:35,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:35,294 INFO L280 TraceCheckUtils]: 14: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:35,295 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-08 15:54:35,296 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-08 15:54:35,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-08 15:54:35,297 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-08 15:54:35,298 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-08 15:54:35,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-08 15:54:35,298 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-08 15:54:35,299 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-08 15:54:35,299 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-08 15:54:35,299 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-08 15:54:35,300 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-08 15:54:35,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-08 15:54:35,300 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-08 15:54:35,301 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-08 15:54:35,301 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-08 15:54:35,301 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-08 15:54:35,302 INFO L280 TraceCheckUtils]: 15: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-08 15:54:35,303 INFO L280 TraceCheckUtils]: 16: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:35,304 INFO L280 TraceCheckUtils]: 17: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:35,305 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-08 15:54:35,307 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-08 15:54:35,308 INFO L280 TraceCheckUtils]: 20: Hoare triple {699#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-08 15:54:35,309 INFO L280 TraceCheckUtils]: 21: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-08 15:54:35,309 INFO L280 TraceCheckUtils]: 22: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-08 15:54:35,310 INFO L280 TraceCheckUtils]: 23: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-08 15:54:35,310 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-08 15:54:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:35,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-08 15:54:35,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-08 15:54:35,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-08 15:54:35,318 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-08 15:54:35,319 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-08 15:54:35,320 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-08 15:54:35,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-08 15:54:35,320 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-08 15:54:35,321 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-08 15:54:35,321 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-08 15:54:35,321 INFO L263 TraceCheckUtils]: 6: Hoare triple {645#true} call #t~ret7 := main(); {645#true} is VALID [2020-07-08 15:54:35,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-08 15:54:35,322 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-08 15:54:35,323 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-08 15:54:35,324 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-08 15:54:35,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-08 15:54:35,325 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-08 15:54:35,326 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-08 15:54:35,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-08 15:54:35,326 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-08 15:54:35,327 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-08 15:54:35,327 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-08 15:54:35,327 INFO L280 TraceCheckUtils]: 18: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-08 15:54:35,328 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-08 15:54:35,328 INFO L280 TraceCheckUtils]: 20: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-08 15:54:35,328 INFO L280 TraceCheckUtils]: 21: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-08 15:54:35,329 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-08 15:54:35,329 INFO L280 TraceCheckUtils]: 23: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-08 15:54:35,329 INFO L280 TraceCheckUtils]: 24: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-08 15:54:35,329 INFO L280 TraceCheckUtils]: 25: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-08 15:54:35,330 INFO L280 TraceCheckUtils]: 26: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:35,332 INFO L280 TraceCheckUtils]: 27: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:35,334 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-08 15:54:35,336 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-08 15:54:35,339 INFO L280 TraceCheckUtils]: 30: Hoare triple {699#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-08 15:54:35,339 INFO L280 TraceCheckUtils]: 31: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-08 15:54:35,339 INFO L280 TraceCheckUtils]: 32: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-08 15:54:35,340 INFO L280 TraceCheckUtils]: 33: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-08 15:54:35,340 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-08 15:54:35,340 INFO L280 TraceCheckUtils]: 35: Hoare triple {646#false} ~res~0 := #t~ret5; {646#false} is VALID [2020-07-08 15:54:35,341 INFO L280 TraceCheckUtils]: 36: Hoare triple {646#false} havoc #t~ret5; {646#false} is VALID [2020-07-08 15:54:35,341 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#false} call #t~ret6 := isnan_float(~res~0); {645#true} is VALID [2020-07-08 15:54:35,341 INFO L280 TraceCheckUtils]: 38: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-08 15:54:35,342 INFO L280 TraceCheckUtils]: 39: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-08 15:54:35,342 INFO L280 TraceCheckUtils]: 40: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-08 15:54:35,342 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-08 15:54:35,342 INFO L280 TraceCheckUtils]: 42: Hoare triple {646#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {646#false} is VALID [2020-07-08 15:54:35,343 INFO L280 TraceCheckUtils]: 43: Hoare triple {646#false} assume 0 == #t~ret6; {646#false} is VALID [2020-07-08 15:54:35,343 INFO L280 TraceCheckUtils]: 44: Hoare triple {646#false} havoc #t~ret6; {646#false} is VALID [2020-07-08 15:54:35,343 INFO L280 TraceCheckUtils]: 45: Hoare triple {646#false} assume !false; {646#false} is VALID [2020-07-08 15:54:35,347 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-08 15:54:35,347 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:35,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [458302217] [2020-07-08 15:54:35,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:35,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 15:54:35,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515811672] [2020-07-08 15:54:35,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-08 15:54:35,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:35,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 15:54:35,399 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-08 15:54:35,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 15:54:35,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 15:54:35,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:54:35,400 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2020-07-08 15:54:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:35,968 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-08 15:54:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:54:35,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-08 15:54:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:54:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 15:54:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:54:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 15:54:35,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-08 15:54:36,104 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-08 15:54:36,109 INFO L225 Difference]: With dead ends: 87 [2020-07-08 15:54:36,109 INFO L226 Difference]: Without dead ends: 71 [2020-07-08 15:54:36,111 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-08 15:54:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-08 15:54:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2020-07-08 15:54:36,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:36,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2020-07-08 15:54:36,192 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2020-07-08 15:54:36,192 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2020-07-08 15:54:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:36,199 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-08 15:54:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-08 15:54:36,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:36,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:36,203 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2020-07-08 15:54:36,203 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2020-07-08 15:54:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:36,212 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-08 15:54:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-08 15:54:36,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:36,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:36,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:36,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-08 15:54:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-08 15:54:36,227 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 46 [2020-07-08 15:54:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:36,227 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-08 15:54:36,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 15:54:36,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-08 15:54:36,332 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-08 15:54:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-08 15:54:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 15:54:36,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:36,335 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-08 15:54:36,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:54:36,335 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1210069817, now seen corresponding path program 1 times [2020-07-08 15:54:36,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:36,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1008516304] [2020-07-08 15:54:36,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:36,438 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-08 15:54:36,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-08 15:54:36,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-08 15:54:36,439 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 15:54:36,439 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-08 15:54:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:36,560 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-08 15:54:36,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-08 15:54:36,561 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-08 15:54:36,561 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-08 15:54:36,562 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-08 15:54:36,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-08 15:54:36,562 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-08 15:54:36,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-08 15:54:36,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-08 15:54:36,563 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-08 15:54:36,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-08 15:54:36,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-08 15:54:36,564 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-08 15:54:36,564 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-08 15:54:36,564 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-08 15:54:36,565 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-08 15:54:36,566 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:36,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:36,567 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-08 15:54:36,568 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-08 15:54:36,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-08 15:54:36,570 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-08 15:54:36,570 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-08 15:54:36,570 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-08 15:54:36,570 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-08 15:54:36,571 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-08 15:54:36,571 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-08 15:54:36,571 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-08 15:54:36,572 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-08 15:54:36,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-08 15:54:36,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-08 15:54:36,572 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-08 15:54:36,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-08 15:54:36,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-08 15:54:36,573 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-08 15:54:36,574 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-08 15:54:36,574 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-08 15:54:36,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-08 15:54:36,575 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:36,576 INFO L280 TraceCheckUtils]: 20: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:36,577 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-08 15:54:36,577 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-08 15:54:36,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {1222#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-08 15:54:36,578 INFO L280 TraceCheckUtils]: 24: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-08 15:54:36,579 INFO L280 TraceCheckUtils]: 25: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-08 15:54:36,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-08 15:54:36,579 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-08 15:54:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:36,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-08 15:54:36,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-08 15:54:36,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 15:54:36,586 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-08 15:54:36,587 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-08 15:54:36,588 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-08 15:54:36,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-08 15:54:36,588 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-08 15:54:36,588 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 15:54:36,589 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-08 15:54:36,589 INFO L263 TraceCheckUtils]: 6: Hoare triple {1162#true} call #t~ret7 := main(); {1162#true} is VALID [2020-07-08 15:54:36,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-08 15:54:36,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-08 15:54:36,590 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-08 15:54:36,591 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-08 15:54:36,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-08 15:54:36,592 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-08 15:54:36,593 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-08 15:54:36,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-08 15:54:36,593 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-08 15:54:36,593 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-08 15:54:36,593 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-08 15:54:36,594 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-08 15:54:36,594 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-08 15:54:36,594 INFO L280 TraceCheckUtils]: 20: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-08 15:54:36,594 INFO L280 TraceCheckUtils]: 21: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-08 15:54:36,595 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-08 15:54:36,595 INFO L280 TraceCheckUtils]: 23: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-08 15:54:36,595 INFO L280 TraceCheckUtils]: 24: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-08 15:54:36,595 INFO L280 TraceCheckUtils]: 25: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-08 15:54:36,596 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-08 15:54:36,596 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-08 15:54:36,596 INFO L280 TraceCheckUtils]: 28: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-08 15:54:36,597 INFO L280 TraceCheckUtils]: 29: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:36,598 INFO L280 TraceCheckUtils]: 30: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 15:54:36,599 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-08 15:54:36,609 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-08 15:54:36,618 INFO L280 TraceCheckUtils]: 33: Hoare triple {1222#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-08 15:54:36,618 INFO L280 TraceCheckUtils]: 34: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-08 15:54:36,618 INFO L280 TraceCheckUtils]: 35: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-08 15:54:36,619 INFO L280 TraceCheckUtils]: 36: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-08 15:54:36,619 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-08 15:54:36,619 INFO L280 TraceCheckUtils]: 38: Hoare triple {1163#false} ~res~0 := #t~ret5; {1163#false} is VALID [2020-07-08 15:54:36,622 INFO L280 TraceCheckUtils]: 39: Hoare triple {1163#false} havoc #t~ret5; {1163#false} is VALID [2020-07-08 15:54:36,623 INFO L263 TraceCheckUtils]: 40: Hoare triple {1163#false} call #t~ret6 := isnan_float(~res~0); {1162#true} is VALID [2020-07-08 15:54:36,623 INFO L280 TraceCheckUtils]: 41: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-08 15:54:36,623 INFO L280 TraceCheckUtils]: 42: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-08 15:54:36,624 INFO L280 TraceCheckUtils]: 43: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 15:54:36,624 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-08 15:54:36,624 INFO L280 TraceCheckUtils]: 45: Hoare triple {1163#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1163#false} is VALID [2020-07-08 15:54:36,624 INFO L280 TraceCheckUtils]: 46: Hoare triple {1163#false} assume 0 == #t~ret6; {1163#false} is VALID [2020-07-08 15:54:36,624 INFO L280 TraceCheckUtils]: 47: Hoare triple {1163#false} havoc #t~ret6; {1163#false} is VALID [2020-07-08 15:54:36,625 INFO L280 TraceCheckUtils]: 48: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2020-07-08 15:54:36,629 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-08 15:54:36,629 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:36,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1008516304] [2020-07-08 15:54:36,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:36,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 15:54:36,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214627455] [2020-07-08 15:54:36,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-08 15:54:36,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:36,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 15:54:36,684 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-08 15:54:36,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 15:54:36,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:36,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 15:54:36,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:54:36,686 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 6 states. [2020-07-08 15:54:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:37,263 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-07-08 15:54:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:54:37,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-08 15:54:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:54:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 15:54:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:54:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 15:54:37,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-08 15:54:37,391 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-08 15:54:37,394 INFO L225 Difference]: With dead ends: 91 [2020-07-08 15:54:37,395 INFO L226 Difference]: Without dead ends: 75 [2020-07-08 15:54:37,395 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-08 15:54:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-08 15:54:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2020-07-08 15:54:37,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:37,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 70 states. [2020-07-08 15:54:37,474 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 70 states. [2020-07-08 15:54:37,474 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 70 states. [2020-07-08 15:54:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:37,480 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-08 15:54:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-08 15:54:37,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:37,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:37,481 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 75 states. [2020-07-08 15:54:37,481 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 75 states. [2020-07-08 15:54:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:37,485 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-08 15:54:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-08 15:54:37,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:37,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:37,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:37,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-08 15:54:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-08 15:54:37,490 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 49 [2020-07-08 15:54:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:37,491 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-08 15:54:37,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 15:54:37,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-08 15:54:37,594 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-08 15:54:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-08 15:54:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 15:54:37,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:37,595 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-08 15:54:37,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:54:37,596 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash 815123193, now seen corresponding path program 1 times [2020-07-08 15:54:37,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:37,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91859044] [2020-07-08 15:54:37,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 15:54:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 15:54:37,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 15:54:37,885 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1145) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1014) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 15:54:37,896 INFO L168 Benchmark]: Toolchain (without parser) took 5580.01 ms. Allocated memory was 143.1 MB in the beginning and 273.7 MB in the end (delta: 130.5 MB). Free memory was 102.1 MB in the beginning and 97.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 135.5 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:37,897 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 143.1 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 15:54:37,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.00 ms. Allocated memory is still 143.1 MB. Free memory was 101.9 MB in the beginning and 90.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:37,905 INFO L168 Benchmark]: Boogie Preprocessor took 134.25 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 90.8 MB in the beginning and 180.4 MB in the end (delta: -89.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:37,906 INFO L168 Benchmark]: RCFGBuilder took 570.97 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 147.5 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:37,912 INFO L168 Benchmark]: TraceAbstraction took 4560.67 ms. Allocated memory was 202.9 MB in the beginning and 273.7 MB in the end (delta: 70.8 MB). Free memory was 147.5 MB in the beginning and 97.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:37,920 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.19 ms. Allocated memory is still 143.1 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.00 ms. Allocated memory is still 143.1 MB. Free memory was 101.9 MB in the beginning and 90.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.25 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 90.8 MB in the beginning and 180.4 MB in the end (delta: -89.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 570.97 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 147.5 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4560.67 ms. Allocated memory was 202.9 MB in the beginning and 273.7 MB in the end (delta: 70.8 MB). Free memory was 147.5 MB in the beginning and 97.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...