/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:13:42,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:13:42,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:13:42,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:13:42,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:13:42,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:13:42,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:13:42,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:13:42,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:13:42,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:13:42,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:13:42,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:13:42,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:13:42,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:13:42,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:13:42,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:13:42,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:13:42,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:13:42,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:13:42,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:13:42,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:13:42,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:13:42,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:13:42,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:13:42,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:13:42,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:13:42,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:13:42,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:13:42,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:13:42,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:13:42,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:13:42,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:13:42,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:13:42,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:13:42,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:13:42,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:13:42,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:13:42,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:13:42,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:13:42,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:13:42,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:13:42,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:13:42,568 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:13:42,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:13:42,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:13:42,571 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:13:42,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:13:42,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:13:42,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:13:42,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:13:42,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:13:42,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:13:42,573 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:13:42,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:13:42,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:13:42,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:13:42,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:13:42,574 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:13:42,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:13:42,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:13:42,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:13:42,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:13:42,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:13:42,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:13:42,576 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:13:42,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:13:42,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:13:42,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:13:42,889 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:13:42,889 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:13:42,890 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c [2020-07-18 00:13:42,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255d1ee9d/e5b22ae707ff42979be20d38d486344b/FLAGd63c40ea1 [2020-07-18 00:13:43,432 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:13:43,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c [2020-07-18 00:13:43,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255d1ee9d/e5b22ae707ff42979be20d38d486344b/FLAGd63c40ea1 [2020-07-18 00:13:43,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255d1ee9d/e5b22ae707ff42979be20d38d486344b [2020-07-18 00:13:43,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:13:43,853 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:13:43,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:43,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:13:43,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:13:43,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:43" (1/1) ... [2020-07-18 00:13:43,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec844b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:43, skipping insertion in model container [2020-07-18 00:13:43,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:43" (1/1) ... [2020-07-18 00:13:43,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:13:43,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:13:44,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:44,127 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:13:44,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:44,295 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:13:44,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44 WrapperNode [2020-07-18 00:13:44,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:44,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:13:44,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:13:44,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:13:44,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... [2020-07-18 00:13:44,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... [2020-07-18 00:13:44,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... [2020-07-18 00:13:44,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... [2020-07-18 00:13:44,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... [2020-07-18 00:13:44,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... [2020-07-18 00:13:44,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... [2020-07-18 00:13:44,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:13:44,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:13:44,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:13:44,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:13:44,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:13:44,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:13:44,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:13:44,446 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2020-07-18 00:13:44,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-18 00:13:44,446 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2020-07-18 00:13:44,446 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:13:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:13:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-18 00:13:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2020-07-18 00:13:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:13:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 00:13:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:13:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:13:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:13:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 00:13:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-18 00:13:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2020-07-18 00:13:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:13:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-07-18 00:13:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:13:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:13:45,253 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:13:45,255 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-18 00:13:45,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:45 BoogieIcfgContainer [2020-07-18 00:13:45,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:13:45,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:13:45,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:13:45,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:13:45,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:13:43" (1/3) ... [2020-07-18 00:13:45,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d73a919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:45, skipping insertion in model container [2020-07-18 00:13:45,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:44" (2/3) ... [2020-07-18 00:13:45,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d73a919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:45, skipping insertion in model container [2020-07-18 00:13:45,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:45" (3/3) ... [2020-07-18 00:13:45,274 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211b.c [2020-07-18 00:13:45,285 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:13:45,293 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:13:45,307 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:13:45,333 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:13:45,333 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:13:45,334 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:13:45,334 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:13:45,334 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:13:45,334 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:13:45,335 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:13:45,335 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:13:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2020-07-18 00:13:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 00:13:45,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:45,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:13:45,382 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:45,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1432903932, now seen corresponding path program 1 times [2020-07-18 00:13:45,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:45,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528255539] [2020-07-18 00:13:45,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:45,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {199#(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; {171#true} is VALID [2020-07-18 00:13:45,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} #valid := #valid[0 := 0]; {171#true} is VALID [2020-07-18 00:13:45,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#true} assume 0 < #StackHeapBarrier; {171#true} is VALID [2020-07-18 00:13:45,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {171#true} ~one_modf~0 := 1.0; {171#true} is VALID [2020-07-18 00:13:45,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-18 00:13:45,613 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {171#true} {171#true} #279#return; {171#true} is VALID [2020-07-18 00:13:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:45,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {171#true} is VALID [2020-07-18 00:13:45,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {171#true} is VALID [2020-07-18 00:13:45,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#true} havoc ~i0~0; {171#true} is VALID [2020-07-18 00:13:45,648 INFO L280 TraceCheckUtils]: 3: Hoare triple {171#true} havoc ~j0~0; {171#true} is VALID [2020-07-18 00:13:45,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#true} havoc ~i~0; {171#true} is VALID [2020-07-18 00:13:45,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {171#true} assume !true; {172#false} is VALID [2020-07-18 00:13:45,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {172#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {172#false} is VALID [2020-07-18 00:13:45,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {172#false} assume ~j0~0 < 23; {172#false} is VALID [2020-07-18 00:13:45,651 INFO L280 TraceCheckUtils]: 8: Hoare triple {172#false} assume ~j0~0 < 0; {172#false} is VALID [2020-07-18 00:13:45,652 INFO L280 TraceCheckUtils]: 9: Hoare triple {172#false} assume !true; {172#false} is VALID [2020-07-18 00:13:45,652 INFO L280 TraceCheckUtils]: 10: Hoare triple {172#false} #res := ~x; {172#false} is VALID [2020-07-18 00:13:45,653 INFO L280 TraceCheckUtils]: 11: Hoare triple {172#false} assume true; {172#false} is VALID [2020-07-18 00:13:45,653 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {172#false} {171#true} #273#return; {172#false} is VALID [2020-07-18 00:13:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:45,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {171#true} is VALID [2020-07-18 00:13:45,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} havoc ~ix~2; {171#true} is VALID [2020-07-18 00:13:45,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#true} assume !true; {172#false} is VALID [2020-07-18 00:13:45,667 INFO L280 TraceCheckUtils]: 3: Hoare triple {172#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); {172#false} is VALID [2020-07-18 00:13:45,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {172#false} #res := (if 2139095040 == ~ix~2 then 1 else 0); {172#false} is VALID [2020-07-18 00:13:45,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {172#false} assume true; {172#false} is VALID [2020-07-18 00:13:45,668 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {172#false} {172#false} #275#return; {172#false} is VALID [2020-07-18 00:13:45,670 INFO L263 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {199#(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-18 00:13:45,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {199#(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; {171#true} is VALID [2020-07-18 00:13:45,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#true} #valid := #valid[0 := 0]; {171#true} is VALID [2020-07-18 00:13:45,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {171#true} assume 0 < #StackHeapBarrier; {171#true} is VALID [2020-07-18 00:13:45,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#true} ~one_modf~0 := 1.0; {171#true} is VALID [2020-07-18 00:13:45,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-18 00:13:45,673 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {171#true} {171#true} #279#return; {171#true} is VALID [2020-07-18 00:13:45,673 INFO L263 TraceCheckUtils]: 7: Hoare triple {171#true} call #t~ret24 := main(); {171#true} is VALID [2020-07-18 00:13:45,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {171#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); {171#true} is VALID [2020-07-18 00:13:45,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {171#true} SUMMARY for call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); srcloc: L105 {171#true} is VALID [2020-07-18 00:13:45,674 INFO L280 TraceCheckUtils]: 10: Hoare triple {171#true} SUMMARY for call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4); srcloc: L105-1 {171#true} is VALID [2020-07-18 00:13:45,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {171#true} havoc #t~nondet17; {171#true} is VALID [2020-07-18 00:13:45,677 INFO L263 TraceCheckUtils]: 12: Hoare triple {171#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {200#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:45,678 INFO L280 TraceCheckUtils]: 13: Hoare triple {200#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {171#true} is VALID [2020-07-18 00:13:45,678 INFO L280 TraceCheckUtils]: 14: Hoare triple {171#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {171#true} is VALID [2020-07-18 00:13:45,679 INFO L280 TraceCheckUtils]: 15: Hoare triple {171#true} havoc ~i0~0; {171#true} is VALID [2020-07-18 00:13:45,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {171#true} havoc ~j0~0; {171#true} is VALID [2020-07-18 00:13:45,680 INFO L280 TraceCheckUtils]: 17: Hoare triple {171#true} havoc ~i~0; {171#true} is VALID [2020-07-18 00:13:45,681 INFO L280 TraceCheckUtils]: 18: Hoare triple {171#true} assume !true; {172#false} is VALID [2020-07-18 00:13:45,681 INFO L280 TraceCheckUtils]: 19: Hoare triple {172#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {172#false} is VALID [2020-07-18 00:13:45,681 INFO L280 TraceCheckUtils]: 20: Hoare triple {172#false} assume ~j0~0 < 23; {172#false} is VALID [2020-07-18 00:13:45,682 INFO L280 TraceCheckUtils]: 21: Hoare triple {172#false} assume ~j0~0 < 0; {172#false} is VALID [2020-07-18 00:13:45,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {172#false} assume !true; {172#false} is VALID [2020-07-18 00:13:45,683 INFO L280 TraceCheckUtils]: 23: Hoare triple {172#false} #res := ~x; {172#false} is VALID [2020-07-18 00:13:45,683 INFO L280 TraceCheckUtils]: 24: Hoare triple {172#false} assume true; {172#false} is VALID [2020-07-18 00:13:45,683 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {172#false} {171#true} #273#return; {172#false} is VALID [2020-07-18 00:13:45,684 INFO L280 TraceCheckUtils]: 26: Hoare triple {172#false} ~res~0 := #t~ret18; {172#false} is VALID [2020-07-18 00:13:45,703 INFO L280 TraceCheckUtils]: 27: Hoare triple {172#false} havoc #t~ret18; {172#false} is VALID [2020-07-18 00:13:45,704 INFO L280 TraceCheckUtils]: 28: Hoare triple {172#false} SUMMARY for call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); srcloc: L109 {172#false} is VALID [2020-07-18 00:13:45,704 INFO L263 TraceCheckUtils]: 29: Hoare triple {172#false} call #t~ret20 := isinf_float(#t~mem19); {200#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:45,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {200#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {171#true} is VALID [2020-07-18 00:13:45,705 INFO L280 TraceCheckUtils]: 31: Hoare triple {171#true} havoc ~ix~2; {171#true} is VALID [2020-07-18 00:13:45,712 INFO L280 TraceCheckUtils]: 32: Hoare triple {171#true} assume !true; {172#false} is VALID [2020-07-18 00:13:45,712 INFO L280 TraceCheckUtils]: 33: Hoare triple {172#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); {172#false} is VALID [2020-07-18 00:13:45,712 INFO L280 TraceCheckUtils]: 34: Hoare triple {172#false} #res := (if 2139095040 == ~ix~2 then 1 else 0); {172#false} is VALID [2020-07-18 00:13:45,713 INFO L280 TraceCheckUtils]: 35: Hoare triple {172#false} assume true; {172#false} is VALID [2020-07-18 00:13:45,713 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {172#false} {172#false} #275#return; {172#false} is VALID [2020-07-18 00:13:45,713 INFO L280 TraceCheckUtils]: 37: Hoare triple {172#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {172#false} is VALID [2020-07-18 00:13:45,714 INFO L280 TraceCheckUtils]: 38: Hoare triple {172#false} #t~short23 := 0 != #t~ret20; {172#false} is VALID [2020-07-18 00:13:45,716 INFO L280 TraceCheckUtils]: 39: Hoare triple {172#false} assume !#t~short23; {172#false} is VALID [2020-07-18 00:13:45,717 INFO L280 TraceCheckUtils]: 40: Hoare triple {172#false} assume #t~short23; {172#false} is VALID [2020-07-18 00:13:45,718 INFO L280 TraceCheckUtils]: 41: Hoare triple {172#false} havoc #t~mem19; {172#false} is VALID [2020-07-18 00:13:45,718 INFO L280 TraceCheckUtils]: 42: Hoare triple {172#false} havoc #t~short22; {172#false} is VALID [2020-07-18 00:13:45,718 INFO L280 TraceCheckUtils]: 43: Hoare triple {172#false} havoc #t~short23; {172#false} is VALID [2020-07-18 00:13:45,719 INFO L280 TraceCheckUtils]: 44: Hoare triple {172#false} havoc #t~ret21; {172#false} is VALID [2020-07-18 00:13:45,719 INFO L280 TraceCheckUtils]: 45: Hoare triple {172#false} havoc #t~ret20; {172#false} is VALID [2020-07-18 00:13:45,720 INFO L280 TraceCheckUtils]: 46: Hoare triple {172#false} assume !false; {172#false} is VALID [2020-07-18 00:13:45,734 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-18 00:13:45,738 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:45,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528255539] [2020-07-18 00:13:45,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:45,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:13:45,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381197654] [2020-07-18 00:13:45,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2020-07-18 00:13:45,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:45,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:13:45,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:45,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:13:45,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:13:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:13:45,899 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 4 states. [2020-07-18 00:13:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:47,050 INFO L93 Difference]: Finished difference Result 315 states and 363 transitions. [2020-07-18 00:13:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:13:47,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2020-07-18 00:13:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2020-07-18 00:13:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2020-07-18 00:13:47,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 363 transitions. [2020-07-18 00:13:47,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:47,512 INFO L225 Difference]: With dead ends: 315 [2020-07-18 00:13:47,512 INFO L226 Difference]: Without dead ends: 153 [2020-07-18 00:13:47,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-18 00:13:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-18 00:13:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-07-18 00:13:47,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:47,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:47,683 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:47,683 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:47,697 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2020-07-18 00:13:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2020-07-18 00:13:47,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:47,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:47,701 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:47,701 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:47,710 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2020-07-18 00:13:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2020-07-18 00:13:47,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:47,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:47,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:47,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-18 00:13:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2020-07-18 00:13:47,722 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 47 [2020-07-18 00:13:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:47,722 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2020-07-18 00:13:47,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:13:47,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 157 transitions. [2020-07-18 00:13:47,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2020-07-18 00:13:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-18 00:13:47,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:47,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 00:13:47,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:13:47,922 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:47,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1562102553, now seen corresponding path program 1 times [2020-07-18 00:13:47,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:47,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143751780] [2020-07-18 00:13:47,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,115 INFO L280 TraceCheckUtils]: 0: Hoare triple {1502#(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; {1448#true} is VALID [2020-07-18 00:13:48,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {1448#true} #valid := #valid[0 := 0]; {1448#true} is VALID [2020-07-18 00:13:48,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {1448#true} assume 0 < #StackHeapBarrier; {1448#true} is VALID [2020-07-18 00:13:48,119 INFO L280 TraceCheckUtils]: 3: Hoare triple {1448#true} ~one_modf~0 := 1.0; {1448#true} is VALID [2020-07-18 00:13:48,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {1448#true} assume true; {1448#true} is VALID [2020-07-18 00:13:48,120 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1448#true} {1448#true} #279#return; {1448#true} is VALID [2020-07-18 00:13:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {1503#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1448#true} is VALID [2020-07-18 00:13:48,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {1448#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {1448#true} is VALID [2020-07-18 00:13:48,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {1448#true} havoc ~i0~0; {1448#true} is VALID [2020-07-18 00:13:48,203 INFO L280 TraceCheckUtils]: 3: Hoare triple {1448#true} havoc ~j0~0; {1448#true} is VALID [2020-07-18 00:13:48,203 INFO L280 TraceCheckUtils]: 4: Hoare triple {1448#true} havoc ~i~0; {1448#true} is VALID [2020-07-18 00:13:48,204 INFO L280 TraceCheckUtils]: 5: Hoare triple {1448#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L17-2 {1448#true} is VALID [2020-07-18 00:13:48,204 INFO L280 TraceCheckUtils]: 6: Hoare triple {1448#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18 {1448#true} is VALID [2020-07-18 00:13:48,204 INFO L280 TraceCheckUtils]: 7: Hoare triple {1448#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L19 {1448#true} is VALID [2020-07-18 00:13:48,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {1448#true} ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {1448#true} is VALID [2020-07-18 00:13:48,205 INFO L280 TraceCheckUtils]: 9: Hoare triple {1448#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L20-1 {1448#true} is VALID [2020-07-18 00:13:48,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {1448#true} havoc #t~mem0; {1448#true} is VALID [2020-07-18 00:13:48,206 INFO L280 TraceCheckUtils]: 11: Hoare triple {1448#true} havoc #t~union1; {1448#true} is VALID [2020-07-18 00:13:48,207 INFO L280 TraceCheckUtils]: 12: Hoare triple {1448#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L18-1 {1448#true} is VALID [2020-07-18 00:13:48,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {1448#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1448#true} is VALID [2020-07-18 00:13:48,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {1448#true} goto; {1448#true} is VALID [2020-07-18 00:13:48,209 INFO L280 TraceCheckUtils]: 15: Hoare triple {1448#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {1448#true} is VALID [2020-07-18 00:13:48,209 INFO L280 TraceCheckUtils]: 16: Hoare triple {1448#true} assume ~j0~0 < 23; {1448#true} is VALID [2020-07-18 00:13:48,209 INFO L280 TraceCheckUtils]: 17: Hoare triple {1448#true} assume ~j0~0 < 0; {1448#true} is VALID [2020-07-18 00:13:48,210 INFO L280 TraceCheckUtils]: 18: Hoare triple {1448#true} SUMMARY for call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L25-2 {1448#true} is VALID [2020-07-18 00:13:48,210 INFO L280 TraceCheckUtils]: 19: Hoare triple {1448#true} SUMMARY for call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L26 {1448#true} is VALID [2020-07-18 00:13:48,211 INFO L280 TraceCheckUtils]: 20: Hoare triple {1448#true} SUMMARY for call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L27 {1448#true} is VALID [2020-07-18 00:13:48,211 INFO L280 TraceCheckUtils]: 21: Hoare triple {1448#true} SUMMARY for call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); srcloc: L28 {1448#true} is VALID [2020-07-18 00:13:48,212 INFO L280 TraceCheckUtils]: 22: Hoare triple {1448#true} havoc #t~mem2; {1448#true} is VALID [2020-07-18 00:13:48,212 INFO L280 TraceCheckUtils]: 23: Hoare triple {1448#true} SUMMARY for call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); srcloc: L26-1 {1448#true} is VALID [2020-07-18 00:13:48,213 INFO L280 TraceCheckUtils]: 24: Hoare triple {1448#true} havoc ~#sf_u~0.base, ~#sf_u~0.offset; {1448#true} is VALID [2020-07-18 00:13:48,220 INFO L280 TraceCheckUtils]: 25: Hoare triple {1448#true} goto; {1448#true} is VALID [2020-07-18 00:13:48,220 INFO L280 TraceCheckUtils]: 26: Hoare triple {1448#true} #res := ~x; {1448#true} is VALID [2020-07-18 00:13:48,221 INFO L280 TraceCheckUtils]: 27: Hoare triple {1448#true} assume true; {1448#true} is VALID [2020-07-18 00:13:48,221 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1448#true} {1448#true} #273#return; {1448#true} is VALID [2020-07-18 00:13:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {1503#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1448#true} is VALID [2020-07-18 00:13:48,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {1448#true} havoc ~ix~2; {1448#true} is VALID [2020-07-18 00:13:48,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {1448#true} SUMMARY for call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4); srcloc: L88-2 {1448#true} is VALID [2020-07-18 00:13:48,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {1448#true} SUMMARY for call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4); srcloc: L89 {1448#true} is VALID [2020-07-18 00:13:48,274 INFO L280 TraceCheckUtils]: 4: Hoare triple {1448#true} SUMMARY for call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4); srcloc: L90 {1448#true} is VALID [2020-07-18 00:13:48,274 INFO L280 TraceCheckUtils]: 5: Hoare triple {1448#true} ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); {1448#true} is VALID [2020-07-18 00:13:48,275 INFO L280 TraceCheckUtils]: 6: Hoare triple {1448#true} SUMMARY for call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4); srcloc: L91-1 {1448#true} is VALID [2020-07-18 00:13:48,276 INFO L280 TraceCheckUtils]: 7: Hoare triple {1448#true} havoc #t~union16; {1448#true} is VALID [2020-07-18 00:13:48,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {1448#true} havoc #t~mem15; {1448#true} is VALID [2020-07-18 00:13:48,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {1448#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset); srcloc: L89-1 {1448#true} is VALID [2020-07-18 00:13:48,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {1448#true} havoc ~#gf_u~4.base, ~#gf_u~4.offset; {1448#true} is VALID [2020-07-18 00:13:48,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {1448#true} goto; {1448#true} is VALID [2020-07-18 00:13:48,278 INFO L280 TraceCheckUtils]: 12: Hoare triple {1448#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); {1448#true} is VALID [2020-07-18 00:13:48,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {1448#true} #res := (if 2139095040 == ~ix~2 then 1 else 0); {1448#true} is VALID [2020-07-18 00:13:48,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {1448#true} assume true; {1448#true} is VALID [2020-07-18 00:13:48,279 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1448#true} {1448#true} #275#return; {1448#true} is VALID [2020-07-18 00:13:48,297 INFO L263 TraceCheckUtils]: 0: Hoare triple {1448#true} call ULTIMATE.init(); {1502#(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-18 00:13:48,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {1502#(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; {1448#true} is VALID [2020-07-18 00:13:48,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {1448#true} #valid := #valid[0 := 0]; {1448#true} is VALID [2020-07-18 00:13:48,298 INFO L280 TraceCheckUtils]: 3: Hoare triple {1448#true} assume 0 < #StackHeapBarrier; {1448#true} is VALID [2020-07-18 00:13:48,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {1448#true} ~one_modf~0 := 1.0; {1448#true} is VALID [2020-07-18 00:13:48,299 INFO L280 TraceCheckUtils]: 5: Hoare triple {1448#true} assume true; {1448#true} is VALID [2020-07-18 00:13:48,299 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1448#true} {1448#true} #279#return; {1448#true} is VALID [2020-07-18 00:13:48,299 INFO L263 TraceCheckUtils]: 7: Hoare triple {1448#true} call #t~ret24 := main(); {1448#true} is VALID [2020-07-18 00:13:48,299 INFO L280 TraceCheckUtils]: 8: Hoare triple {1448#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); {1448#true} is VALID [2020-07-18 00:13:48,300 INFO L280 TraceCheckUtils]: 9: Hoare triple {1448#true} SUMMARY for call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); srcloc: L105 {1448#true} is VALID [2020-07-18 00:13:48,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {1448#true} SUMMARY for call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4); srcloc: L105-1 {1448#true} is VALID [2020-07-18 00:13:48,300 INFO L280 TraceCheckUtils]: 11: Hoare triple {1448#true} havoc #t~nondet17; {1448#true} is VALID [2020-07-18 00:13:48,302 INFO L263 TraceCheckUtils]: 12: Hoare triple {1448#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {1503#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:48,303 INFO L280 TraceCheckUtils]: 13: Hoare triple {1503#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1448#true} is VALID [2020-07-18 00:13:48,303 INFO L280 TraceCheckUtils]: 14: Hoare triple {1448#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {1448#true} is VALID [2020-07-18 00:13:48,303 INFO L280 TraceCheckUtils]: 15: Hoare triple {1448#true} havoc ~i0~0; {1448#true} is VALID [2020-07-18 00:13:48,304 INFO L280 TraceCheckUtils]: 16: Hoare triple {1448#true} havoc ~j0~0; {1448#true} is VALID [2020-07-18 00:13:48,304 INFO L280 TraceCheckUtils]: 17: Hoare triple {1448#true} havoc ~i~0; {1448#true} is VALID [2020-07-18 00:13:48,304 INFO L280 TraceCheckUtils]: 18: Hoare triple {1448#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L17-2 {1448#true} is VALID [2020-07-18 00:13:48,304 INFO L280 TraceCheckUtils]: 19: Hoare triple {1448#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18 {1448#true} is VALID [2020-07-18 00:13:48,305 INFO L280 TraceCheckUtils]: 20: Hoare triple {1448#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L19 {1448#true} is VALID [2020-07-18 00:13:48,305 INFO L280 TraceCheckUtils]: 21: Hoare triple {1448#true} ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {1448#true} is VALID [2020-07-18 00:13:48,305 INFO L280 TraceCheckUtils]: 22: Hoare triple {1448#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L20-1 {1448#true} is VALID [2020-07-18 00:13:48,306 INFO L280 TraceCheckUtils]: 23: Hoare triple {1448#true} havoc #t~mem0; {1448#true} is VALID [2020-07-18 00:13:48,306 INFO L280 TraceCheckUtils]: 24: Hoare triple {1448#true} havoc #t~union1; {1448#true} is VALID [2020-07-18 00:13:48,306 INFO L280 TraceCheckUtils]: 25: Hoare triple {1448#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L18-1 {1448#true} is VALID [2020-07-18 00:13:48,310 INFO L280 TraceCheckUtils]: 26: Hoare triple {1448#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1448#true} is VALID [2020-07-18 00:13:48,310 INFO L280 TraceCheckUtils]: 27: Hoare triple {1448#true} goto; {1448#true} is VALID [2020-07-18 00:13:48,310 INFO L280 TraceCheckUtils]: 28: Hoare triple {1448#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {1448#true} is VALID [2020-07-18 00:13:48,311 INFO L280 TraceCheckUtils]: 29: Hoare triple {1448#true} assume ~j0~0 < 23; {1448#true} is VALID [2020-07-18 00:13:48,311 INFO L280 TraceCheckUtils]: 30: Hoare triple {1448#true} assume ~j0~0 < 0; {1448#true} is VALID [2020-07-18 00:13:48,311 INFO L280 TraceCheckUtils]: 31: Hoare triple {1448#true} SUMMARY for call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L25-2 {1448#true} is VALID [2020-07-18 00:13:48,311 INFO L280 TraceCheckUtils]: 32: Hoare triple {1448#true} SUMMARY for call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L26 {1448#true} is VALID [2020-07-18 00:13:48,312 INFO L280 TraceCheckUtils]: 33: Hoare triple {1448#true} SUMMARY for call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L27 {1448#true} is VALID [2020-07-18 00:13:48,312 INFO L280 TraceCheckUtils]: 34: Hoare triple {1448#true} SUMMARY for call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); srcloc: L28 {1448#true} is VALID [2020-07-18 00:13:48,312 INFO L280 TraceCheckUtils]: 35: Hoare triple {1448#true} havoc #t~mem2; {1448#true} is VALID [2020-07-18 00:13:48,312 INFO L280 TraceCheckUtils]: 36: Hoare triple {1448#true} SUMMARY for call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); srcloc: L26-1 {1448#true} is VALID [2020-07-18 00:13:48,313 INFO L280 TraceCheckUtils]: 37: Hoare triple {1448#true} havoc ~#sf_u~0.base, ~#sf_u~0.offset; {1448#true} is VALID [2020-07-18 00:13:48,313 INFO L280 TraceCheckUtils]: 38: Hoare triple {1448#true} goto; {1448#true} is VALID [2020-07-18 00:13:48,313 INFO L280 TraceCheckUtils]: 39: Hoare triple {1448#true} #res := ~x; {1448#true} is VALID [2020-07-18 00:13:48,313 INFO L280 TraceCheckUtils]: 40: Hoare triple {1448#true} assume true; {1448#true} is VALID [2020-07-18 00:13:48,314 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1448#true} {1448#true} #273#return; {1448#true} is VALID [2020-07-18 00:13:48,314 INFO L280 TraceCheckUtils]: 42: Hoare triple {1448#true} ~res~0 := #t~ret18; {1448#true} is VALID [2020-07-18 00:13:48,314 INFO L280 TraceCheckUtils]: 43: Hoare triple {1448#true} havoc #t~ret18; {1448#true} is VALID [2020-07-18 00:13:48,315 INFO L280 TraceCheckUtils]: 44: Hoare triple {1448#true} SUMMARY for call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); srcloc: L109 {1448#true} is VALID [2020-07-18 00:13:48,316 INFO L263 TraceCheckUtils]: 45: Hoare triple {1448#true} call #t~ret20 := isinf_float(#t~mem19); {1503#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:48,316 INFO L280 TraceCheckUtils]: 46: Hoare triple {1503#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1448#true} is VALID [2020-07-18 00:13:48,316 INFO L280 TraceCheckUtils]: 47: Hoare triple {1448#true} havoc ~ix~2; {1448#true} is VALID [2020-07-18 00:13:48,317 INFO L280 TraceCheckUtils]: 48: Hoare triple {1448#true} SUMMARY for call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4); srcloc: L88-2 {1448#true} is VALID [2020-07-18 00:13:48,317 INFO L280 TraceCheckUtils]: 49: Hoare triple {1448#true} SUMMARY for call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4); srcloc: L89 {1448#true} is VALID [2020-07-18 00:13:48,317 INFO L280 TraceCheckUtils]: 50: Hoare triple {1448#true} SUMMARY for call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4); srcloc: L90 {1448#true} is VALID [2020-07-18 00:13:48,318 INFO L280 TraceCheckUtils]: 51: Hoare triple {1448#true} ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); {1448#true} is VALID [2020-07-18 00:13:48,318 INFO L280 TraceCheckUtils]: 52: Hoare triple {1448#true} SUMMARY for call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4); srcloc: L91-1 {1448#true} is VALID [2020-07-18 00:13:48,318 INFO L280 TraceCheckUtils]: 53: Hoare triple {1448#true} havoc #t~union16; {1448#true} is VALID [2020-07-18 00:13:48,318 INFO L280 TraceCheckUtils]: 54: Hoare triple {1448#true} havoc #t~mem15; {1448#true} is VALID [2020-07-18 00:13:48,319 INFO L280 TraceCheckUtils]: 55: Hoare triple {1448#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset); srcloc: L89-1 {1448#true} is VALID [2020-07-18 00:13:48,319 INFO L280 TraceCheckUtils]: 56: Hoare triple {1448#true} havoc ~#gf_u~4.base, ~#gf_u~4.offset; {1448#true} is VALID [2020-07-18 00:13:48,319 INFO L280 TraceCheckUtils]: 57: Hoare triple {1448#true} goto; {1448#true} is VALID [2020-07-18 00:13:48,319 INFO L280 TraceCheckUtils]: 58: Hoare triple {1448#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); {1448#true} is VALID [2020-07-18 00:13:48,320 INFO L280 TraceCheckUtils]: 59: Hoare triple {1448#true} #res := (if 2139095040 == ~ix~2 then 1 else 0); {1448#true} is VALID [2020-07-18 00:13:48,320 INFO L280 TraceCheckUtils]: 60: Hoare triple {1448#true} assume true; {1448#true} is VALID [2020-07-18 00:13:48,321 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {1448#true} {1448#true} #275#return; {1448#true} is VALID [2020-07-18 00:13:48,321 INFO L280 TraceCheckUtils]: 62: Hoare triple {1448#true} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {1448#true} is VALID [2020-07-18 00:13:48,321 INFO L280 TraceCheckUtils]: 63: Hoare triple {1448#true} #t~short23 := 0 != #t~ret20; {1448#true} is VALID [2020-07-18 00:13:48,322 INFO L280 TraceCheckUtils]: 64: Hoare triple {1448#true} assume !#t~short23; {1501#(not |main_#t~short23|)} is VALID [2020-07-18 00:13:48,323 INFO L280 TraceCheckUtils]: 65: Hoare triple {1501#(not |main_#t~short23|)} assume #t~short23; {1449#false} is VALID [2020-07-18 00:13:48,323 INFO L280 TraceCheckUtils]: 66: Hoare triple {1449#false} havoc #t~mem19; {1449#false} is VALID [2020-07-18 00:13:48,323 INFO L280 TraceCheckUtils]: 67: Hoare triple {1449#false} havoc #t~short22; {1449#false} is VALID [2020-07-18 00:13:48,324 INFO L280 TraceCheckUtils]: 68: Hoare triple {1449#false} havoc #t~short23; {1449#false} is VALID [2020-07-18 00:13:48,324 INFO L280 TraceCheckUtils]: 69: Hoare triple {1449#false} havoc #t~ret21; {1449#false} is VALID [2020-07-18 00:13:48,324 INFO L280 TraceCheckUtils]: 70: Hoare triple {1449#false} havoc #t~ret20; {1449#false} is VALID [2020-07-18 00:13:48,325 INFO L280 TraceCheckUtils]: 71: Hoare triple {1449#false} assume !false; {1449#false} is VALID [2020-07-18 00:13:48,331 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-18 00:13:48,332 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:48,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143751780] [2020-07-18 00:13:48,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:48,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:13:48,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692455886] [2020-07-18 00:13:48,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-07-18 00:13:48,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:48,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:13:48,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:48,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:13:48,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:48,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:13:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:13:48,406 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 5 states. [2020-07-18 00:13:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:49,290 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2020-07-18 00:13:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:13:49,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-07-18 00:13:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:13:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2020-07-18 00:13:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:13:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2020-07-18 00:13:49,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 164 transitions. [2020-07-18 00:13:49,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:49,480 INFO L225 Difference]: With dead ends: 161 [2020-07-18 00:13:49,481 INFO L226 Difference]: Without dead ends: 153 [2020-07-18 00:13:49,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-18 00:13:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-18 00:13:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-07-18 00:13:49,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:49,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:49,597 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:49,598 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:49,609 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2020-07-18 00:13:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2020-07-18 00:13:49,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:49,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:49,611 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:49,611 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 153 states. [2020-07-18 00:13:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:49,622 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2020-07-18 00:13:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2020-07-18 00:13:49,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:49,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:49,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:49,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-18 00:13:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2020-07-18 00:13:49,633 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 72 [2020-07-18 00:13:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:49,634 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2020-07-18 00:13:49,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:13:49,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 156 transitions. [2020-07-18 00:13:49,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2020-07-18 00:13:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-18 00:13:49,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:49,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 00:13:49,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:13:49,806 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:49,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash 934667084, now seen corresponding path program 1 times [2020-07-18 00:13:49,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:49,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325372837] [2020-07-18 00:13:49,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:13:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:13:50,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:13:50,002 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:283) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:13:50,011 INFO L168 Benchmark]: Toolchain (without parser) took 6158.17 ms. Allocated memory was 135.8 MB in the beginning and 296.7 MB in the end (delta: 161.0 MB). Free memory was 99.7 MB in the beginning and 101.2 MB in the end (delta: -1.5 MB). Peak memory consumption was 159.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:50,015 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:13:50,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.51 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 177.6 MB in the end (delta: -77.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:50,019 INFO L168 Benchmark]: Boogie Preprocessor took 71.97 ms. Allocated memory is still 200.8 MB. Free memory was 177.6 MB in the beginning and 175.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:50,020 INFO L168 Benchmark]: RCFGBuilder took 890.63 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 111.6 MB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:50,021 INFO L168 Benchmark]: TraceAbstraction took 4741.47 ms. Allocated memory was 200.8 MB in the beginning and 296.7 MB in the end (delta: 95.9 MB). Free memory was 110.6 MB in the beginning and 101.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:50,034 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.18 ms. Allocated memory is still 135.8 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 442.51 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 177.6 MB in the end (delta: -77.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.97 ms. Allocated memory is still 200.8 MB. Free memory was 177.6 MB in the beginning and 175.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 890.63 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 111.6 MB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4741.47 ms. Allocated memory was 200.8 MB in the beginning and 296.7 MB in the end (delta: 95.9 MB). Free memory was 110.6 MB in the beginning and 101.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...