/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_1210.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:14,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:14,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:14,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:14,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:14,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:14,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:14,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:14,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:14,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:14,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:14,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:14,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:14,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:14,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:14,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:14,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:14,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:14,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:14,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:14,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:14,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:14,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:14,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:14,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:14,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:14,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:14,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:14,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:14,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:14,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:14,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:14,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:14,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:14,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:14,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:14,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:14,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:14,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:14,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:14,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:14,547 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:14,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:14,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:14,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:14,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:14,588 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:14,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:14,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:14,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:14,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:14,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:14,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:14,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:14,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:14,593 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:14,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:14,594 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:14,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:14,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:14,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:14,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:14,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:14,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:14,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:14,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:14,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:14,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:14,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:14,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:14,596 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:14,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:14,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:14,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:14,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:14,939 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:14,939 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:14,940 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1210.c [2020-07-10 14:42:15,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798516c1f/f09aab1fc8b7441c97248e59e43f7f2f/FLAG6493584c6 [2020-07-10 14:42:15,533 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:15,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1210.c [2020-07-10 14:42:15,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798516c1f/f09aab1fc8b7441c97248e59e43f7f2f/FLAG6493584c6 [2020-07-10 14:42:15,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798516c1f/f09aab1fc8b7441c97248e59e43f7f2f [2020-07-10 14:42:15,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:15,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:15,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:15,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:15,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:15,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:15" (1/1) ... [2020-07-10 14:42:15,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ab684d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:15, skipping insertion in model container [2020-07-10 14:42:15,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:15" (1/1) ... [2020-07-10 14:42:15,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:15,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:16,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:16,133 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:16,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:16,360 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:16,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:16 WrapperNode [2020-07-10 14:42:16,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:16,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:16,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:16,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:16,376 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:16" (1/1) ... [2020-07-10 14:42:16,379 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:16" (1/1) ... [2020-07-10 14:42:16,389 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:16" (1/1) ... [2020-07-10 14:42:16,389 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:16" (1/1) ... [2020-07-10 14:42:16,433 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:16" (1/1) ... [2020-07-10 14:42:16,449 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:16" (1/1) ... [2020-07-10 14:42:16,452 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:16" (1/1) ... [2020-07-10 14:42:16,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:16,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:16,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:16,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:16,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:16" (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:16,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:16,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2020-07-10 14:42:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-10 14:42:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2020-07-10 14:42:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:42:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:42:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:42:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:42:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:42:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:42:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-10 14:42:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:17,150 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:17,150 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-10 14:42:17,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:17 BoogieIcfgContainer [2020-07-10 14:42:17,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:17,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:17,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:17,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:17,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:15" (1/3) ... [2020-07-10 14:42:17,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a300290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:17, skipping insertion in model container [2020-07-10 14:42:17,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:16" (2/3) ... [2020-07-10 14:42:17,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a300290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:17, skipping insertion in model container [2020-07-10 14:42:17,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:17" (3/3) ... [2020-07-10 14:42:17,165 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1210.c [2020-07-10 14:42:17,174 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:17,183 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:17,199 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:17,225 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:17,225 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:17,225 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:17,225 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:17,226 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:17,226 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:17,226 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:17,226 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-10 14:42:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 14:42:17,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:17,250 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] [2020-07-10 14:42:17,251 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1399428577, now seen corresponding path program 1 times [2020-07-10 14:42:17,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:17,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493056774] [2020-07-10 14:42:17,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:17,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {51#true} is VALID [2020-07-10 14:42:17,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-10 14:42:17,483 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #129#return; {51#true} is VALID [2020-07-10 14:42:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:17,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {51#true} is VALID [2020-07-10 14:42:17,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume !true; {52#false} is VALID [2020-07-10 14:42:17,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {52#false} is VALID [2020-07-10 14:42:17,521 INFO L280 TraceCheckUtils]: 3: Hoare triple {52#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {52#false} is VALID [2020-07-10 14:42:17,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-10 14:42:17,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-10 14:42:17,522 INFO L280 TraceCheckUtils]: 6: Hoare triple {52#false} #res := ~x; {52#false} is VALID [2020-07-10 14:42:17,522 INFO L280 TraceCheckUtils]: 7: Hoare triple {52#false} assume true; {52#false} is VALID [2020-07-10 14:42:17,523 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {52#false} {51#true} #133#return; {52#false} is VALID [2020-07-10 14:42:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:17,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {51#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {51#true} is VALID [2020-07-10 14:42:17,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-10 14:42:17,536 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {51#true} {52#false} #135#return; {52#false} is VALID [2020-07-10 14:42:17,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {68#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-10 14:42:17,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {51#true} is VALID [2020-07-10 14:42:17,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-10 14:42:17,539 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #129#return; {51#true} is VALID [2020-07-10 14:42:17,539 INFO L263 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret18 := main(); {51#true} is VALID [2020-07-10 14:42:17,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {51#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); {51#true} is VALID [2020-07-10 14:42:17,542 INFO L263 TraceCheckUtils]: 6: Hoare triple {51#true} call #t~ret13 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {69#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:17,543 INFO L280 TraceCheckUtils]: 7: Hoare triple {69#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {51#true} is VALID [2020-07-10 14:42:17,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {51#true} assume !true; {52#false} is VALID [2020-07-10 14:42:17,545 INFO L280 TraceCheckUtils]: 9: Hoare triple {52#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {52#false} is VALID [2020-07-10 14:42:17,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {52#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {52#false} is VALID [2020-07-10 14:42:17,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-10 14:42:17,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-10 14:42:17,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {52#false} #res := ~x; {52#false} is VALID [2020-07-10 14:42:17,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {52#false} assume true; {52#false} is VALID [2020-07-10 14:42:17,547 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {52#false} {51#true} #133#return; {52#false} is VALID [2020-07-10 14:42:17,547 INFO L280 TraceCheckUtils]: 16: Hoare triple {52#false} ~res~0 := #t~ret13;havoc #t~ret13;call #t~mem14 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {52#false} is VALID [2020-07-10 14:42:17,548 INFO L263 TraceCheckUtils]: 17: Hoare triple {52#false} call #t~ret15 := isnan_float(#t~mem14); {51#true} is VALID [2020-07-10 14:42:17,548 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {51#true} is VALID [2020-07-10 14:42:17,548 INFO L280 TraceCheckUtils]: 19: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-10 14:42:17,549 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {51#true} {52#false} #135#return; {52#false} is VALID [2020-07-10 14:42:17,549 INFO L280 TraceCheckUtils]: 21: Hoare triple {52#false} assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647;#t~short17 := 0 != #t~ret15; {52#false} is VALID [2020-07-10 14:42:17,549 INFO L280 TraceCheckUtils]: 22: Hoare triple {52#false} assume !#t~short17; {52#false} is VALID [2020-07-10 14:42:17,550 INFO L280 TraceCheckUtils]: 23: Hoare triple {52#false} assume #t~short17;havoc #t~mem14;havoc #t~short17;havoc #t~ret15;havoc #t~ret16; {52#false} is VALID [2020-07-10 14:42:17,550 INFO L280 TraceCheckUtils]: 24: Hoare triple {52#false} assume !false; {52#false} is VALID [2020-07-10 14:42:17,555 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:17,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493056774] [2020-07-10 14:42:17,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:17,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:17,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128298513] [2020-07-10 14:42:17,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 14:42:17,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:17,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:17,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:17,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:17,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:17,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:17,636 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2020-07-10 14:42:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:18,142 INFO L93 Difference]: Finished difference Result 88 states and 126 transitions. [2020-07-10 14:42:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:18,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 14:42:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2020-07-10 14:42:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2020-07-10 14:42:18,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2020-07-10 14:42:18,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:18,381 INFO L225 Difference]: With dead ends: 88 [2020-07-10 14:42:18,381 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:42:18,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:42:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:42:18,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:18,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:18,465 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:18,465 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:18,472 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-10 14:42:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-10 14:42:18,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:18,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:18,474 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:18,474 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:18,479 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-10 14:42:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-10 14:42:18,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:18,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:18,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:18,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-07-10 14:42:18,487 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2020-07-10 14:42:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:18,488 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-07-10 14:42:18,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-10 14:42:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:42:18,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:18,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:18,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:18,490 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:18,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1932138526, now seen corresponding path program 1 times [2020-07-10 14:42:18,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:18,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089622716] [2020-07-10 14:42:18,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:18,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {331#true} is VALID [2020-07-10 14:42:18,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-10 14:42:18,653 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {331#true} {331#true} #129#return; {331#true} is VALID [2020-07-10 14:42:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:18,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {352#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {331#true} is VALID [2020-07-10 14:42:18,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#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);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);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; {331#true} is VALID [2020-07-10 14:42:18,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-10 14:42:18,693 INFO L280 TraceCheckUtils]: 3: Hoare triple {331#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {331#true} is VALID [2020-07-10 14:42:18,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {331#true} assume ~j0~0 < 23; {331#true} is VALID [2020-07-10 14:42:18,694 INFO L280 TraceCheckUtils]: 5: Hoare triple {331#true} assume ~j0~0 < 0; {331#true} is VALID [2020-07-10 14:42:18,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {331#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {331#true} is VALID [2020-07-10 14:42:18,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-10 14:42:18,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#true} #res := ~x; {331#true} is VALID [2020-07-10 14:42:18,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-10 14:42:18,696 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {331#true} {331#true} #133#return; {331#true} is VALID [2020-07-10 14:42:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:18,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {331#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {331#true} is VALID [2020-07-10 14:42:18,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-10 14:42:18,705 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {331#true} {331#true} #135#return; {331#true} is VALID [2020-07-10 14:42:18,707 INFO L263 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {351#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-10 14:42:18,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {331#true} is VALID [2020-07-10 14:42:18,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-10 14:42:18,708 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #129#return; {331#true} is VALID [2020-07-10 14:42:18,708 INFO L263 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret18 := main(); {331#true} is VALID [2020-07-10 14:42:18,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {331#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); {331#true} is VALID [2020-07-10 14:42:18,710 INFO L263 TraceCheckUtils]: 6: Hoare triple {331#true} call #t~ret13 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {352#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:18,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {352#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {331#true} is VALID [2020-07-10 14:42:18,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#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);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);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; {331#true} is VALID [2020-07-10 14:42:18,711 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-10 14:42:18,712 INFO L280 TraceCheckUtils]: 10: Hoare triple {331#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {331#true} is VALID [2020-07-10 14:42:18,712 INFO L280 TraceCheckUtils]: 11: Hoare triple {331#true} assume ~j0~0 < 23; {331#true} is VALID [2020-07-10 14:42:18,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {331#true} assume ~j0~0 < 0; {331#true} is VALID [2020-07-10 14:42:18,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {331#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {331#true} is VALID [2020-07-10 14:42:18,713 INFO L280 TraceCheckUtils]: 14: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-10 14:42:18,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#true} #res := ~x; {331#true} is VALID [2020-07-10 14:42:18,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-10 14:42:18,714 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {331#true} {331#true} #133#return; {331#true} is VALID [2020-07-10 14:42:18,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {331#true} ~res~0 := #t~ret13;havoc #t~ret13;call #t~mem14 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {331#true} is VALID [2020-07-10 14:42:18,715 INFO L263 TraceCheckUtils]: 19: Hoare triple {331#true} call #t~ret15 := isnan_float(#t~mem14); {331#true} is VALID [2020-07-10 14:42:18,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {331#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {331#true} is VALID [2020-07-10 14:42:18,715 INFO L280 TraceCheckUtils]: 21: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-10 14:42:18,716 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {331#true} {331#true} #135#return; {331#true} is VALID [2020-07-10 14:42:18,716 INFO L280 TraceCheckUtils]: 23: Hoare triple {331#true} assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647;#t~short17 := 0 != #t~ret15; {331#true} is VALID [2020-07-10 14:42:18,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {331#true} assume !#t~short17; {350#(not |main_#t~short17|)} is VALID [2020-07-10 14:42:18,719 INFO L280 TraceCheckUtils]: 25: Hoare triple {350#(not |main_#t~short17|)} assume #t~short17;havoc #t~mem14;havoc #t~short17;havoc #t~ret15;havoc #t~ret16; {332#false} is VALID [2020-07-10 14:42:18,720 INFO L280 TraceCheckUtils]: 26: Hoare triple {332#false} assume !false; {332#false} is VALID [2020-07-10 14:42:18,723 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:18,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089622716] [2020-07-10 14:42:18,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:18,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:42:18,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082176196] [2020-07-10 14:42:18,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 14:42:18,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:18,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:42:18,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:18,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:42:18,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:18,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:42:18,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:42:18,767 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2020-07-10 14:42:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:19,257 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-10 14:42:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:42:19,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 14:42:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 14:42:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 14:42:19,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-10 14:42:19,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:19,351 INFO L225 Difference]: With dead ends: 47 [2020-07-10 14:42:19,351 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:42:19,353 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:42:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:42:19,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:19,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:19,385 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:19,385 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:19,389 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-10 14:42:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-10 14:42:19,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:19,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:19,391 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:19,391 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:19,396 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-10 14:42:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-10 14:42:19,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:19,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:19,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:19,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-10 14:42:19,401 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 27 [2020-07-10 14:42:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:19,402 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-10 14:42:19,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:42:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-10 14:42:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 14:42:19,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:19,404 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:19,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:42:19,405 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash -425385736, now seen corresponding path program 1 times [2020-07-10 14:42:19,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:19,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673117758] [2020-07-10 14:42:19,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:19,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:42:19,599 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:42:19,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:42:19,639 WARN L170 areAnnotationChecker]: isnan_floatENTRY has no Hoare annotation [2020-07-10 14:42:19,639 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:42:19,640 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:19,640 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:19,640 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:42:19,640 WARN L170 areAnnotationChecker]: modf_floatENTRY has no Hoare annotation [2020-07-10 14:42:19,640 WARN L170 areAnnotationChecker]: isnan_floatFINAL has no Hoare annotation [2020-07-10 14:42:19,640 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:42:19,640 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:19,641 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:19,641 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-10 14:42:19,641 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-10 14:42:19,641 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-10 14:42:19,641 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-10 14:42:19,641 WARN L170 areAnnotationChecker]: isnan_floatEXIT has no Hoare annotation [2020-07-10 14:42:19,641 WARN L170 areAnnotationChecker]: isnan_floatEXIT has no Hoare annotation [2020-07-10 14:42:19,642 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:42:19,642 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:42:19,642 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-10 14:42:19,642 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 14:42:19,642 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 14:42:19,642 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2020-07-10 14:42:19,642 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-10 14:42:19,643 WARN L170 areAnnotationChecker]: L85-4 has no Hoare annotation [2020-07-10 14:42:19,643 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 14:42:19,643 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 14:42:19,643 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 14:42:19,643 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 14:42:19,643 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-10 14:42:19,643 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-10 14:42:19,644 WARN L170 areAnnotationChecker]: L85-6 has no Hoare annotation [2020-07-10 14:42:19,644 WARN L170 areAnnotationChecker]: L85-6 has no Hoare annotation [2020-07-10 14:42:19,644 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:19,644 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:19,644 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-10 14:42:19,644 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-10 14:42:19,644 WARN L170 areAnnotationChecker]: L85-3 has no Hoare annotation [2020-07-10 14:42:19,645 WARN L170 areAnnotationChecker]: L85-3 has no Hoare annotation [2020-07-10 14:42:19,645 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 14:42:19,645 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 14:42:19,645 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:42:19,646 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 14:42:19,646 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 14:42:19,646 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 14:42:19,646 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 14:42:19,646 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 14:42:19,647 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 14:42:19,647 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 14:42:19,647 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 14:42:19,647 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:42:19,647 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 14:42:19,647 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 14:42:19,648 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-10 14:42:19,648 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 14:42:19,648 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 14:42:19,648 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:19,648 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:19,648 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 14:42:19,648 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 14:42:19,649 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-10 14:42:19,649 WARN L170 areAnnotationChecker]: modf_floatFINAL has no Hoare annotation [2020-07-10 14:42:19,649 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 14:42:19,649 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-10 14:42:19,649 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 14:42:19,650 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 14:42:19,650 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:42:19,650 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:42:19,650 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 14:42:19,650 WARN L170 areAnnotationChecker]: modf_floatEXIT has no Hoare annotation [2020-07-10 14:42:19,651 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:42:19,651 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:42:19,651 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 14:42:19,651 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:19,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:42:19 BoogieIcfgContainer [2020-07-10 14:42:19,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:42:19,658 INFO L168 Benchmark]: Toolchain (without parser) took 3792.80 ms. Allocated memory was 143.7 MB in the beginning and 246.4 MB in the end (delta: 102.8 MB). Free memory was 101.5 MB in the beginning and 138.4 MB in the end (delta: -36.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:19,659 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:42:19,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.36 ms. Allocated memory was 143.7 MB in the beginning and 205.5 MB in the end (delta: 61.9 MB). Free memory was 101.5 MB in the beginning and 184.3 MB in the end (delta: -82.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:19,661 INFO L168 Benchmark]: Boogie Preprocessor took 99.35 ms. Allocated memory is still 205.5 MB. Free memory was 184.3 MB in the beginning and 180.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:19,662 INFO L168 Benchmark]: RCFGBuilder took 694.55 ms. Allocated memory is still 205.5 MB. Free memory was 180.9 MB in the beginning and 141.7 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:19,663 INFO L168 Benchmark]: TraceAbstraction took 2497.77 ms. Allocated memory was 205.5 MB in the beginning and 246.4 MB in the end (delta: 40.9 MB). Free memory was 141.7 MB in the beginning and 138.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:19,666 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.22 ms. Allocated memory is still 143.7 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 495.36 ms. Allocated memory was 143.7 MB in the beginning and 205.5 MB in the end (delta: 61.9 MB). Free memory was 101.5 MB in the beginning and 184.3 MB in the end (delta: -82.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.35 ms. Allocated memory is still 205.5 MB. Free memory was 184.3 MB in the beginning and 180.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 694.55 ms. Allocated memory is still 205.5 MB. Free memory was 180.9 MB in the beginning and 141.7 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2497.77 ms. Allocated memory was 205.5 MB in the beginning and 246.4 MB in the end (delta: 40.9 MB). Free memory was 141.7 MB in the beginning and 138.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 86]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryArithmeticFLOAToperation at line 80, overapproximation of bitwiseAnd at line 26. Possible FailurePath: [L11] static const float one_modf = 1.0; VAL [\old(one_modf)=8589934596, one_modf=1] [L80] float x = 0.0f / 0.0f; [L81] float iptr; VAL [iptr={3:0}, one_modf=1] [L82] CALL, EXPR modf_float(x, &iptr) VAL [\old(x)=8589934593, iptr={3:0}, one_modf=1] [L14] __int32_t i0, j0; [L15] __uint32_t i; VAL [\old(x)=8589934593, iptr={3:0}, iptr={3:0}, one_modf=1, x=8589934593] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=8589934593, i0=-1, iptr={3:0}, iptr={3:0}, one_modf=1, x=8589934593] [L22] COND TRUE j0 < 23 VAL [\old(x)=8589934593, i0=-1, iptr={3:0}, iptr={3:0}, j0=-1, one_modf=1, x=8589934593] [L23] COND TRUE j0 < 0 VAL [\old(x)=8589934593, i0=-1, iptr={3:0}, iptr={3:0}, j0=-1, one_modf=1, x=8589934593] [L25] ieee_float_shape_type sf_u; [L26] sf_u.word = (i0 & 0x80000000) [L27] EXPR sf_u.value [L27] (*iptr) = sf_u.value [L29] return x; VAL [\old(x)=8589934593, \result=8589934593, i0=-1, iptr={3:0}, iptr={3:0}, j0=-1, one_modf=1, x=8589934593] [L82] RET, EXPR modf_float(x, &iptr) VAL [iptr={3:0}, modf_float(x, &iptr)=8589934593, one_modf=1, x=8589934593] [L82] float res = modf_float(x, &iptr); [L85] EXPR \read(iptr) VAL [\read(iptr)=8589934599, iptr={3:0}, one_modf=1, res=8589934593, x=8589934593] [L85] CALL, EXPR isnan_float(iptr) VAL [\old(x)=8589934599, one_modf=1] [L73] return x != x; VAL [\old(x)=8589934599, \result=1, one_modf=1, x=8589934599] [L85] RET, EXPR isnan_float(iptr) VAL [\read(iptr)=8589934599, iptr={3:0}, isnan_float(iptr)=1, one_modf=1, res=8589934593, x=8589934593] [L85] isnan_float(iptr) && !isnan_float(res) VAL [\read(iptr)=8589934599, iptr={3:0}, isnan_float(iptr)=1, isnan_float(iptr) && !isnan_float(res)=1, one_modf=1, res=8589934593, x=8589934593] [L85] CALL, EXPR isnan_float(res) VAL [\old(x)=8589934593, one_modf=1] [L73] return x != x; VAL [\old(x)=8589934593, \result=0, one_modf=1, x=8589934593] [L85] RET, EXPR isnan_float(res) VAL [\read(iptr)=8589934599, iptr={3:0}, isnan_float(iptr)=1, isnan_float(iptr) && !isnan_float(res)=1, isnan_float(res)=0, one_modf=1, res=8589934593, x=8589934593] [L85] isnan_float(iptr) && !isnan_float(res) VAL [\read(iptr)=8589934599, iptr={3:0}, isnan_float(iptr)=1, isnan_float(iptr) && !isnan_float(res)=1, isnan_float(res)=0, one_modf=1, res=8589934593, x=8589934593] [L85] COND TRUE isnan_float(iptr) && !isnan_float(res) [L86] __VERIFIER_error() VAL [iptr={3:0}, one_modf=1, res=8589934593, x=8589934593] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 82 SDtfs, 50 SDslu, 35 SDs, 0 SdLazy, 146 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 2478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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...