/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:39:09,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:39:09,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:39:09,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:39:09,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:39:09,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:39:09,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:39:09,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:39:09,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:39:09,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:39:09,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:39:09,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:39:09,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:39:09,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:39:09,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:39:09,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:39:09,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:39:09,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:39:09,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:39:09,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:39:09,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:39:09,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:39:09,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:39:09,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:39:09,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:39:09,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:39:09,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:39:09,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:39:09,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:39:09,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:39:09,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:39:09,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:39:09,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:39:09,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:39:09,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:39:09,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:39:09,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:39:09,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:39:09,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:39:09,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:39:09,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:39:09,606 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 04:39:09,625 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:39:09,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:39:09,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:39:09,627 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:39:09,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:39:09,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:39:09,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:39:09,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:39:09,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:39:09,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:39:09,630 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:39:09,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:39:09,630 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:39:09,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:39:09,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:39:09,631 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:39:09,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:39:09,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:39:09,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:39:09,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:39:09,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:39:09,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:39:09,633 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 04:39:09,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:39:09,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:39:09,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:39:09,977 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:39:09,977 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:39:09,978 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-18 04:39:10,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e6ff48b/126c965e01834f6a9f0732843d61b093/FLAG4af6335a3 [2020-07-18 04:39:10,541 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:39:10,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-18 04:39:10,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e6ff48b/126c965e01834f6a9f0732843d61b093/FLAG4af6335a3 [2020-07-18 04:39:10,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e6ff48b/126c965e01834f6a9f0732843d61b093 [2020-07-18 04:39:10,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:39:10,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:39:10,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:39:10,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:39:10,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:39:10,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:39:10" (1/1) ... [2020-07-18 04:39:10,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55456146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:10, skipping insertion in model container [2020-07-18 04:39:10,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:39:10" (1/1) ... [2020-07-18 04:39:10,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:39:10,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:39:11,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:39:11,132 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:39:11,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:39:11,282 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:39:11,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11 WrapperNode [2020-07-18 04:39:11,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:39:11,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:39:11,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:39:11,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:39:11,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (1/1) ... [2020-07-18 04:39:11,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (1/1) ... [2020-07-18 04:39:11,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (1/1) ... [2020-07-18 04:39:11,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (1/1) ... [2020-07-18 04:39:11,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (1/1) ... [2020-07-18 04:39:11,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (1/1) ... [2020-07-18 04:39:11,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (1/1) ... [2020-07-18 04:39:11,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:39:11,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:39:11,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:39:11,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:39:11,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (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 04:39:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:39:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:39:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-18 04:39:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-18 04:39:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-18 04:39:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:39:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:39:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-18 04:39:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-18 04:39:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 04:39:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 04:39:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 04:39:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 04:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-18 04:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-18 04:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:39:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 04:39:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 04:39:11,961 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:39:11,962 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 04:39:11,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:39:11 BoogieIcfgContainer [2020-07-18 04:39:11,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:39:11,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:39:11,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:39:11,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:39:11,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:39:10" (1/3) ... [2020-07-18 04:39:11,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ed7707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:39:11, skipping insertion in model container [2020-07-18 04:39:11,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:11" (2/3) ... [2020-07-18 04:39:11,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ed7707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:39:11, skipping insertion in model container [2020-07-18 04:39:11,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:39:11" (3/3) ... [2020-07-18 04:39:11,985 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2020-07-18 04:39:11,996 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:39:12,005 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:39:12,020 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:39:12,044 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:39:12,044 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:39:12,044 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:39:12,044 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:39:12,044 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:39:12,045 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:39:12,045 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:39:12,045 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:39:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2020-07-18 04:39:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 04:39:12,077 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:12,079 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] [2020-07-18 04:39:12,079 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1930633076, now seen corresponding path program 1 times [2020-07-18 04:39:12,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:12,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190710845] [2020-07-18 04:39:12,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {98#true} is VALID [2020-07-18 04:39:12,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-18 04:39:12,317 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-18 04:39:12,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-18 04:39:12,318 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-18 04:39:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-18 04:39:12,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-18 04:39:12,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-18 04:39:12,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-18 04:39:12,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-18 04:39:12,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-18 04:39:12,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 04:39:12,377 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-18 04:39:12,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-18 04:39:12,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-18 04:39:12,380 INFO L263 TraceCheckUtils]: 2: Hoare triple {98#true} call #t~ret4 := __fpclassify_double(~x); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:12,381 INFO L280 TraceCheckUtils]: 3: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-18 04:39:12,381 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-18 04:39:12,382 INFO L280 TraceCheckUtils]: 5: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-18 04:39:12,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-18 04:39:12,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-18 04:39:12,383 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-18 04:39:12,384 INFO L280 TraceCheckUtils]: 9: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 04:39:12,384 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-18 04:39:12,385 INFO L280 TraceCheckUtils]: 11: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-18 04:39:12,385 INFO L280 TraceCheckUtils]: 12: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-18 04:39:12,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-18 04:39:12,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-18 04:39:12,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 04:39:12,386 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-18 04:39:12,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 04:39:12,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {98#true} is VALID [2020-07-18 04:39:12,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-18 04:39:12,391 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-18 04:39:12,391 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-18 04:39:12,392 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-18 04:39:12,392 INFO L263 TraceCheckUtils]: 6: Hoare triple {98#true} call #t~ret12 := main(); {98#true} is VALID [2020-07-18 04:39:12,392 INFO L280 TraceCheckUtils]: 7: Hoare triple {98#true} ~x~0 := 0.0; {98#true} is VALID [2020-07-18 04:39:12,393 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#true} ~y~0 := ~someUnaryDOUBLEoperation(0.0); {98#true} is VALID [2020-07-18 04:39:12,395 INFO L263 TraceCheckUtils]: 9: Hoare triple {98#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:12,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-18 04:39:12,396 INFO L280 TraceCheckUtils]: 11: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-18 04:39:12,398 INFO L263 TraceCheckUtils]: 12: Hoare triple {98#true} call #t~ret4 := __fpclassify_double(~x); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:12,398 INFO L280 TraceCheckUtils]: 13: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-18 04:39:12,399 INFO L280 TraceCheckUtils]: 14: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-18 04:39:12,399 INFO L280 TraceCheckUtils]: 15: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-18 04:39:12,400 INFO L280 TraceCheckUtils]: 16: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-18 04:39:12,400 INFO L280 TraceCheckUtils]: 17: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-18 04:39:12,401 INFO L280 TraceCheckUtils]: 18: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-18 04:39:12,401 INFO L280 TraceCheckUtils]: 19: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 04:39:12,401 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-18 04:39:12,402 INFO L280 TraceCheckUtils]: 21: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-18 04:39:12,402 INFO L280 TraceCheckUtils]: 22: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-18 04:39:12,402 INFO L280 TraceCheckUtils]: 23: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-18 04:39:12,403 INFO L280 TraceCheckUtils]: 24: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-18 04:39:12,403 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-18 04:39:12,403 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-18 04:39:12,404 INFO L280 TraceCheckUtils]: 27: Hoare triple {99#false} ~res~0 := #t~ret9; {99#false} is VALID [2020-07-18 04:39:12,404 INFO L280 TraceCheckUtils]: 28: Hoare triple {99#false} havoc #t~ret9; {99#false} is VALID [2020-07-18 04:39:12,404 INFO L280 TraceCheckUtils]: 29: Hoare triple {99#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {99#false} is VALID [2020-07-18 04:39:12,405 INFO L280 TraceCheckUtils]: 30: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-18 04:39:12,405 INFO L280 TraceCheckUtils]: 31: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-18 04:39:12,405 INFO L280 TraceCheckUtils]: 32: Hoare triple {99#false} havoc #t~ret10; {99#false} is VALID [2020-07-18 04:39:12,406 INFO L280 TraceCheckUtils]: 33: Hoare triple {99#false} havoc #t~short11; {99#false} is VALID [2020-07-18 04:39:12,406 INFO L280 TraceCheckUtils]: 34: Hoare triple {99#false} assume !false; {99#false} is VALID [2020-07-18 04:39:12,411 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 04:39:12,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190710845] [2020-07-18 04:39:12,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:39:12,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 04:39:12,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29540311] [2020-07-18 04:39:12,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-18 04:39:12,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:39:12,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 04:39:12,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:12,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 04:39:12,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:39:12,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 04:39:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 04:39:12,510 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2020-07-18 04:39:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:13,247 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2020-07-18 04:39:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 04:39:13,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-18 04:39:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:39:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 04:39:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-18 04:39:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 04:39:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-18 04:39:13,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2020-07-18 04:39:13,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:13,613 INFO L225 Difference]: With dead ends: 176 [2020-07-18 04:39:13,613 INFO L226 Difference]: Without dead ends: 87 [2020-07-18 04:39:13,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:39:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-18 04:39:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-07-18 04:39:13,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:39:13,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2020-07-18 04:39:13,750 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-18 04:39:13,750 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-18 04:39:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:13,759 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-18 04:39:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-18 04:39:13,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:13,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:13,761 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-18 04:39:13,761 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-18 04:39:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:13,769 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-18 04:39:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-18 04:39:13,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:13,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:13,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:39:13,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:39:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-18 04:39:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-07-18 04:39:13,779 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 35 [2020-07-18 04:39:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:39:13,779 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-07-18 04:39:13,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 04:39:13,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 95 transitions. [2020-07-18 04:39:13,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-18 04:39:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 04:39:13,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:13,888 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] [2020-07-18 04:39:13,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:39:13,888 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash -330335414, now seen corresponding path program 1 times [2020-07-18 04:39:13,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:13,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623451832] [2020-07-18 04:39:13,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:14,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {837#true} is VALID [2020-07-18 04:39:14,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-18 04:39:14,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-18 04:39:14,017 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-18 04:39:14,017 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-18 04:39:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:14,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-18 04:39:14,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-18 04:39:14,120 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-18 04:39:14,121 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-18 04:39:14,121 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-18 04:39:14,122 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-18 04:39:14,122 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-18 04:39:14,122 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-18 04:39:14,122 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-18 04:39:14,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-18 04:39:14,123 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-18 04:39:14,123 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-18 04:39:14,124 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-18 04:39:14,124 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-18 04:39:14,124 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-18 04:39:14,125 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-18 04:39:14,125 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-18 04:39:14,125 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-18 04:39:14,126 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-18 04:39:14,126 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:14,127 INFO L280 TraceCheckUtils]: 20: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:14,128 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:14,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-18 04:39:14,130 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-18 04:39:14,131 INFO L263 TraceCheckUtils]: 2: Hoare triple {837#true} call #t~ret4 := __fpclassify_double(~x); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:14,131 INFO L280 TraceCheckUtils]: 3: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-18 04:39:14,131 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-18 04:39:14,132 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-18 04:39:14,132 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-18 04:39:14,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-18 04:39:14,133 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-18 04:39:14,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-18 04:39:14,133 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-18 04:39:14,134 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-18 04:39:14,134 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-18 04:39:14,134 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-18 04:39:14,134 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-18 04:39:14,135 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-18 04:39:14,135 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-18 04:39:14,135 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-18 04:39:14,136 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-18 04:39:14,136 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-18 04:39:14,136 INFO L280 TraceCheckUtils]: 20: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-18 04:39:14,137 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-18 04:39:14,137 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:14,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:14,139 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:14,140 INFO L280 TraceCheckUtils]: 25: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:14,141 INFO L280 TraceCheckUtils]: 26: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-18 04:39:14,141 INFO L280 TraceCheckUtils]: 27: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-18 04:39:14,141 INFO L280 TraceCheckUtils]: 28: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-18 04:39:14,142 INFO L280 TraceCheckUtils]: 29: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-18 04:39:14,142 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-18 04:39:14,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {837#true} call ULTIMATE.init(); {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 04:39:14,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {837#true} is VALID [2020-07-18 04:39:14,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-18 04:39:14,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-18 04:39:14,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-18 04:39:14,146 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-18 04:39:14,146 INFO L263 TraceCheckUtils]: 6: Hoare triple {837#true} call #t~ret12 := main(); {837#true} is VALID [2020-07-18 04:39:14,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} ~x~0 := 0.0; {837#true} is VALID [2020-07-18 04:39:14,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} ~y~0 := ~someUnaryDOUBLEoperation(0.0); {837#true} is VALID [2020-07-18 04:39:14,148 INFO L263 TraceCheckUtils]: 9: Hoare triple {837#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:14,149 INFO L280 TraceCheckUtils]: 10: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-18 04:39:14,149 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-18 04:39:14,150 INFO L263 TraceCheckUtils]: 12: Hoare triple {837#true} call #t~ret4 := __fpclassify_double(~x); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:14,151 INFO L280 TraceCheckUtils]: 13: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-18 04:39:14,151 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-18 04:39:14,151 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-18 04:39:14,151 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-18 04:39:14,152 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-18 04:39:14,152 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-18 04:39:14,152 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-18 04:39:14,153 INFO L280 TraceCheckUtils]: 20: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-18 04:39:14,153 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-18 04:39:14,153 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-18 04:39:14,154 INFO L280 TraceCheckUtils]: 23: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-18 04:39:14,154 INFO L280 TraceCheckUtils]: 24: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-18 04:39:14,154 INFO L280 TraceCheckUtils]: 25: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-18 04:39:14,154 INFO L280 TraceCheckUtils]: 26: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-18 04:39:14,155 INFO L280 TraceCheckUtils]: 27: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-18 04:39:14,155 INFO L280 TraceCheckUtils]: 28: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-18 04:39:14,155 INFO L280 TraceCheckUtils]: 29: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-18 04:39:14,155 INFO L280 TraceCheckUtils]: 30: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-18 04:39:14,156 INFO L280 TraceCheckUtils]: 31: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-18 04:39:14,157 INFO L280 TraceCheckUtils]: 32: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:14,157 INFO L280 TraceCheckUtils]: 33: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:14,159 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:14,159 INFO L280 TraceCheckUtils]: 35: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:14,160 INFO L280 TraceCheckUtils]: 36: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-18 04:39:14,161 INFO L280 TraceCheckUtils]: 37: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-18 04:39:14,161 INFO L280 TraceCheckUtils]: 38: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-18 04:39:14,161 INFO L280 TraceCheckUtils]: 39: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-18 04:39:14,161 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-18 04:39:14,162 INFO L280 TraceCheckUtils]: 41: Hoare triple {838#false} ~res~0 := #t~ret9; {838#false} is VALID [2020-07-18 04:39:14,162 INFO L280 TraceCheckUtils]: 42: Hoare triple {838#false} havoc #t~ret9; {838#false} is VALID [2020-07-18 04:39:14,162 INFO L280 TraceCheckUtils]: 43: Hoare triple {838#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {838#false} is VALID [2020-07-18 04:39:14,163 INFO L280 TraceCheckUtils]: 44: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-18 04:39:14,163 INFO L280 TraceCheckUtils]: 45: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-18 04:39:14,163 INFO L280 TraceCheckUtils]: 46: Hoare triple {838#false} havoc #t~ret10; {838#false} is VALID [2020-07-18 04:39:14,164 INFO L280 TraceCheckUtils]: 47: Hoare triple {838#false} havoc #t~short11; {838#false} is VALID [2020-07-18 04:39:14,164 INFO L280 TraceCheckUtils]: 48: Hoare triple {838#false} assume !false; {838#false} is VALID [2020-07-18 04:39:14,167 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 04:39:14,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623451832] [2020-07-18 04:39:14,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:39:14,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 04:39:14,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581651148] [2020-07-18 04:39:14,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-18 04:39:14,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:39:14,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:39:14,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:14,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:39:14,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:39:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:39:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:39:14,223 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2020-07-18 04:39:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:14,940 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2020-07-18 04:39:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:39:14,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-18 04:39:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:39:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 04:39:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 04:39:14,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-18 04:39:15,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:15,116 INFO L225 Difference]: With dead ends: 123 [2020-07-18 04:39:15,116 INFO L226 Difference]: Without dead ends: 92 [2020-07-18 04:39:15,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:39:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-18 04:39:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-07-18 04:39:15,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:39:15,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2020-07-18 04:39:15,195 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2020-07-18 04:39:15,196 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2020-07-18 04:39:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:15,201 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-18 04:39:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-18 04:39:15,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:15,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:15,203 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2020-07-18 04:39:15,203 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2020-07-18 04:39:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:15,208 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-18 04:39:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-18 04:39:15,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:15,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:15,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:39:15,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:39:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-18 04:39:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-18 04:39:15,215 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 49 [2020-07-18 04:39:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:39:15,215 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-18 04:39:15,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:39:15,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-18 04:39:15,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-18 04:39:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 04:39:15,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:15,334 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] [2020-07-18 04:39:15,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:39:15,334 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:15,335 INFO L82 PathProgramCache]: Analyzing trace with hash -389367439, now seen corresponding path program 1 times [2020-07-18 04:39:15,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:15,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215033637] [2020-07-18 04:39:15,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:15,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1518#true} is VALID [2020-07-18 04:39:15,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-18 04:39:15,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-18 04:39:15,428 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-18 04:39:15,428 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-18 04:39:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:15,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-18 04:39:15,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-18 04:39:15,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-18 04:39:15,571 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-18 04:39:15,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-18 04:39:15,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-18 04:39:15,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-18 04:39:15,572 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-18 04:39:15,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-18 04:39:15,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-18 04:39:15,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-18 04:39:15,573 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-18 04:39:15,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-18 04:39:15,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-18 04:39:15,574 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-18 04:39:15,574 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-18 04:39:15,574 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-18 04:39:15,575 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-18 04:39:15,575 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-18 04:39:15,575 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-18 04:39:15,575 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-18 04:39:15,576 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-18 04:39:15,577 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:15,577 INFO L280 TraceCheckUtils]: 23: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:15,579 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:15,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-18 04:39:15,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-18 04:39:15,582 INFO L263 TraceCheckUtils]: 2: Hoare triple {1518#true} call #t~ret4 := __fpclassify_double(~x); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:15,582 INFO L280 TraceCheckUtils]: 3: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-18 04:39:15,582 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-18 04:39:15,582 INFO L280 TraceCheckUtils]: 5: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-18 04:39:15,583 INFO L280 TraceCheckUtils]: 6: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-18 04:39:15,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-18 04:39:15,583 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-18 04:39:15,584 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-18 04:39:15,584 INFO L280 TraceCheckUtils]: 10: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-18 04:39:15,584 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-18 04:39:15,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-18 04:39:15,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-18 04:39:15,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-18 04:39:15,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-18 04:39:15,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-18 04:39:15,586 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-18 04:39:15,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-18 04:39:15,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-18 04:39:15,586 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-18 04:39:15,587 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-18 04:39:15,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-18 04:39:15,587 INFO L280 TraceCheckUtils]: 23: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-18 04:39:15,588 INFO L280 TraceCheckUtils]: 24: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-18 04:39:15,589 INFO L280 TraceCheckUtils]: 25: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:15,592 INFO L280 TraceCheckUtils]: 26: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:15,595 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:15,596 INFO L280 TraceCheckUtils]: 28: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:15,597 INFO L280 TraceCheckUtils]: 29: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-18 04:39:15,597 INFO L280 TraceCheckUtils]: 30: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-18 04:39:15,597 INFO L280 TraceCheckUtils]: 31: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-18 04:39:15,598 INFO L280 TraceCheckUtils]: 32: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-18 04:39:15,598 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-18 04:39:15,601 INFO L263 TraceCheckUtils]: 0: Hoare triple {1518#true} call ULTIMATE.init(); {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 04:39:15,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1518#true} is VALID [2020-07-18 04:39:15,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-18 04:39:15,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-18 04:39:15,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-18 04:39:15,602 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-18 04:39:15,602 INFO L263 TraceCheckUtils]: 6: Hoare triple {1518#true} call #t~ret12 := main(); {1518#true} is VALID [2020-07-18 04:39:15,602 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} ~x~0 := 0.0; {1518#true} is VALID [2020-07-18 04:39:15,603 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} ~y~0 := ~someUnaryDOUBLEoperation(0.0); {1518#true} is VALID [2020-07-18 04:39:15,604 INFO L263 TraceCheckUtils]: 9: Hoare triple {1518#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:15,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-18 04:39:15,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-18 04:39:15,606 INFO L263 TraceCheckUtils]: 12: Hoare triple {1518#true} call #t~ret4 := __fpclassify_double(~x); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 04:39:15,606 INFO L280 TraceCheckUtils]: 13: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-18 04:39:15,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-18 04:39:15,607 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-18 04:39:15,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-18 04:39:15,607 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-18 04:39:15,607 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-18 04:39:15,608 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-18 04:39:15,608 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-18 04:39:15,608 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-18 04:39:15,608 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-18 04:39:15,609 INFO L280 TraceCheckUtils]: 23: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-18 04:39:15,609 INFO L280 TraceCheckUtils]: 24: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-18 04:39:15,609 INFO L280 TraceCheckUtils]: 25: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-18 04:39:15,609 INFO L280 TraceCheckUtils]: 26: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-18 04:39:15,610 INFO L280 TraceCheckUtils]: 27: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-18 04:39:15,610 INFO L280 TraceCheckUtils]: 28: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-18 04:39:15,610 INFO L280 TraceCheckUtils]: 29: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-18 04:39:15,610 INFO L280 TraceCheckUtils]: 30: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-18 04:39:15,611 INFO L280 TraceCheckUtils]: 31: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-18 04:39:15,611 INFO L280 TraceCheckUtils]: 32: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-18 04:39:15,611 INFO L280 TraceCheckUtils]: 33: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-18 04:39:15,611 INFO L280 TraceCheckUtils]: 34: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-18 04:39:15,612 INFO L280 TraceCheckUtils]: 35: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:15,613 INFO L280 TraceCheckUtils]: 36: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:15,614 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:15,615 INFO L280 TraceCheckUtils]: 38: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:15,615 INFO L280 TraceCheckUtils]: 39: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-18 04:39:15,616 INFO L280 TraceCheckUtils]: 40: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-18 04:39:15,616 INFO L280 TraceCheckUtils]: 41: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-18 04:39:15,616 INFO L280 TraceCheckUtils]: 42: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-18 04:39:15,616 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-18 04:39:15,616 INFO L280 TraceCheckUtils]: 44: Hoare triple {1519#false} ~res~0 := #t~ret9; {1519#false} is VALID [2020-07-18 04:39:15,617 INFO L280 TraceCheckUtils]: 45: Hoare triple {1519#false} havoc #t~ret9; {1519#false} is VALID [2020-07-18 04:39:15,617 INFO L280 TraceCheckUtils]: 46: Hoare triple {1519#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {1519#false} is VALID [2020-07-18 04:39:15,617 INFO L280 TraceCheckUtils]: 47: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-18 04:39:15,617 INFO L280 TraceCheckUtils]: 48: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-18 04:39:15,618 INFO L280 TraceCheckUtils]: 49: Hoare triple {1519#false} havoc #t~ret10; {1519#false} is VALID [2020-07-18 04:39:15,618 INFO L280 TraceCheckUtils]: 50: Hoare triple {1519#false} havoc #t~short11; {1519#false} is VALID [2020-07-18 04:39:15,618 INFO L280 TraceCheckUtils]: 51: Hoare triple {1519#false} assume !false; {1519#false} is VALID [2020-07-18 04:39:15,622 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 04:39:15,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215033637] [2020-07-18 04:39:15,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:39:15,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 04:39:15,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689032979] [2020-07-18 04:39:15,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-18 04:39:15,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:39:15,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:39:15,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:15,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:39:15,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:39:15,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:39:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:39:15,676 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 6 states. [2020-07-18 04:39:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:16,346 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-18 04:39:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:39:16,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-18 04:39:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:39:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 04:39:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-18 04:39:16,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-18 04:39:16,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:16,529 INFO L225 Difference]: With dead ends: 127 [2020-07-18 04:39:16,529 INFO L226 Difference]: Without dead ends: 96 [2020-07-18 04:39:16,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:39:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-18 04:39:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2020-07-18 04:39:16,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:39:16,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 91 states. [2020-07-18 04:39:16,620 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 91 states. [2020-07-18 04:39:16,620 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 91 states. [2020-07-18 04:39:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:16,625 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-18 04:39:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-18 04:39:16,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:16,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:16,626 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 96 states. [2020-07-18 04:39:16,626 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 96 states. [2020-07-18 04:39:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:16,632 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-18 04:39:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-18 04:39:16,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:16,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:16,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:39:16,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:39:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-18 04:39:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-18 04:39:16,638 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 52 [2020-07-18 04:39:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:39:16,638 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-18 04:39:16,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:39:16,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-18 04:39:16,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:39:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-18 04:39:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 04:39:16,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:16,752 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] [2020-07-18 04:39:16,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:39:16,752 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash 323107249, now seen corresponding path program 1 times [2020-07-18 04:39:16,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:16,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1165879412] [2020-07-18 04:39:16,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:39:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:39:16,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:39:16,905 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.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) 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 04:39:16,913 INFO L168 Benchmark]: Toolchain (without parser) took 6003.18 ms. Allocated memory was 137.4 MB in the beginning and 291.0 MB in the end (delta: 153.6 MB). Free memory was 102.2 MB in the beginning and 214.3 MB in the end (delta: -112.1 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:16,914 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 04:39:16,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.98 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 179.2 MB in the end (delta: -77.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:16,923 INFO L168 Benchmark]: Boogie Preprocessor took 48.88 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 176.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:16,924 INFO L168 Benchmark]: RCFGBuilder took 636.16 ms. Allocated memory is still 200.8 MB. Free memory was 176.8 MB in the beginning and 137.0 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:16,931 INFO L168 Benchmark]: TraceAbstraction took 4938.37 ms. Allocated memory was 200.8 MB in the beginning and 291.0 MB in the end (delta: 90.2 MB). Free memory was 137.0 MB in the beginning and 214.3 MB in the end (delta: -77.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:16,938 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.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 372.98 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 179.2 MB in the end (delta: -77.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.88 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 176.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 636.16 ms. Allocated memory is still 200.8 MB. Free memory was 176.8 MB in the beginning and 137.0 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4938.37 ms. Allocated memory was 200.8 MB in the beginning and 291.0 MB in the end (delta: 90.2 MB). Free memory was 137.0 MB in the beginning and 214.3 MB in the end (delta: -77.3 MB). Peak memory consumption was 12.8 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...