/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1230.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:05:56,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:05:56,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:05:56,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:05:56,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:05:56,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:05:56,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:05:56,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:05:56,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:05:56,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:05:56,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:05:56,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:05:56,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:05:56,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:05:56,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:05:56,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:05:56,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:05:56,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:05:56,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:05:56,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:05:56,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:05:56,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:05:56,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:05:56,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:05:56,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:05:56,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:05:56,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:05:56,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:05:56,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:05:56,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:05:56,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:05:56,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:05:56,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:05:56,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:05:56,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:05:56,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:05:56,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:05:56,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:05:56,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:05:56,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:05:56,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:05:56,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:05:56,112 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:05:56,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:05:56,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:05:56,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:05:56,114 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:05:56,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:05:56,114 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:05:56,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:05:56,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:05:56,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:05:56,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:05:56,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:05:56,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:05:56,115 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:05:56,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:05:56,116 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:05:56,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:05:56,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:05:56,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:05:56,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:05:56,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:05:56,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:05:56,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:05:56,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:05:56,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:05:56,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:05:56,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:05:56,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:05:56,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:05:56,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:05:56,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:05:56,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:05:56,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:05:56,419 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:05:56,420 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:05:56,421 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-17 22:05:56,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e963bbb56/b4dfe2039e694f2291e89a4babd65164/FLAG480c29504 [2020-07-17 22:05:56,914 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:05:56,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1230.c [2020-07-17 22:05:56,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e963bbb56/b4dfe2039e694f2291e89a4babd65164/FLAG480c29504 [2020-07-17 22:05:57,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e963bbb56/b4dfe2039e694f2291e89a4babd65164 [2020-07-17 22:05:57,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:05:57,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:05:57,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:05:57,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:05:57,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:05:57,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168b7e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57, skipping insertion in model container [2020-07-17 22:05:57,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:05:57,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:05:57,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:05:57,530 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:05:57,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:05:57,584 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:05:57,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57 WrapperNode [2020-07-17 22:05:57,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:05:57,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:05:57,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:05:57,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:05:57,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (1/1) ... [2020-07-17 22:05:57,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:05:57,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:05:57,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:05:57,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:05:57,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (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-17 22:05:57,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:05:57,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:05:57,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-17 22:05:57,869 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-17 22:05:57,869 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-17 22:05:57,869 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:05:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:05:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-17 22:05:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:05:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-17 22:05:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:05:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:05:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-17 22:05:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-17 22:05:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:05:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:05:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:05:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:05:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-17 22:05:58,516 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:05:58,516 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:05:58,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:05:58 BoogieIcfgContainer [2020-07-17 22:05:58,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:05:58,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:05:58,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:05:58,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:05:58,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:05:57" (1/3) ... [2020-07-17 22:05:58,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411a9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:05:58, skipping insertion in model container [2020-07-17 22:05:58,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:57" (2/3) ... [2020-07-17 22:05:58,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411a9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:05:58, skipping insertion in model container [2020-07-17 22:05:58,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:05:58" (3/3) ... [2020-07-17 22:05:58,530 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2020-07-17 22:05:58,541 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:05:58,550 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:05:58,566 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:05:58,591 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:05:58,592 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:05:58,592 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:05:58,592 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:05:58,592 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:05:58,592 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:05:58,592 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:05:58,593 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:05:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-17 22:05:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:05:58,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:58,618 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] [2020-07-17 22:05:58,618 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:58,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1674881228, now seen corresponding path program 1 times [2020-07-17 22:05:58,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:58,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136428674] [2020-07-17 22:05:58,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:05:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-17 22:05:58,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:05:58,848 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-17 22:05:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-17 22:05:58,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-17 22:05:58,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-17 22:05:58,911 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:05:58,911 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-17 22:05:58,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-17 22:05:58,914 INFO L263 TraceCheckUtils]: 1: Hoare triple {43#true} call #t~ret2 := __fpclassify_float(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:58,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-17 22:05:58,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-17 22:05:58,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-17 22:05:58,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:05:58,917 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-17 22:05:58,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-17 22:05:58,918 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-17 22:05:58,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:05:58,919 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-17 22:05:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-17 22:05:58,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:05:58,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-17 22:05:58,935 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:05:58,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-17 22:05:58,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:05:58,936 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-17 22:05:58,937 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret7 := main(); {43#true} is VALID [2020-07-17 22:05:58,937 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {43#true} is VALID [2020-07-17 22:05:58,940 INFO L263 TraceCheckUtils]: 6: Hoare triple {43#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:58,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-17 22:05:58,942 INFO L263 TraceCheckUtils]: 8: Hoare triple {43#true} call #t~ret2 := __fpclassify_float(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:58,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-17 22:05:58,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-17 22:05:58,944 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-17 22:05:58,945 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:05:58,945 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-17 22:05:58,946 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-17 22:05:58,946 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-17 22:05:58,946 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:05:58,947 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-17 22:05:58,947 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~res~0 := #t~ret5;havoc #t~ret5; {44#false} is VALID [2020-07-17 22:05:58,948 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call #t~ret6 := isnan_float(~res~0); {43#true} is VALID [2020-07-17 22:05:58,948 INFO L280 TraceCheckUtils]: 20: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-17 22:05:58,948 INFO L280 TraceCheckUtils]: 21: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:05:58,949 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-17 22:05:58,949 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {44#false} is VALID [2020-07-17 22:05:58,949 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == #t~ret6;havoc #t~ret6; {44#false} is VALID [2020-07-17 22:05:58,950 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-17 22:05:58,955 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-17 22:05:58,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136428674] [2020-07-17 22:05:58,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:05:58,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:05:58,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496979328] [2020-07-17 22:05:58,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-17 22:05:58,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:05:58,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:05:59,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:59,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:05:59,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:05:59,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:05:59,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:05:59,063 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-17 22:05:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,542 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2020-07-17 22:05:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:05:59,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-17 22:05:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:05:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:05:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-17 22:05:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:05:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-17 22:05:59,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2020-07-17 22:05:59,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:59,815 INFO L225 Difference]: With dead ends: 71 [2020-07-17 22:05:59,816 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:05:59,820 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-17 22:05:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:05:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-17 22:05:59,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:05:59,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-17 22:05:59,891 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:05:59,891 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:05:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,898 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-17 22:05:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-17 22:05:59,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:59,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:59,899 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:05:59,899 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:05:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,905 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-17 22:05:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-17 22:05:59,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:59,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:59,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:05:59,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:05:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:05:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-17 22:05:59,913 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2020-07-17 22:05:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:05:59,914 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-17 22:05:59,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:05:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-17 22:05:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:05:59,916 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:59,916 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] [2020-07-17 22:05:59,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:05:59,917 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:59,917 INFO L82 PathProgramCache]: Analyzing trace with hash 312623789, now seen corresponding path program 1 times [2020-07-17 22:05:59,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:59,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901667320] [2020-07-17 22:05:59,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:05:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:00,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-17 22:06:00,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-17 22:06:00,066 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-17 22:06:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:00,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-17 22:06:00,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-17 22:06:00,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-17 22:06:00,187 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:00,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:00,189 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:00,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-17 22:06:00,190 INFO L263 TraceCheckUtils]: 1: Hoare triple {282#true} call #t~ret2 := __fpclassify_float(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:00,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-17 22:06:00,191 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-17 22:06:00,191 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-17 22:06:00,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:00,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:00,194 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:00,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:00,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {283#false} is VALID [2020-07-17 22:06:00,196 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-17 22:06:00,196 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-17 22:06:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:00,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-17 22:06:00,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-17 22:06:00,203 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-17 22:06:00,205 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:06:00,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-17 22:06:00,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-17 22:06:00,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-17 22:06:00,206 INFO L263 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret7 := main(); {282#true} is VALID [2020-07-17 22:06:00,206 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {282#true} is VALID [2020-07-17 22:06:00,207 INFO L263 TraceCheckUtils]: 6: Hoare triple {282#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:00,208 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-17 22:06:00,209 INFO L263 TraceCheckUtils]: 8: Hoare triple {282#true} call #t~ret2 := __fpclassify_float(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:00,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-17 22:06:00,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-17 22:06:00,210 INFO L280 TraceCheckUtils]: 11: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-17 22:06:00,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:00,212 INFO L280 TraceCheckUtils]: 13: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:00,213 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:00,213 INFO L280 TraceCheckUtils]: 15: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:00,214 INFO L280 TraceCheckUtils]: 16: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {283#false} is VALID [2020-07-17 22:06:00,215 INFO L280 TraceCheckUtils]: 17: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-17 22:06:00,215 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-17 22:06:00,215 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#false} ~res~0 := #t~ret5;havoc #t~ret5; {283#false} is VALID [2020-07-17 22:06:00,215 INFO L263 TraceCheckUtils]: 20: Hoare triple {283#false} call #t~ret6 := isnan_float(~res~0); {282#true} is VALID [2020-07-17 22:06:00,216 INFO L280 TraceCheckUtils]: 21: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-17 22:06:00,216 INFO L280 TraceCheckUtils]: 22: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-17 22:06:00,216 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-17 22:06:00,217 INFO L280 TraceCheckUtils]: 24: Hoare triple {283#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {283#false} is VALID [2020-07-17 22:06:00,217 INFO L280 TraceCheckUtils]: 25: Hoare triple {283#false} assume 0 == #t~ret6;havoc #t~ret6; {283#false} is VALID [2020-07-17 22:06:00,217 INFO L280 TraceCheckUtils]: 26: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-17 22:06:00,219 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-17 22:06:00,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901667320] [2020-07-17 22:06:00,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:00,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:06:00,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380049852] [2020-07-17 22:06:00,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:06:00,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:00,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:06:00,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:00,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:06:00,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:06:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:06:00,259 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 6 states. [2020-07-17 22:06:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:00,817 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-17 22:06:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:06:00,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:06:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:06:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:06:00,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-17 22:06:00,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:00,924 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:06:00,924 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:06:00,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:06:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:06:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 22:06:00,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:00,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:00,953 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:00,953 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:00,958 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-17 22:06:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:06:00,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:00,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:00,959 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:00,960 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:00,964 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-17 22:06:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:06:00,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:00,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:00,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:00,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:06:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-17 22:06:00,969 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2020-07-17 22:06:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:00,970 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-17 22:06:00,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:06:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:06:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:06:00,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:00,972 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] [2020-07-17 22:06:00,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:06:00,972 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:00,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -409741261, now seen corresponding path program 1 times [2020-07-17 22:06:00,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:00,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894350809] [2020-07-17 22:06:00,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:01,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-17 22:06:01,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-17 22:06:01,049 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-17 22:06:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:01,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-17 22:06:01,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-17 22:06:01,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-17 22:06:01,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-17 22:06:01,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-17 22:06:01,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-17 22:06:01,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:01,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:01,186 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:01,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-17 22:06:01,188 INFO L263 TraceCheckUtils]: 1: Hoare triple {518#true} call #t~ret2 := __fpclassify_float(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:01,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-17 22:06:01,188 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-17 22:06:01,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-17 22:06:01,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-17 22:06:01,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-17 22:06:01,189 INFO L280 TraceCheckUtils]: 7: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-17 22:06:01,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:01,191 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:01,192 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:01,193 INFO L280 TraceCheckUtils]: 11: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:01,194 INFO L280 TraceCheckUtils]: 12: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {519#false} is VALID [2020-07-17 22:06:01,194 INFO L280 TraceCheckUtils]: 13: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-17 22:06:01,194 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-17 22:06:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:01,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-17 22:06:01,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-17 22:06:01,200 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-17 22:06:01,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:06:01,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-17 22:06:01,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-17 22:06:01,202 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-17 22:06:01,202 INFO L263 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret7 := main(); {518#true} is VALID [2020-07-17 22:06:01,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {518#true} is VALID [2020-07-17 22:06:01,204 INFO L263 TraceCheckUtils]: 6: Hoare triple {518#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:01,204 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-17 22:06:01,205 INFO L263 TraceCheckUtils]: 8: Hoare triple {518#true} call #t~ret2 := __fpclassify_float(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:01,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-17 22:06:01,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-17 22:06:01,206 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-17 22:06:01,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-17 22:06:01,207 INFO L280 TraceCheckUtils]: 13: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-17 22:06:01,207 INFO L280 TraceCheckUtils]: 14: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-17 22:06:01,208 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:01,208 INFO L280 TraceCheckUtils]: 16: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:01,209 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:01,210 INFO L280 TraceCheckUtils]: 18: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-17 22:06:01,211 INFO L280 TraceCheckUtils]: 19: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {519#false} is VALID [2020-07-17 22:06:01,211 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-17 22:06:01,212 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-17 22:06:01,212 INFO L280 TraceCheckUtils]: 22: Hoare triple {519#false} ~res~0 := #t~ret5;havoc #t~ret5; {519#false} is VALID [2020-07-17 22:06:01,212 INFO L263 TraceCheckUtils]: 23: Hoare triple {519#false} call #t~ret6 := isnan_float(~res~0); {518#true} is VALID [2020-07-17 22:06:01,212 INFO L280 TraceCheckUtils]: 24: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-17 22:06:01,213 INFO L280 TraceCheckUtils]: 25: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-17 22:06:01,213 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-17 22:06:01,213 INFO L280 TraceCheckUtils]: 27: Hoare triple {519#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {519#false} is VALID [2020-07-17 22:06:01,213 INFO L280 TraceCheckUtils]: 28: Hoare triple {519#false} assume 0 == #t~ret6;havoc #t~ret6; {519#false} is VALID [2020-07-17 22:06:01,214 INFO L280 TraceCheckUtils]: 29: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-17 22:06:01,215 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-17 22:06:01,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894350809] [2020-07-17 22:06:01,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:01,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:06:01,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275509901] [2020-07-17 22:06:01,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-17 22:06:01,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:01,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:06:01,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:01,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:06:01,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:06:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:06:01,253 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-17 22:06:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:01,797 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-17 22:06:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:06:01,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-17 22:06:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:06:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-17 22:06:01,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-17 22:06:01,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:01,905 INFO L225 Difference]: With dead ends: 55 [2020-07-17 22:06:01,905 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:06:01,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:06:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:06:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-17 22:06:01,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:01,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2020-07-17 22:06:01,938 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2020-07-17 22:06:01,938 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2020-07-17 22:06:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:01,946 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:06:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:06:01,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:01,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:01,949 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2020-07-17 22:06:01,950 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2020-07-17 22:06:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:01,956 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:06:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:06:01,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:01,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:01,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:01,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:06:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-17 22:06:01,967 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2020-07-17 22:06:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:01,967 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-17 22:06:01,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:06:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:06:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:06:01,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:01,969 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] [2020-07-17 22:06:01,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:06:01,969 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1097810548, now seen corresponding path program 1 times [2020-07-17 22:06:01,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:01,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303171945] [2020-07-17 22:06:01,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:06:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:06:02,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:06:02,235 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:06:02,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:06:02,263 WARN L170 areAnnotationChecker]: isnan_floatENTRY has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: fmin_floatENTRY has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: __fpclassify_floatENTRY has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: isnan_floatFINAL has no Hoare annotation [2020-07-17 22:06:02,264 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-17 22:06:02,265 WARN L170 areAnnotationChecker]: isnan_floatEXIT has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-17 22:06:02,266 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:06:02,267 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: fmin_floatFINAL has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:06:02,268 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: fmin_floatEXIT has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:06:02,269 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-17 22:06:02,270 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-17 22:06:02,270 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:06:02,270 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:06:02,270 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-17 22:06:02,270 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:06:02,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:06:02 BoogieIcfgContainer [2020-07-17 22:06:02,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:06:02,276 INFO L168 Benchmark]: Toolchain (without parser) took 4972.39 ms. Allocated memory was 141.6 MB in the beginning and 276.3 MB in the end (delta: 134.7 MB). Free memory was 102.9 MB in the beginning and 240.3 MB in the end (delta: -137.4 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:02,277 INFO L168 Benchmark]: CDTParser took 1.27 ms. Allocated memory is still 141.6 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 22:06:02,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.16 ms. Allocated memory is still 141.6 MB. Free memory was 102.5 MB in the beginning and 91.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:02,279 INFO L168 Benchmark]: Boogie Preprocessor took 178.71 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 183.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:02,279 INFO L168 Benchmark]: RCFGBuilder took 752.73 ms. Allocated memory is still 205.5 MB. Free memory was 183.0 MB in the beginning and 155.6 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:02,280 INFO L168 Benchmark]: TraceAbstraction took 3750.70 ms. Allocated memory was 205.5 MB in the beginning and 276.3 MB in the end (delta: 70.8 MB). Free memory was 155.0 MB in the beginning and 240.3 MB in the end (delta: -85.3 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:02,284 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 1.27 ms. Allocated memory is still 141.6 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.16 ms. Allocated memory is still 141.6 MB. Free memory was 102.5 MB in the beginning and 91.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 178.71 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 183.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 752.73 ms. Allocated memory is still 205.5 MB. Free memory was 183.0 MB in the beginning and 155.6 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3750.70 ms. Allocated memory was 205.5 MB in the beginning and 276.3 MB in the end (delta: 70.8 MB). Free memory was 155.0 MB in the beginning and 240.3 MB in the end (delta: -85.3 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L56] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2147483649, \old(y)=2147483651] [L35] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2147483649] [L12] __uint32_t w; VAL [\old(x)=2147483649, x=2147483649] [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L31] return 0; VAL [\old(x)=2147483649, \result=0, w=2147483647, x=2147483649] [L35] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2147483649, \old(y)=2147483651, __fpclassify_float(x)=0, x=2147483649, y=2147483651] [L35] COND TRUE __fpclassify_float(x) == 0 [L36] return y; VAL [\old(x)=2147483649, \old(y)=2147483651, \result=2147483651, x=2147483649, y=2147483651] [L56] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2147483651, x=2147483649, y=2147483651] [L56] float res = fmin_float(x, y); [L58] CALL, EXPR isnan_float(res) VAL [\old(x)=2147483651] [L44] return x != x; VAL [\old(x)=2147483651, \result=0, x=2147483651] [L58] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2147483651, x=2147483649, y=2147483651] [L58] COND TRUE !isnan_float(res) [L59] __VERIFIER_error() VAL [res=2147483651, x=2147483649, y=2147483651] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 108 SDslu, 43 SDs, 0 SdLazy, 255 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 5222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...