/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/double_req_bl_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:41:15,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:41:15,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:41:15,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:41:15,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:41:15,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:41:15,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:41:15,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:41:15,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:41:15,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:41:15,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:41:15,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:41:15,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:41:15,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:41:15,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:41:15,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:41:15,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:41:15,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:41:15,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:41:15,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:41:15,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:41:15,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:41:15,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:41:15,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:41:15,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:41:15,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:41:15,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:41:15,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:41:15,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:41:15,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:41:15,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:41:15,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:41:15,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:41:15,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:41:15,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:41:15,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:41:15,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:41:15,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:41:15,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:41:15,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:41:15,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:41:15,599 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:41:15,633 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:41:15,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:41:15,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:41:15,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:41:15,635 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:41:15,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:41:15,635 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:41:15,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:41:15,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:41:15,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:41:15,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:41:15,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:41:15,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:41:15,640 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:41:15,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:41:15,640 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:41:15,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:41:15,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:41:15,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:41:15,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:41:15,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:41:15,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:41:15,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:41:15,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:41:15,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:41:15,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:41:15,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:41:15,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:41:15,645 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:41:15,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:41:15,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:41:15,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:41:15,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:41:15,964 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:41:15,965 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:41:15,966 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-10 14:41:16,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3357dbd32/4dbf0a2a39e245b59b8f6cec42d3907d/FLAG77e8eeeee [2020-07-10 14:41:16,521 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:41:16,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-10 14:41:16,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3357dbd32/4dbf0a2a39e245b59b8f6cec42d3907d/FLAG77e8eeeee [2020-07-10 14:41:16,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3357dbd32/4dbf0a2a39e245b59b8f6cec42d3907d [2020-07-10 14:41:16,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:41:16,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:41:16,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:16,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:41:16,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:41:16,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:16" (1/1) ... [2020-07-10 14:41:16,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654fe4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:16, skipping insertion in model container [2020-07-10 14:41:16,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:16" (1/1) ... [2020-07-10 14:41:16,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:41:16,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:41:17,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:17,191 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:41:17,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:17,334 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:41:17,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17 WrapperNode [2020-07-10 14:41:17,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:17,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:41:17,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:41:17,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:41:17,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (1/1) ... [2020-07-10 14:41:17,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (1/1) ... [2020-07-10 14:41:17,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (1/1) ... [2020-07-10 14:41:17,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (1/1) ... [2020-07-10 14:41:17,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (1/1) ... [2020-07-10 14:41:17,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (1/1) ... [2020-07-10 14:41:17,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (1/1) ... [2020-07-10 14:41:17,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:41:17,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:41:17,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:41:17,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:41:17,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (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:41:17,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:41:17,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:41:17,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 14:41:17,449 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-10 14:41:17,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-10 14:41:17,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:41:17,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:41:17,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 14:41:17,450 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 14:41:17,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:41:17,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:41:17,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:41:17,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:41:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-10 14:41:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-10 14:41:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:41:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:41:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:41:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:41:17,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:41:17,913 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:41:17,914 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 14:41:17,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:17 BoogieIcfgContainer [2020-07-10 14:41:17,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:41:17,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:41:17,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:41:17,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:41:17,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:41:16" (1/3) ... [2020-07-10 14:41:17,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db02320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:17, skipping insertion in model container [2020-07-10 14:41:17,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:17" (2/3) ... [2020-07-10 14:41:17,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db02320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:17, skipping insertion in model container [2020-07-10 14:41:17,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:17" (3/3) ... [2020-07-10 14:41:17,928 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2020-07-10 14:41:17,939 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:41:17,946 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:41:17,961 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:41:17,986 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:41:17,986 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:41:17,986 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:41:17,987 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:41:17,987 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:41:17,987 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:41:17,987 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:41:17,988 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:41:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-10 14:41:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:41:18,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:18,017 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:41:18,018 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash -592398611, now seen corresponding path program 1 times [2020-07-10 14:41:18,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:18,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496866238] [2020-07-10 14:41:18,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:18,239 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:41:18,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:41:18,240 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:41:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:18,304 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 ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:18,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:18,306 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:18,307 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:18,307 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:41:18,308 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:41:18,310 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~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:41:18,311 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 ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:18,312 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:18,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:18,313 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:18,313 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:41:18,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-10 14:41:18,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-10 14:41:18,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:18,315 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:41:18,318 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:41:18,318 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:41:18,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:41:18,319 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:41:18,319 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret12 := main(); {47#true} is VALID [2020-07-10 14:41:18,320 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {47#true} is VALID [2020-07-10 14:41:18,322 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret9 := fmax_double(~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:41:18,323 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:41:18,325 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~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:41:18,325 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 ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:18,326 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:18,327 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:18,327 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:18,327 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:41:18,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-10 14:41:18,328 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-10 14:41:18,329 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:18,329 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:41:18,330 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {48#false} is VALID [2020-07-10 14:41:18,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short11; {48#false} is VALID [2020-07-10 14:41:18,330 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {48#false} is VALID [2020-07-10 14:41:18,331 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-10 14:41:18,335 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:41:18,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496866238] [2020-07-10 14:41:18,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:18,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:41:18,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970870201] [2020-07-10 14:41:18,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:41:18,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:18,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:41:18,452 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:41:18,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:41:18,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:18,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:41:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:41:18,466 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-10 14:41:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:18,939 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-10 14:41:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:41:18,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:41:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:41:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:41:18,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-10 14:41:19,142 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:41:19,168 INFO L225 Difference]: With dead ends: 79 [2020-07-10 14:41:19,171 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:41:19,177 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:41:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:41:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:41:19,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:19,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:19,250 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:19,251 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:19,258 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:19,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:19,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:19,260 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:19,260 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:19,266 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:19,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:19,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:19,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:19,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:41:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:41:19,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-10 14:41:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:19,274 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:41:19,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:41:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:41:19,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:19,276 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:41:19,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:41:19,277 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1646954013, now seen corresponding path program 1 times [2020-07-10 14:41:19,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:19,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655344590] [2020-07-10 14:41:19,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:19,420 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:41:19,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:41:19,421 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:41:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:19,525 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 ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:19,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:19,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:19,528 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:19,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:19,530 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:19,530 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:41:19,532 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~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:41:19,532 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 ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:19,532 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:19,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:19,534 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:19,535 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:19,536 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:19,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:19,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-10 14:41:19,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:41:19,538 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:41:19,540 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:41:19,540 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:41:19,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:41:19,541 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:41:19,541 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret12 := main(); {306#true} is VALID [2020-07-10 14:41:19,542 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {306#true} is VALID [2020-07-10 14:41:19,543 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret9 := fmax_double(~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:41:19,543 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:41:19,545 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~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:41:19,545 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 ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:19,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:19,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:19,547 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:19,547 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:19,548 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:19,549 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:19,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-10 14:41:19,550 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:41:19,551 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:41:19,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {307#false} is VALID [2020-07-10 14:41:19,551 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short11; {307#false} is VALID [2020-07-10 14:41:19,551 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {307#false} is VALID [2020-07-10 14:41:19,552 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-10 14:41:19,553 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:41:19,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655344590] [2020-07-10 14:41:19,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:19,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:19,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721770057] [2020-07-10 14:41:19,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:41:19,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:19,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:19,589 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:41:19,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:19,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:19,590 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:41:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:20,293 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-10 14:41:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:20,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:41:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:20,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:41:20,422 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:41:20,426 INFO L225 Difference]: With dead ends: 59 [2020-07-10 14:41:20,426 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:41:20,428 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:41:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:41:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:41:20,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:20,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:20,480 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:20,480 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:20,487 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:20,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:20,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:20,489 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:20,489 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:20,499 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:20,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:20,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:20,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:20,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:41:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:41:20,513 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-10 14:41:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:20,513 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:41:20,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:41:20,516 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:20,517 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:41:20,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:41:20,517 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1003466516, now seen corresponding path program 1 times [2020-07-10 14:41:20,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:20,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525622038] [2020-07-10 14:41:20,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:20,606 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:41:20,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:41:20,607 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:41:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:20,703 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 ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:20,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:20,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:20,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:20,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:20,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:20,706 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:20,707 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:20,708 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:20,708 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:41:20,709 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~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:41:20,710 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 ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:20,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:20,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:20,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:20,711 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:20,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:20,712 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:20,713 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:20,714 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:20,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:20,715 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-10 14:41:20,716 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:41:20,716 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:41:20,718 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:41:20,718 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:41:20,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:41:20,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:41:20,719 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret12 := main(); {562#true} is VALID [2020-07-10 14:41:20,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {562#true} is VALID [2020-07-10 14:41:20,720 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret9 := fmax_double(~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:41:20,720 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:41:20,721 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~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:41:20,722 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 ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:20,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:20,722 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:20,723 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:20,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:20,723 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:20,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:20,742 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:20,743 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:20,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:20,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-10 14:41:20,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:41:20,745 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:41:20,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {563#false} is VALID [2020-07-10 14:41:20,745 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short11; {563#false} is VALID [2020-07-10 14:41:20,746 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {563#false} is VALID [2020-07-10 14:41:20,746 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-10 14:41:20,747 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:41:20,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525622038] [2020-07-10 14:41:20,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:20,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:20,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735544395] [2020-07-10 14:41:20,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:41:20,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:20,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:20,776 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:41:20,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:20,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:20,777 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-10 14:41:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:21,367 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-10 14:41:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:21,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:41:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:21,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:41:21,491 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:41:21,494 INFO L225 Difference]: With dead ends: 63 [2020-07-10 14:41:21,494 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 14:41:21,495 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:41:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 14:41:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-10 14:41:21,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:21,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:21,521 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:21,521 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:21,525 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:41:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:41:21,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:21,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:21,527 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-10 14:41:21,527 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-10 14:41:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:21,531 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:41:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:41:21,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:21,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:21,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:21,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:41:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:41:21,535 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-10 14:41:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:21,536 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:41:21,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:41:21,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:21,538 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:41:21,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:41:21,538 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:21,538 INFO L82 PathProgramCache]: Analyzing trace with hash -793484843, now seen corresponding path program 1 times [2020-07-10 14:41:21,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:21,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938615508] [2020-07-10 14:41:21,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:21,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:41:21,786 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:41:21,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:41:21,822 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:41:21,822 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-10 14:41:21,823 WARN L170 areAnnotationChecker]: fmax_doubleENTRY has no Hoare annotation [2020-07-10 14:41:21,823 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:41:21,823 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:41:21,823 WARN L170 areAnnotationChecker]: __signbit_doubleENTRY has no Hoare annotation [2020-07-10 14:41:21,823 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:41:21,823 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:41:21,823 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-10 14:41:21,824 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-10 14:41:21,824 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-10 14:41:21,824 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-10 14:41:21,824 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:41:21,827 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:41:21,828 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-10 14:41:21,828 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-10 14:41:21,828 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 14:41:21,828 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 14:41:21,828 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:41:21,828 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 14:41:21,828 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 14:41:21,829 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-10 14:41:21,829 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-10 14:41:21,829 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-10 14:41:21,829 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:41:21,829 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 14:41:21,830 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 14:41:21,830 WARN L170 areAnnotationChecker]: L63-3 has no Hoare annotation [2020-07-10 14:41:21,830 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-10 14:41:21,830 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-10 14:41:21,830 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: __signbit_doubleFINAL has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 14:41:21,831 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 14:41:21,832 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:41:21,832 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:41:21,832 WARN L170 areAnnotationChecker]: fmax_doubleFINAL has no Hoare annotation [2020-07-10 14:41:21,832 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 14:41:21,832 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 14:41:21,832 WARN L170 areAnnotationChecker]: __signbit_doubleEXIT has no Hoare annotation [2020-07-10 14:41:21,832 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: L84-4 has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: L84-4 has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: fmax_doubleEXIT has no Hoare annotation [2020-07-10 14:41:21,833 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2020-07-10 14:41:21,834 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 14:41:21,834 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 14:41:21,834 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:41:21,834 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-10 14:41:21,834 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-10 14:41:21,835 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:41:21,835 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 14:41:21,835 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 14:41:21,835 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 14:41:21,835 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:41:21,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:41:21 BoogieIcfgContainer [2020-07-10 14:41:21,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:41:21,845 INFO L168 Benchmark]: Toolchain (without parser) took 4891.72 ms. Allocated memory was 144.7 MB in the beginning and 288.9 MB in the end (delta: 144.2 MB). Free memory was 100.9 MB in the beginning and 250.9 MB in the end (delta: -150.0 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:21,846 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:41:21,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.97 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 180.0 MB in the end (delta: -79.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:21,855 INFO L168 Benchmark]: Boogie Preprocessor took 54.69 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 177.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:21,856 INFO L168 Benchmark]: RCFGBuilder took 527.83 ms. Allocated memory is still 201.9 MB. Free memory was 177.4 MB in the beginning and 145.9 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:21,862 INFO L168 Benchmark]: TraceAbstraction took 3920.61 ms. Allocated memory was 201.9 MB in the beginning and 288.9 MB in the end (delta: 87.0 MB). Free memory was 145.3 MB in the beginning and 250.9 MB in the end (delta: -105.6 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:21,868 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.87 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 382.97 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 180.0 MB in the end (delta: -79.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.69 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 177.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 527.83 ms. Allocated memory is still 201.9 MB. Free memory was 177.4 MB in the beginning and 145.9 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3920.61 ms. Allocated memory was 201.9 MB in the beginning and 288.9 MB in the end (delta: 87.0 MB). Free memory was 145.3 MB in the beginning and 250.9 MB in the end (delta: -105.6 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 80. Possible FailurePath: [L79] double x = 0.0; [L80] double y = -0.0; VAL [x=0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=0, \old(y)=2147483650] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=1, msw=2147483647, x=0] [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=1, msw=2147483647, x=0] [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=1, msw=2147483647, x=0] [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; VAL [\old(x)=0, \result=0, lsw=1, msw=2147483647, x=0] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0, \old(y)=2147483650, __fpclassify_double(x)=0, x=0, y=2147483650] [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; VAL [\old(x)=0, \old(y)=2147483650, \result=2147483650, x=0, y=2147483650] [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=2147483650, x=0, y=2147483650] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=2147483650, res == 0.0 && __signbit_double(res) == 0=0, x=0, y=2147483650] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=2147483650, x=0, y=2147483650] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.2s, 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s 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.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s 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...