/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_1230.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:35:43,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:35:43,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:35:43,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:35:43,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:35:43,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:35:43,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:35:43,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:35:43,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:35:43,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:35:43,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:35:43,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:35:43,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:35:43,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:35:43,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:35:43,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:35:43,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:35:43,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:35:43,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:35:43,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:35:43,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:35:43,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:35:43,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:35:43,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:35:43,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:35:43,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:35:43,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:35:43,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:35:43,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:35:43,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:35:43,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:35:43,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:35:43,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:35:43,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:35:43,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:35:43,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:35:43,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:35:43,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:35:43,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:35:43,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:35:43,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:35:43,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:35:43,219 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:35:43,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:35:43,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:35:43,223 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:35:43,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:35:43,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:35:43,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:35:43,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:35:43,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:35:43,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:35:43,228 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:35:43,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:35:43,228 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:35:43,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:35:43,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:35:43,229 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:35:43,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:35:43,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:35:43,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:43,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:35:43,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:35:43,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:35:43,230 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:35:43,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:35:43,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:35:43,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:35:43,543 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:35:43,543 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:35:43,544 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1230.c [2020-07-10 18:35:43,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96152399/f69c2e6f9dd943c2b31794ad8739e460/FLAGfac375605 [2020-07-10 18:35:44,073 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:35:44,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1230.c [2020-07-10 18:35:44,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96152399/f69c2e6f9dd943c2b31794ad8739e460/FLAGfac375605 [2020-07-10 18:35:44,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96152399/f69c2e6f9dd943c2b31794ad8739e460 [2020-07-10 18:35:44,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:35:44,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:35:44,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:44,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:35:44,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:35:44,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76c2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44, skipping insertion in model container [2020-07-10 18:35:44,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:35:44,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:35:44,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:44,724 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:35:44,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:44,799 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:35:44,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44 WrapperNode [2020-07-10 18:35:44,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:44,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:35:44,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:35:44,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:35:44,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... [2020-07-10 18:35:44,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:35:44,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:35:44,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:35:44,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:35:44,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:35:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:35:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-10 18:35:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-10 18:35:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-10 18:35:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-10 18:35:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-10 18:35:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:35:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:35:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:35:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 18:35:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:35:45,589 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:35:45,590 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 18:35:45,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:45 BoogieIcfgContainer [2020-07-10 18:35:45,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:35:45,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:35:45,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:35:45,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:35:45,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:35:44" (1/3) ... [2020-07-10 18:35:45,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc13451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:45, skipping insertion in model container [2020-07-10 18:35:45,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:44" (2/3) ... [2020-07-10 18:35:45,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc13451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:45, skipping insertion in model container [2020-07-10 18:35:45,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:45" (3/3) ... [2020-07-10 18:35:45,603 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2020-07-10 18:35:45,613 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:35:45,620 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:35:45,631 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:35:45,651 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:35:45,652 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:35:45,652 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:35:45,652 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:35:45,652 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:35:45,652 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:35:45,653 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:35:45,653 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:35:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-07-10 18:35:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 18:35:45,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:45,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:45,678 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash 337584138, now seen corresponding path program 1 times [2020-07-10 18:35:45,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:45,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538364929] [2020-07-10 18:35:45,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:45,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {76#true} is VALID [2020-07-10 18:35:45,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-10 18:35:45,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-10 18:35:45,904 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:45,905 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-10 18:35:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:46,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:46,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-10 18:35:46,005 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-10 18:35:46,006 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-10 18:35:46,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-10 18:35:46,006 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:46,007 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-10 18:35:46,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:46,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-10 18:35:46,013 INFO L263 TraceCheckUtils]: 2: Hoare triple {76#true} call #t~ret2 := __fpclassify_float(~x); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:46,013 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:46,014 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-10 18:35:46,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-10 18:35:46,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-10 18:35:46,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-10 18:35:46,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:46,017 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-10 18:35:46,017 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-10 18:35:46,017 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-10 18:35:46,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-10 18:35:46,018 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-10 18:35:46,019 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:46,019 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-10 18:35:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:46,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:46,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-10 18:35:46,054 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:46,056 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-10 18:35:46,058 INFO L263 TraceCheckUtils]: 0: Hoare triple {76#true} call ULTIMATE.init(); {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:46,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {76#true} is VALID [2020-07-10 18:35:46,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-10 18:35:46,059 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-10 18:35:46,060 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:46,060 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-10 18:35:46,060 INFO L263 TraceCheckUtils]: 6: Hoare triple {76#true} call #t~ret7 := main(); {76#true} is VALID [2020-07-10 18:35:46,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-10 18:35:46,061 INFO L280 TraceCheckUtils]: 8: Hoare triple {76#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-10 18:35:46,064 INFO L263 TraceCheckUtils]: 9: Hoare triple {76#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:46,064 INFO L280 TraceCheckUtils]: 10: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:46,065 INFO L280 TraceCheckUtils]: 11: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-10 18:35:46,067 INFO L263 TraceCheckUtils]: 12: Hoare triple {76#true} call #t~ret2 := __fpclassify_float(~x); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:46,067 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:46,068 INFO L280 TraceCheckUtils]: 14: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-10 18:35:46,069 INFO L280 TraceCheckUtils]: 15: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-10 18:35:46,069 INFO L280 TraceCheckUtils]: 16: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-10 18:35:46,069 INFO L280 TraceCheckUtils]: 17: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-10 18:35:46,070 INFO L280 TraceCheckUtils]: 18: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:46,070 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-10 18:35:46,073 INFO L280 TraceCheckUtils]: 20: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-10 18:35:46,073 INFO L280 TraceCheckUtils]: 21: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-10 18:35:46,073 INFO L280 TraceCheckUtils]: 22: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-10 18:35:46,074 INFO L280 TraceCheckUtils]: 23: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-10 18:35:46,074 INFO L280 TraceCheckUtils]: 24: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-10 18:35:46,074 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-10 18:35:46,075 INFO L280 TraceCheckUtils]: 26: Hoare triple {77#false} ~res~0 := #t~ret5; {77#false} is VALID [2020-07-10 18:35:46,075 INFO L280 TraceCheckUtils]: 27: Hoare triple {77#false} havoc #t~ret5; {77#false} is VALID [2020-07-10 18:35:46,077 INFO L263 TraceCheckUtils]: 28: Hoare triple {77#false} call #t~ret6 := isnan_float(~res~0); {76#true} is VALID [2020-07-10 18:35:46,078 INFO L280 TraceCheckUtils]: 29: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-10 18:35:46,078 INFO L280 TraceCheckUtils]: 30: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-10 18:35:46,080 INFO L280 TraceCheckUtils]: 31: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-10 18:35:46,081 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-10 18:35:46,081 INFO L280 TraceCheckUtils]: 33: Hoare triple {77#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {77#false} is VALID [2020-07-10 18:35:46,081 INFO L280 TraceCheckUtils]: 34: Hoare triple {77#false} assume 0 == #t~ret6; {77#false} is VALID [2020-07-10 18:35:46,082 INFO L280 TraceCheckUtils]: 35: Hoare triple {77#false} havoc #t~ret6; {77#false} is VALID [2020-07-10 18:35:46,082 INFO L280 TraceCheckUtils]: 36: Hoare triple {77#false} assume !false; {77#false} is VALID [2020-07-10 18:35:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:35:46,087 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:46,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538364929] [2020-07-10 18:35:46,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:46,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 18:35:46,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771521087] [2020-07-10 18:35:46,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-10 18:35:46,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:46,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 18:35:46,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:46,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 18:35:46,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 18:35:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 18:35:46,202 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2020-07-10 18:35:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:46,754 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-07-10 18:35:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 18:35:46,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-10 18:35:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-10 18:35:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-10 18:35:46,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2020-07-10 18:35:46,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:46,994 INFO L225 Difference]: With dead ends: 132 [2020-07-10 18:35:46,994 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 18:35:46,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:35:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 18:35:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-10 18:35:47,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:47,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:47,104 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:47,104 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:47,112 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-10 18:35:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 18:35:47,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:47,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:47,115 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:47,115 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 18:35:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:47,122 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-10 18:35:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 18:35:47,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:47,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:47,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:47,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 18:35:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2020-07-10 18:35:47,131 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 37 [2020-07-10 18:35:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:47,132 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2020-07-10 18:35:47,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 18:35:47,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 73 transitions. [2020-07-10 18:35:47,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 18:35:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 18:35:47,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:47,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:47,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:35:47,248 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash -356550436, now seen corresponding path program 1 times [2020-07-10 18:35:47,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:47,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1743971413] [2020-07-10 18:35:47,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:47,358 INFO L280 TraceCheckUtils]: 0: Hoare triple {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {645#true} is VALID [2020-07-10 18:35:47,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-10 18:35:47,359 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-10 18:35:47,359 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:47,359 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-10 18:35:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:47,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:47,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-10 18:35:47,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {645#true} is VALID [2020-07-10 18:35:47,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {645#true} is VALID [2020-07-10 18:35:47,475 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: L16 {645#true} is VALID [2020-07-10 18:35:47,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-10 18:35:47,476 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: L17-1 {645#true} is VALID [2020-07-10 18:35:47,476 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-10 18:35:47,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-10 18:35:47,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {645#true} is VALID [2020-07-10 18:35:47,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-10 18:35:47,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-10 18:35:47,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-10 18:35:47,479 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:47,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:47,480 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:47,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:47,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-10 18:35:47,483 INFO L263 TraceCheckUtils]: 2: Hoare triple {645#true} call #t~ret2 := __fpclassify_float(~x); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:47,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:47,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-10 18:35:47,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {645#true} is VALID [2020-07-10 18:35:47,484 INFO L280 TraceCheckUtils]: 6: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {645#true} is VALID [2020-07-10 18:35:47,484 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: L16 {645#true} is VALID [2020-07-10 18:35:47,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-10 18:35:47,485 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: L17-1 {645#true} is VALID [2020-07-10 18:35:47,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-10 18:35:47,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-10 18:35:47,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {645#true} is VALID [2020-07-10 18:35:47,486 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-10 18:35:47,487 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-10 18:35:47,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-10 18:35:47,488 INFO L280 TraceCheckUtils]: 16: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:47,488 INFO L280 TraceCheckUtils]: 17: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:47,490 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:47,490 INFO L280 TraceCheckUtils]: 19: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:47,491 INFO L280 TraceCheckUtils]: 20: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-10 18:35:47,491 INFO L280 TraceCheckUtils]: 21: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-10 18:35:47,492 INFO L280 TraceCheckUtils]: 22: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-10 18:35:47,492 INFO L280 TraceCheckUtils]: 23: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-10 18:35:47,492 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-10 18:35:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:47,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:47,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-10 18:35:47,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:47,500 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-10 18:35:47,501 INFO L263 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:47,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {645#true} is VALID [2020-07-10 18:35:47,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-10 18:35:47,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-10 18:35:47,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:47,502 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-10 18:35:47,502 INFO L263 TraceCheckUtils]: 6: Hoare triple {645#true} call #t~ret7 := main(); {645#true} is VALID [2020-07-10 18:35:47,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-10 18:35:47,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-10 18:35:47,504 INFO L263 TraceCheckUtils]: 9: Hoare triple {645#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:47,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:47,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-10 18:35:47,506 INFO L263 TraceCheckUtils]: 12: Hoare triple {645#true} call #t~ret2 := __fpclassify_float(~x); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:47,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:47,507 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-10 18:35:47,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {645#true} is VALID [2020-07-10 18:35:47,507 INFO L280 TraceCheckUtils]: 16: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {645#true} is VALID [2020-07-10 18:35:47,508 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: L16 {645#true} is VALID [2020-07-10 18:35:47,508 INFO L280 TraceCheckUtils]: 18: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-10 18:35:47,508 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: L17-1 {645#true} is VALID [2020-07-10 18:35:47,509 INFO L280 TraceCheckUtils]: 20: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-10 18:35:47,509 INFO L280 TraceCheckUtils]: 21: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-10 18:35:47,509 INFO L280 TraceCheckUtils]: 22: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {645#true} is VALID [2020-07-10 18:35:47,509 INFO L280 TraceCheckUtils]: 23: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-10 18:35:47,510 INFO L280 TraceCheckUtils]: 24: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-10 18:35:47,510 INFO L280 TraceCheckUtils]: 25: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-10 18:35:47,511 INFO L280 TraceCheckUtils]: 26: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:47,512 INFO L280 TraceCheckUtils]: 27: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:47,513 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:47,514 INFO L280 TraceCheckUtils]: 29: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:47,514 INFO L280 TraceCheckUtils]: 30: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-10 18:35:47,515 INFO L280 TraceCheckUtils]: 31: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-10 18:35:47,515 INFO L280 TraceCheckUtils]: 32: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-10 18:35:47,515 INFO L280 TraceCheckUtils]: 33: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-10 18:35:47,515 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-10 18:35:47,516 INFO L280 TraceCheckUtils]: 35: Hoare triple {646#false} ~res~0 := #t~ret5; {646#false} is VALID [2020-07-10 18:35:47,516 INFO L280 TraceCheckUtils]: 36: Hoare triple {646#false} havoc #t~ret5; {646#false} is VALID [2020-07-10 18:35:47,516 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#false} call #t~ret6 := isnan_float(~res~0); {645#true} is VALID [2020-07-10 18:35:47,517 INFO L280 TraceCheckUtils]: 38: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-10 18:35:47,517 INFO L280 TraceCheckUtils]: 39: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-10 18:35:47,517 INFO L280 TraceCheckUtils]: 40: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-10 18:35:47,518 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-10 18:35:47,518 INFO L280 TraceCheckUtils]: 42: Hoare triple {646#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {646#false} is VALID [2020-07-10 18:35:47,518 INFO L280 TraceCheckUtils]: 43: Hoare triple {646#false} assume 0 == #t~ret6; {646#false} is VALID [2020-07-10 18:35:47,518 INFO L280 TraceCheckUtils]: 44: Hoare triple {646#false} havoc #t~ret6; {646#false} is VALID [2020-07-10 18:35:47,519 INFO L280 TraceCheckUtils]: 45: Hoare triple {646#false} assume !false; {646#false} is VALID [2020-07-10 18:35:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:35:47,522 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:47,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1743971413] [2020-07-10 18:35:47,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:47,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:47,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816086435] [2020-07-10 18:35:47,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-10 18:35:47,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:47,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:47,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:47,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:47,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:47,576 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2020-07-10 18:35:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:48,132 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 18:35:48,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:48,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-10 18:35:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:48,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-10 18:35:48,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:48,248 INFO L225 Difference]: With dead ends: 87 [2020-07-10 18:35:48,249 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 18:35:48,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:35:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 18:35:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2020-07-10 18:35:48,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:48,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2020-07-10 18:35:48,307 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2020-07-10 18:35:48,307 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2020-07-10 18:35:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:48,312 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-10 18:35:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-10 18:35:48,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:48,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:48,314 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2020-07-10 18:35:48,314 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2020-07-10 18:35:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:48,319 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-10 18:35:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-10 18:35:48,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:48,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:48,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:48,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 18:35:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-10 18:35:48,325 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 46 [2020-07-10 18:35:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:48,325 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-10 18:35:48,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:48,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-10 18:35:48,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-10 18:35:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 18:35:48,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:48,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:48,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:35:48,433 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash -192516793, now seen corresponding path program 1 times [2020-07-10 18:35:48,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:48,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227501998] [2020-07-10 18:35:48,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1162#true} is VALID [2020-07-10 18:35:48,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-10 18:35:48,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-10 18:35:48,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:48,538 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-10 18:35:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:48,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-10 18:35:48,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {1162#true} is VALID [2020-07-10 18:35:48,633 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {1162#true} is VALID [2020-07-10 18:35:48,634 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: L16 {1162#true} is VALID [2020-07-10 18:35:48,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-10 18:35:48,634 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: L17-1 {1162#true} is VALID [2020-07-10 18:35:48,634 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-10 18:35:48,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-10 18:35:48,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {1162#true} is VALID [2020-07-10 18:35:48,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-10 18:35:48,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-10 18:35:48,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-10 18:35:48,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-10 18:35:48,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-10 18:35:48,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-10 18:35:48,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:48,638 INFO L280 TraceCheckUtils]: 17: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:48,639 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:48,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:48,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-10 18:35:48,641 INFO L263 TraceCheckUtils]: 2: Hoare triple {1162#true} call #t~ret2 := __fpclassify_float(~x); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:48,642 INFO L280 TraceCheckUtils]: 3: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:48,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-10 18:35:48,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {1162#true} is VALID [2020-07-10 18:35:48,642 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {1162#true} is VALID [2020-07-10 18:35:48,643 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: L16 {1162#true} is VALID [2020-07-10 18:35:48,643 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-10 18:35:48,643 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: L17-1 {1162#true} is VALID [2020-07-10 18:35:48,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-10 18:35:48,644 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-10 18:35:48,644 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {1162#true} is VALID [2020-07-10 18:35:48,644 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-10 18:35:48,645 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-10 18:35:48,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-10 18:35:48,645 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-10 18:35:48,646 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-10 18:35:48,646 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-10 18:35:48,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:48,647 INFO L280 TraceCheckUtils]: 20: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:48,648 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:48,649 INFO L280 TraceCheckUtils]: 22: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:48,650 INFO L280 TraceCheckUtils]: 23: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-10 18:35:48,650 INFO L280 TraceCheckUtils]: 24: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-10 18:35:48,650 INFO L280 TraceCheckUtils]: 25: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-10 18:35:48,650 INFO L280 TraceCheckUtils]: 26: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-10 18:35:48,651 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-10 18:35:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:48,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:48,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-10 18:35:48,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:48,657 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-10 18:35:48,658 INFO L263 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:48,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1162#true} is VALID [2020-07-10 18:35:48,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-10 18:35:48,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-10 18:35:48,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:48,659 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-10 18:35:48,660 INFO L263 TraceCheckUtils]: 6: Hoare triple {1162#true} call #t~ret7 := main(); {1162#true} is VALID [2020-07-10 18:35:48,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-10 18:35:48,660 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-10 18:35:48,661 INFO L263 TraceCheckUtils]: 9: Hoare triple {1162#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:48,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:48,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-10 18:35:48,663 INFO L263 TraceCheckUtils]: 12: Hoare triple {1162#true} call #t~ret2 := __fpclassify_float(~x); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:48,663 INFO L280 TraceCheckUtils]: 13: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:48,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-10 18:35:48,664 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {1162#true} is VALID [2020-07-10 18:35:48,664 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {1162#true} is VALID [2020-07-10 18:35:48,664 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: L16 {1162#true} is VALID [2020-07-10 18:35:48,664 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-10 18:35:48,665 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: L17-1 {1162#true} is VALID [2020-07-10 18:35:48,665 INFO L280 TraceCheckUtils]: 20: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-10 18:35:48,665 INFO L280 TraceCheckUtils]: 21: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-10 18:35:48,665 INFO L280 TraceCheckUtils]: 22: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {1162#true} is VALID [2020-07-10 18:35:48,666 INFO L280 TraceCheckUtils]: 23: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-10 18:35:48,666 INFO L280 TraceCheckUtils]: 24: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-10 18:35:48,666 INFO L280 TraceCheckUtils]: 25: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-10 18:35:48,666 INFO L280 TraceCheckUtils]: 26: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-10 18:35:48,667 INFO L280 TraceCheckUtils]: 27: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-10 18:35:48,667 INFO L280 TraceCheckUtils]: 28: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-10 18:35:48,668 INFO L280 TraceCheckUtils]: 29: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:48,668 INFO L280 TraceCheckUtils]: 30: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 18:35:48,669 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:48,670 INFO L280 TraceCheckUtils]: 32: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 18:35:48,671 INFO L280 TraceCheckUtils]: 33: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-10 18:35:48,671 INFO L280 TraceCheckUtils]: 34: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-10 18:35:48,671 INFO L280 TraceCheckUtils]: 35: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-10 18:35:48,671 INFO L280 TraceCheckUtils]: 36: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-10 18:35:48,672 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-10 18:35:48,672 INFO L280 TraceCheckUtils]: 38: Hoare triple {1163#false} ~res~0 := #t~ret5; {1163#false} is VALID [2020-07-10 18:35:48,672 INFO L280 TraceCheckUtils]: 39: Hoare triple {1163#false} havoc #t~ret5; {1163#false} is VALID [2020-07-10 18:35:48,672 INFO L263 TraceCheckUtils]: 40: Hoare triple {1163#false} call #t~ret6 := isnan_float(~res~0); {1162#true} is VALID [2020-07-10 18:35:48,673 INFO L280 TraceCheckUtils]: 41: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-10 18:35:48,673 INFO L280 TraceCheckUtils]: 42: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-10 18:35:48,673 INFO L280 TraceCheckUtils]: 43: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-10 18:35:48,673 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-10 18:35:48,674 INFO L280 TraceCheckUtils]: 45: Hoare triple {1163#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1163#false} is VALID [2020-07-10 18:35:48,674 INFO L280 TraceCheckUtils]: 46: Hoare triple {1163#false} assume 0 == #t~ret6; {1163#false} is VALID [2020-07-10 18:35:48,674 INFO L280 TraceCheckUtils]: 47: Hoare triple {1163#false} havoc #t~ret6; {1163#false} is VALID [2020-07-10 18:35:48,674 INFO L280 TraceCheckUtils]: 48: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2020-07-10 18:35:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:35:48,677 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:48,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227501998] [2020-07-10 18:35:48,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:48,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:48,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589351702] [2020-07-10 18:35:48,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:48,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:48,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:48,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:48,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:48,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:48,735 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 6 states. [2020-07-10 18:35:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:49,261 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-07-10 18:35:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:49,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-10 18:35:49,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-10 18:35:49,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:49,387 INFO L225 Difference]: With dead ends: 91 [2020-07-10 18:35:49,387 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 18:35:49,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:35:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 18:35:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2020-07-10 18:35:49,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:49,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 70 states. [2020-07-10 18:35:49,451 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 70 states. [2020-07-10 18:35:49,451 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 70 states. [2020-07-10 18:35:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:49,456 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-10 18:35:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-10 18:35:49,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:49,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:49,457 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 75 states. [2020-07-10 18:35:49,458 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 75 states. [2020-07-10 18:35:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:49,463 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-10 18:35:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-10 18:35:49,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:49,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:49,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:49,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 18:35:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-10 18:35:49,471 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 49 [2020-07-10 18:35:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:49,472 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-10 18:35:49,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:49,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-10 18:35:49,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-10 18:35:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 18:35:49,551 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:49,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:49,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:35:49,552 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash -587463417, now seen corresponding path program 1 times [2020-07-10 18:35:49,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:49,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [97638182] [2020-07-10 18:35:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:49,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:35:49,817 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:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) 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-10 18:35:49,824 INFO L168 Benchmark]: Toolchain (without parser) took 5389.94 ms. Allocated memory was 138.9 MB in the beginning and 275.8 MB in the end (delta: 136.8 MB). Free memory was 104.4 MB in the beginning and 242.4 MB in the end (delta: -138.1 MB). Peak memory consumption was 142.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:49,825 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:35:49,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.94 ms. Allocated memory is still 138.9 MB. Free memory was 103.9 MB in the beginning and 92.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:49,826 INFO L168 Benchmark]: Boogie Preprocessor took 186.84 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 92.9 MB in the beginning and 181.7 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:49,827 INFO L168 Benchmark]: RCFGBuilder took 607.16 ms. Allocated memory is still 204.5 MB. Free memory was 181.7 MB in the beginning and 148.9 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:49,828 INFO L168 Benchmark]: TraceAbstraction took 4224.27 ms. Allocated memory was 204.5 MB in the beginning and 275.8 MB in the end (delta: 71.3 MB). Free memory was 148.9 MB in the beginning and 242.4 MB in the end (delta: -93.6 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:49,832 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.25 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 361.94 ms. Allocated memory is still 138.9 MB. Free memory was 103.9 MB in the beginning and 92.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 186.84 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 92.9 MB in the beginning and 181.7 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 607.16 ms. Allocated memory is still 204.5 MB. Free memory was 181.7 MB in the beginning and 148.9 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4224.27 ms. Allocated memory was 204.5 MB in the beginning and 275.8 MB in the end (delta: 71.3 MB). Free memory was 148.9 MB in the beginning and 242.4 MB in the end (delta: -93.6 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...