/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_1232a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:20,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:20,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:20,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:20,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:20,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:20,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:20,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:20,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:20,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:20,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:20,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:20,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:20,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:20,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:20,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:21,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:21,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:21,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:21,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:21,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:21,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:21,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:21,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:21,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:21,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:21,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:21,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:21,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:21,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:21,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:21,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:21,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:21,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:21,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:21,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:21,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:21,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:21,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:21,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:21,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:21,041 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-10 14:42:21,063 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:21,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:21,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:21,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:21,065 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:21,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:21,066 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:21,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:21,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:21,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:21,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:21,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:21,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:21,068 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:21,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:21,069 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:21,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:21,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:21,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:21,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:21,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:21,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:21,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:21,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:21,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:21,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:21,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:21,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:21,071 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:21,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:21,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:21,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:21,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:21,372 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:21,373 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:21,373 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1232a.c [2020-07-10 14:42:21,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e50dc5f5/53d040bf509947ef8f405a2db9e18419/FLAG785960042 [2020-07-10 14:42:21,954 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:21,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1232a.c [2020-07-10 14:42:21,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e50dc5f5/53d040bf509947ef8f405a2db9e18419/FLAG785960042 [2020-07-10 14:42:22,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e50dc5f5/53d040bf509947ef8f405a2db9e18419 [2020-07-10 14:42:22,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:22,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:22,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:22,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:22,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:22,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82f2cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22, skipping insertion in model container [2020-07-10 14:42:22,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:22,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:22,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:22,570 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:22,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:22,710 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:22,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22 WrapperNode [2020-07-10 14:42:22,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:22,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:22,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:22,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:22,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (1/1) ... [2020-07-10 14:42:22,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:22,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:22,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:22,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:22,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (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 14:42:22,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-10 14:42:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-10 14:42:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-10 14:42:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:22,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:22,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-10 14:42:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-10 14:42:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:42:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:42:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:42:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:42:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-10 14:42:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-10 14:42:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:42:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:42:23,336 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:23,337 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 14:42:23,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:23 BoogieIcfgContainer [2020-07-10 14:42:23,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:23,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:23,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:23,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:23,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:22" (1/3) ... [2020-07-10 14:42:23,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3431ecfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:23, skipping insertion in model container [2020-07-10 14:42:23,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:22" (2/3) ... [2020-07-10 14:42:23,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3431ecfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:23, skipping insertion in model container [2020-07-10 14:42:23,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:23" (3/3) ... [2020-07-10 14:42:23,349 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2020-07-10 14:42:23,358 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:23,365 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:23,380 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:23,401 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:23,401 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:23,402 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:23,402 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:23,402 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:23,402 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:23,402 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:23,402 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-10 14:42:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:42:23,428 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:23,429 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] [2020-07-10 14:42:23,430 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash -411440866, now seen corresponding path program 1 times [2020-07-10 14:42:23,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:23,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348362683] [2020-07-10 14:42:23,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(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; {47#true} is VALID [2020-07-10 14:42:23,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:42:23,668 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:42:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-10 14:42:23,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:23,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:23,738 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:23,738 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:23,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-10 14:42:23,742 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:23,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-10 14:42:23,743 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:23,744 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:23,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:23,745 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:23,745 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-10 14:42:23,746 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-10 14:42:23,747 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:23,747 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:42:23,750 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:23,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {63#(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; {47#true} is VALID [2020-07-10 14:42:23,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:42:23,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:42:23,752 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret10 := main(); {47#true} is VALID [2020-07-10 14:42:23,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := 0.0;~y~0 := ~someUnaryFLOAToperation(0.0); {47#true} is VALID [2020-07-10 14:42:23,755 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:23,755 INFO L280 TraceCheckUtils]: 7: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-10 14:42:23,757 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:23,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-10 14:42:23,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:23,759 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:23,760 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:23,760 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:23,761 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-10 14:42:23,761 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-10 14:42:23,761 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:23,762 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:42:23,762 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {48#false} is VALID [2020-07-10 14:42:23,763 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short9; {48#false} is VALID [2020-07-10 14:42:23,763 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {48#false} is VALID [2020-07-10 14:42:23,764 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-10 14:42:23,768 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 14:42:23,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348362683] [2020-07-10 14:42:23,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:23,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:23,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582799661] [2020-07-10 14:42:23,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:42:23,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:23,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:23,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:23,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:23,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:23,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:23,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:23,876 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-10 14:42:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,412 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-10 14:42:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:24,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:42:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:42:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:42:24,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-10 14:42:24,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:24,612 INFO L225 Difference]: With dead ends: 79 [2020-07-10 14:42:24,612 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:42:24,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 14:42:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:42:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:42:24,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:24,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,686 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,686 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,693 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:24,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:24,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:24,694 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,695 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,700 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:24,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:24,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:24,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:24,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:42:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:42:24,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-10 14:42:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:24,708 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:42:24,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:42:24,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:24,710 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] [2020-07-10 14:42:24,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:24,711 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1480673795, now seen corresponding path program 1 times [2020-07-10 14:42:24,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:24,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088755150] [2020-07-10 14:42:24,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#(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; {306#true} is VALID [2020-07-10 14:42:24,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:42:24,810 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:42:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-10 14:42:24,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#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~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:24,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:24,988 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,990 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:24,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-10 14:42:24,997 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:24,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-10 14:42:24,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#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~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:24,999 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:25,000 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,001 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,003 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,004 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-10 14:42:25,006 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:42:25,007 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:42:25,015 INFO L263 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:25,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(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; {306#true} is VALID [2020-07-10 14:42:25,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:42:25,017 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:42:25,017 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret10 := main(); {306#true} is VALID [2020-07-10 14:42:25,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0.0;~y~0 := ~someUnaryFLOAToperation(0.0); {306#true} is VALID [2020-07-10 14:42:25,020 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:25,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-10 14:42:25,022 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:25,022 INFO L280 TraceCheckUtils]: 9: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-10 14:42:25,022 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#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~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:25,023 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:25,025 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,026 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,029 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-10 14:42:25,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:42:25,031 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:42:25,032 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {307#false} is VALID [2020-07-10 14:42:25,032 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short9; {307#false} is VALID [2020-07-10 14:42:25,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {307#false} is VALID [2020-07-10 14:42:25,033 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-10 14:42:25,035 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 14:42:25,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088755150] [2020-07-10 14:42:25,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:25,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:25,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236688029] [2020-07-10 14:42:25,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:42:25,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:25,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:25,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:25,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:25,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:25,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:25,077 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:42:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:25,859 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-10 14:42:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:25,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:42:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:25,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:42:25,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:25,983 INFO L225 Difference]: With dead ends: 59 [2020-07-10 14:42:25,984 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:42:25,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-10 14:42:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:42:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:42:26,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:26,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,016 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,016 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:26,020 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:26,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:26,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:26,022 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,022 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:26,026 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:26,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:26,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:26,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:26,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:42:26,032 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-10 14:42:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:26,032 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:42:26,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:26,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:26,034 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-10 14:42:26,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:42:26,035 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1766352133, now seen corresponding path program 1 times [2020-07-10 14:42:26,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:26,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036352395] [2020-07-10 14:42:26,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:26,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {582#(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; {562#true} is VALID [2020-07-10 14:42:26,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:42:26,158 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:42:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:26,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-10 14:42:26,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#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~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:26,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:26,314 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:26,314 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:26,315 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:26,316 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,318 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,319 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-10 14:42:26,321 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:26,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-10 14:42:26,322 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#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~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:26,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:26,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:26,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:26,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:26,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,326 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,327 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,328 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,329 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-10 14:42:26,330 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:42:26,330 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:42:26,331 INFO L263 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:26,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#(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; {562#true} is VALID [2020-07-10 14:42:26,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:42:26,332 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:42:26,333 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret10 := main(); {562#true} is VALID [2020-07-10 14:42:26,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := 0.0;~y~0 := ~someUnaryFLOAToperation(0.0); {562#true} is VALID [2020-07-10 14:42:26,334 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:26,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-10 14:42:26,336 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:26,336 INFO L280 TraceCheckUtils]: 9: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-10 14:42:26,337 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#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~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:26,337 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:26,337 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:26,337 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:26,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:26,339 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,341 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,341 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,342 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-10 14:42:26,342 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:42:26,343 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:42:26,343 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {563#false} is VALID [2020-07-10 14:42:26,343 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short9; {563#false} is VALID [2020-07-10 14:42:26,344 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {563#false} is VALID [2020-07-10 14:42:26,344 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-10 14:42:26,345 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 14:42:26,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036352395] [2020-07-10 14:42:26,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:26,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:26,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856097151] [2020-07-10 14:42:26,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:42:26,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:26,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:26,393 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-10 14:42:26,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:26,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:26,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:26,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:26,394 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-10 14:42:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:26,987 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-10 14:42:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:26,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:42:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:27,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:42:27,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:27,123 INFO L225 Difference]: With dead ends: 63 [2020-07-10 14:42:27,124 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 14:42:27,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-10 14:42:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 14:42:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-10 14:42:27,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:27,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:27,166 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:27,166 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:27,173 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:42:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:42:27,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:27,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:27,175 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-10 14:42:27,176 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-10 14:42:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:27,186 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:42:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:42:27,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:27,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:27,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:27,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:42:27,194 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-10 14:42:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:27,195 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:42:27,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:27,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:27,196 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-10 14:42:27,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:42:27,196 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash -30599226, now seen corresponding path program 1 times [2020-07-10 14:42:27,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:27,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835366341] [2020-07-10 14:42:27,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:27,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:42:27,521 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:42:27,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:42:27,582 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:42:27,583 WARN L170 areAnnotationChecker]: fmin_floatENTRY has no Hoare annotation [2020-07-10 14:42:27,584 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:27,584 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:27,584 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:42:27,584 WARN L170 areAnnotationChecker]: __fpclassify_floatENTRY has no Hoare annotation [2020-07-10 14:42:27,584 WARN L170 areAnnotationChecker]: __signbit_floatENTRY has no Hoare annotation [2020-07-10 14:42:27,584 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:42:27,585 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:42:27,585 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:42:27,585 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:27,585 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:27,585 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 14:42:27,586 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 14:42:27,586 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-10 14:42:27,586 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-10 14:42:27,586 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:27,586 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:27,587 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:42:27,587 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-10 14:42:27,587 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:42:27,587 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-10 14:42:27,587 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-10 14:42:27,587 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-10 14:42:27,588 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-10 14:42:27,588 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-10 14:42:27,588 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:42:27,588 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:42:27,588 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 14:42:27,588 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 14:42:27,588 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 14:42:27,589 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 14:42:27,589 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 14:42:27,589 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2020-07-10 14:42:27,589 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:27,589 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:27,589 WARN L170 areAnnotationChecker]: __signbit_floatFINAL has no Hoare annotation [2020-07-10 14:42:27,589 WARN L170 areAnnotationChecker]: fmin_floatFINAL has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: L69-4 has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: L69-4 has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 14:42:27,590 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 14:42:27,591 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 14:42:27,591 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 14:42:27,591 WARN L170 areAnnotationChecker]: __signbit_floatEXIT has no Hoare annotation [2020-07-10 14:42:27,591 WARN L170 areAnnotationChecker]: fmin_floatEXIT has no Hoare annotation [2020-07-10 14:42:27,591 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-10 14:42:27,591 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2020-07-10 14:42:27,591 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-10 14:42:27,592 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-10 14:42:27,592 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:42:27,592 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 14:42:27,592 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 14:42:27,592 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 14:42:27,593 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 14:42:27,593 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:42:27,593 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:42:27,593 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:42:27,593 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 14:42:27,593 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:42:27,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:42:27 BoogieIcfgContainer [2020-07-10 14:42:27,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:42:27,603 INFO L168 Benchmark]: Toolchain (without parser) took 5291.56 ms. Allocated memory was 138.9 MB in the beginning and 278.4 MB in the end (delta: 139.5 MB). Free memory was 103.4 MB in the beginning and 231.0 MB in the end (delta: -127.7 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:27,605 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:42:27,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.27 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 181.4 MB in the end (delta: -78.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:27,614 INFO L168 Benchmark]: Boogie Preprocessor took 51.29 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:27,615 INFO L168 Benchmark]: RCFGBuilder took 577.35 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 148.4 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:27,623 INFO L168 Benchmark]: TraceAbstraction took 4255.97 ms. Allocated memory was 202.4 MB in the beginning and 278.4 MB in the end (delta: 76.0 MB). Free memory was 147.8 MB in the beginning and 231.0 MB in the end (delta: -83.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:42:27,628 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 401.27 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.1 MB in the beginning and 181.4 MB in the end (delta: -78.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.29 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 577.35 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 148.4 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4255.97 ms. Allocated memory was 202.4 MB in the beginning and 278.4 MB in the end (delta: 76.0 MB). Free memory was 147.8 MB in the beginning and 231.0 MB in the end (delta: -83.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 70]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someUnaryFLOAToperation at line 65. Possible FailurePath: [L64] float x = 0.0f; [L65] float y = -0.0f; VAL [x=0] [L66] CALL, EXPR fmin_float(x, y) VAL [\old(x)=0, \old(y)=2139095044] [L36] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L13] __uint32_t w; VAL [\old(x)=0, x=0] [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=2139095041, x=0] [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=2139095041, x=0] [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=2139095041, x=0] [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; VAL [\old(x)=0, \result=0, w=2139095041, x=0] [L36] RET, EXPR __fpclassify_float(x) VAL [\old(x)=0, \old(y)=2139095044, __fpclassify_float(x)=0, x=0, y=2139095044] [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; VAL [\old(x)=0, \old(y)=2139095044, \result=2139095044, x=0, y=2139095044] [L66] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095044, x=0, y=2139095044] [L66] float res = fmin_float(x, y); [L69] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=2139095044, res == -0.0f && __signbit_float(res) == 1=0, x=0, y=2139095044] [L69] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L70] __VERIFIER_error() VAL [res=2139095044, x=0, y=2139095044] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.1s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 123 SDtfs, 117 SDslu, 43 SDs, 0 SdLazy, 296 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.7s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 4170 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...