java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/zonotope_3_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:51:54,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:51:54,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:51:54,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:51:54,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:51:54,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:51:54,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:51:54,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:51:54,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:51:54,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:51:54,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:51:54,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:51:54,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:51:54,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:51:54,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:51:54,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:51:54,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:51:54,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:51:54,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:51:54,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:51:54,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:51:54,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:51:54,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:51:54,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:51:54,252 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:51:54,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:51:54,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:51:54,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:51:54,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:51:54,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:51:54,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:51:54,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:51:54,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:51:54,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:51:54,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:51:54,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:51:54,267 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:51:54,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:51:54,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:51:54,301 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:51:54,301 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:51:54,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:51:54,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:51:54,305 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:51:54,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:51:54,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:51:54,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:51:54,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:51:54,306 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:51:54,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:51:54,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:51:54,307 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:51:54,307 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:51:54,308 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:51:54,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:51:54,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:51:54,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:51:54,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:51:54,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:51:54,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:51:54,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:51:54,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:51:54,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:51:54,311 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:51:54,311 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:51:54,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:51:54,312 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:51:54,312 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:51:54,312 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:51:54,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:51:54,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:51:54,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:51:54,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:51:54,387 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:51:54,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_3_true-unreach-call_true-termination.c [2018-09-19 15:51:54,732 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f01ce3432/a053b7bbd35949e69fc4ca4fc4b6ac6b/FLAG9241cdaf6 [2018-09-19 15:51:54,962 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:51:54,963 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_3_true-unreach-call_true-termination.c [2018-09-19 15:51:54,975 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f01ce3432/a053b7bbd35949e69fc4ca4fc4b6ac6b/FLAG9241cdaf6 [2018-09-19 15:51:54,999 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f01ce3432/a053b7bbd35949e69fc4ca4fc4b6ac6b [2018-09-19 15:51:55,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:51:55,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:51:55,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:51:55,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:51:55,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:51:55,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f7005b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55, skipping insertion in model container [2018-09-19 15:51:55,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,047 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:51:55,278 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:51:55,304 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:51:55,320 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:51:55,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55 WrapperNode [2018-09-19 15:51:55,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:51:55,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:51:55,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:51:55,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:51:55,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (1/1) ... [2018-09-19 15:51:55,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:51:55,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:51:55,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:51:55,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:51:55,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (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 [2018-09-19 15:51:55,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:51:55,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:51:55,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:51:55,502 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-09-19 15:51:55,502 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-09-19 15:51:55,502 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:51:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:51:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-19 15:51:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:51:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:51:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-09-19 15:51:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-09-19 15:51:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:51:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:51:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:51:58,564 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:51:58,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:51:58 BoogieIcfgContainer [2018-09-19 15:51:58,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:51:58,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:51:58,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:51:58,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:51:58,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:51:55" (1/3) ... [2018-09-19 15:51:58,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a577f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:51:58, skipping insertion in model container [2018-09-19 15:51:58,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:51:55" (2/3) ... [2018-09-19 15:51:58,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a577f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:51:58, skipping insertion in model container [2018-09-19 15:51:58,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:51:58" (3/3) ... [2018-09-19 15:51:58,581 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_3_true-unreach-call_true-termination.c [2018-09-19 15:51:58,590 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:51:58,599 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:51:58,653 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:51:58,654 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:51:58,654 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:51:58,654 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:51:58,654 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:51:58,654 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:51:58,655 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:51:58,655 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:51:58,655 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:51:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-09-19 15:51:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 15:51:58,685 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:58,686 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:58,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:58,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1072092901, now seen corresponding path program 1 times [2018-09-19 15:51:58,698 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:58,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:51:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:58,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-19 15:51:59,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:51:59,032 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:51:59,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:51:59,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:51:59,054 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:51:59,056 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:51:59,059 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-09-19 15:51:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:51:59,086 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-09-19 15:51:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:51:59,088 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-09-19 15:51:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:51:59,099 INFO L225 Difference]: With dead ends: 56 [2018-09-19 15:51:59,099 INFO L226 Difference]: Without dead ends: 36 [2018-09-19 15:51:59,103 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:51:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-19 15:51:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-19 15:51:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-19 15:51:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-09-19 15:51:59,154 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 31 [2018-09-19 15:51:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:51:59,156 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-09-19 15:51:59,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:51:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-09-19 15:51:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-19 15:51:59,159 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:51:59,159 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:51:59,159 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:51:59,160 INFO L82 PathProgramCache]: Analyzing trace with hash 477979143, now seen corresponding path program 1 times [2018-09-19 15:51:59,160 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:51:59,161 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:51:59,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:51:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:51:59,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:51:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-19 15:51:59,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:51:59,463 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:51:59,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:51:59,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:51:59,466 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:51:59,466 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:51:59,467 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2018-09-19 15:52:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:01,702 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-09-19 15:52:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:52:01,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-09-19 15:52:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:01,749 INFO L225 Difference]: With dead ends: 53 [2018-09-19 15:52:01,749 INFO L226 Difference]: Without dead ends: 47 [2018-09-19 15:52:01,750 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:52:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-19 15:52:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2018-09-19 15:52:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-19 15:52:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-09-19 15:52:01,763 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 32 [2018-09-19 15:52:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:01,764 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-09-19 15:52:01,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:52:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-09-19 15:52:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-19 15:52:01,766 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:01,766 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:01,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash -130320499, now seen corresponding path program 1 times [2018-09-19 15:52:01,768 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:01,768 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:52:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:52:02,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:52:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-19 15:52:02,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:52:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-19 15:52:02,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:52:02,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 15:52:02,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:52:02,702 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:52:02,702 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 15:52:02,703 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 6 states. [2018-09-19 15:52:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:06,417 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-09-19 15:52:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:52:06,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-09-19 15:52:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:06,454 INFO L225 Difference]: With dead ends: 77 [2018-09-19 15:52:06,454 INFO L226 Difference]: Without dead ends: 71 [2018-09-19 15:52:06,455 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-09-19 15:52:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-19 15:52:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-19 15:52:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-19 15:52:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-09-19 15:52:06,475 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 55 [2018-09-19 15:52:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:06,475 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2018-09-19 15:52:06,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:52:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-09-19 15:52:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-19 15:52:06,480 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:06,481 INFO L376 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:06,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash 989430919, now seen corresponding path program 2 times [2018-09-19 15:52:06,482 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:06,483 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:06,489 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 15:52:07,769 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:52:07,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:52:07,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:52:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-09-19 15:52:08,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:52:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-09-19 15:52:08,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:52:08,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-19 15:52:08,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:52:08,762 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:52:08,762 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-09-19 15:52:08,763 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 12 states. [2018-09-19 15:52:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:21,799 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-09-19 15:52:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:52:21,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 124 [2018-09-19 15:52:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:21,842 INFO L225 Difference]: With dead ends: 143 [2018-09-19 15:52:21,842 INFO L226 Difference]: Without dead ends: 137 [2018-09-19 15:52:21,843 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-09-19 15:52:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-19 15:52:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-19 15:52:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-19 15:52:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2018-09-19 15:52:21,871 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 124 [2018-09-19 15:52:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:21,872 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2018-09-19 15:52:21,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:52:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2018-09-19 15:52:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-19 15:52:21,880 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:21,880 INFO L376 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:21,881 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash 517296199, now seen corresponding path program 3 times [2018-09-19 15:52:21,882 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:21,882 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:21,894 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-09-19 15:52:23,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-19 15:52:23,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:52:23,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:52:34,375 WARN L178 SmtUtils]: Spent 9.30 s on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 15:52:40,960 WARN L178 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-19 15:52:43,014 WARN L797 $PredicateComparison]: unable to prove that (and (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) c_main_~x~0) ((_ to_fp 8 24) RNE 3.0)) |c_main_#t~ret6|) (fp.geq c_main_~x~0 (_ +zero 8 24)) (bvsle c_main_~i~0 (_ bv100000 32)) (fp.leq c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE c_main_~i~0) ((_ to_fp 8 24) RNE 100000.0)))) is different from false [2018-09-19 15:52:45,058 WARN L819 $PredicateComparison]: unable to prove that (and (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) c_main_~x~0) ((_ to_fp 8 24) RNE 3.0)) |c_main_#t~ret6|) (fp.geq c_main_~x~0 (_ +zero 8 24)) (bvsle c_main_~i~0 (_ bv100000 32)) (fp.leq c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE c_main_~i~0) ((_ to_fp 8 24) RNE 100000.0)))) is different from true [2018-09-19 15:52:47,110 WARN L797 $PredicateComparison]: unable to prove that (and (fp.geq c_main_~x~0 (_ +zero 8 24)) (bvsle c_main_~i~0 (_ bv100000 32)) (fp.leq c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE c_main_~i~0) ((_ to_fp 8 24) RNE 100000.0))) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) c_main_~x~0) ((_ to_fp 8 24) RNE 3.0)) c_main_~y~0)) is different from false [2018-09-19 15:52:53,720 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-19 15:52:55,785 WARN L797 $PredicateComparison]: unable to prove that (and (bvsle c_main_~i~0 (_ bv100000 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (= |c_main_#t~ret7| (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE c_main_~i~0) ((_ to_fp 8 24) RNE 100000.0))) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) main_~x~0) ((_ to_fp 8 24) RNE 3.0)) c_main_~y~0)))) is different from false [2018-09-19 15:52:57,864 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (= c_main_~z~0 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))) (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE c_main_~i~0) ((_ to_fp 8 24) RNE 100000.0))) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) main_~x~0) ((_ to_fp 8 24) RNE 3.0)) c_main_~y~0))) (bvsle c_main_~i~0 (_ bv100000 32))) is different from false [2018-09-19 15:53:07,118 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (= c_main_~z~0 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))) (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE (bvadd c_main_~i~0 (_ bv4294967295 32))) ((_ to_fp 8 24) RNE 100000.0))) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) main_~x~0) ((_ to_fp 8 24) RNE 3.0)) c_main_~y~0))) (bvsle (bvadd c_main_~i~0 (_ bv4294967295 32)) (_ bv100000 32))) is different from false [2018-09-19 15:53:09,194 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (= c_main_~z~0 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))) (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse0 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse0) ((_ to_fp 8 24) RNE 100000.0))) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) main_~x~0) ((_ to_fp 8 24) RNE 3.0)) c_main_~y~0)))) is different from false [2018-09-19 15:53:11,231 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (= c_main_~z~0 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))) (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse0 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse0) ((_ to_fp 8 24) RNE 100000.0))) (= (fp.sub RNE (fp.mul RNE ((_ to_fp 8 24) RNE 2.0) main_~x~0) ((_ to_fp 8 24) RNE 3.0)) c_main_~y~0)))) is different from true [2018-09-19 15:53:13,295 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse0 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse0) ((_ to_fp 8 24) RNE 100000.0))) (= c_main_~t~0 (let ((.cse1 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse1 main_~x~0) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))))))))) is different from false [2018-09-19 15:53:15,357 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse0 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse0) ((_ to_fp 8 24) RNE 100000.0))) (= c_main_~t~0 (let ((.cse1 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse1 main_~x~0) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))))))))) is different from true [2018-09-19 15:53:32,017 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_4 (_ FloatingPoint 8 24)) (v_prenex_6 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse2 v_prenex_4) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse2 (fp.add RNE (fp.neg v_prenex_4) ((_ to_fp 8 24) RNE 5.0)))))) (.cse0 (bvadd v_prenex_6 (_ bv4294967295 32)))) (and (fp.leq v_prenex_4 (fp.div RNE ((_ to_fp 8 24) RNE .cse0) ((_ to_fp 8 24) RNE 100000.0))) (not (bvsle v_prenex_6 (_ bv100000 32))) (fp.geq v_prenex_4 (_ +zero 8 24)) (fp.geq .cse1 ((_ to_fp 8 24) RNE (/ 69.0 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) RNE (/ 71.0 10.0))) (bvsle .cse0 (_ bv100000 32))))) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse3 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse3 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse3) ((_ to_fp 8 24) RNE 100000.0))) (not (fp.geq (let ((.cse4 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse4 main_~x~0) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse4 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 69.0 10.0))))))) .cse5) (and .cse5 (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ BitVec 32))) (let ((.cse6 (bvadd v_prenex_3 (_ bv4294967295 32)))) (and (fp.geq v_prenex_1 (_ +zero 8 24)) (not (bvsle v_prenex_3 (_ bv100000 32))) (bvsle .cse6 (_ bv100000 32)) (not (fp.leq (let ((.cse7 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse7 v_prenex_1) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse7 (fp.add RNE (fp.neg v_prenex_1) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 71.0 10.0)))) (fp.leq v_prenex_1 (fp.div RNE ((_ to_fp 8 24) RNE .cse6) ((_ to_fp 8 24) RNE 100000.0))))))))) is different from false [2018-09-19 15:53:46,624 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ BitVec 32))) (let ((.cse1 (bvadd v_prenex_3 (_ bv4294967295 32)))) (and (fp.geq v_prenex_1 (_ +zero 8 24)) (not (bvsle v_prenex_3 (_ bv100000 32))) (bvsle .cse1 (_ bv100000 32)) (not (fp.leq (let ((.cse2 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse2 v_prenex_1) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse2 (fp.add RNE (fp.neg v_prenex_1) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 71.0 10.0)))) (fp.leq v_prenex_1 (fp.div RNE ((_ to_fp 8 24) RNE .cse1) ((_ to_fp 8 24) RNE 100000.0))))))) (and (exists ((v_prenex_4 (_ FloatingPoint 8 24)) (v_prenex_6 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse5 v_prenex_4) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse5 (fp.add RNE (fp.neg v_prenex_4) ((_ to_fp 8 24) RNE 5.0)))))) (.cse3 (bvadd v_prenex_6 (_ bv4294967295 32)))) (and (fp.leq v_prenex_4 (fp.div RNE ((_ to_fp 8 24) RNE .cse3) ((_ to_fp 8 24) RNE 100000.0))) (not (bvsle v_prenex_6 (_ bv100000 32))) (fp.geq v_prenex_4 (_ +zero 8 24)) (fp.geq .cse4 ((_ to_fp 8 24) RNE (/ 69.0 10.0))) (fp.leq .cse4 ((_ to_fp 8 24) RNE (/ 71.0 10.0))) (bvsle .cse3 (_ bv100000 32))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse6 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse6 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse6) ((_ to_fp 8 24) RNE 100000.0))) (not (fp.geq (let ((.cse7 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse7 main_~x~0) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse7 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 69.0 10.0))))))) .cse0))) is different from false [2018-09-19 15:53:57,084 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse0 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse0) ((_ to_fp 8 24) RNE 100000.0))) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse1 main_~x~0) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 69.0 10.0))))))) (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ BitVec 32))) (let ((.cse2 (bvadd v_prenex_3 (_ bv4294967295 32)))) (and (fp.geq v_prenex_1 (_ +zero 8 24)) (not (bvsle v_prenex_3 (_ bv100000 32))) (bvsle .cse2 (_ bv100000 32)) (not (fp.leq (let ((.cse3 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse3 v_prenex_1) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse3 (fp.add RNE (fp.neg v_prenex_1) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 71.0 10.0)))) (fp.leq v_prenex_1 (fp.div RNE ((_ to_fp 8 24) RNE .cse2) ((_ to_fp 8 24) RNE 100000.0))))))) is different from false [2018-09-19 15:53:59,189 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~i~0 (_ BitVec 32))) (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvsle main_~i~0 (_ bv100000 32))) (fp.geq main_~x~0 (_ +zero 8 24)) (bvsle .cse0 (_ bv100000 32)) (fp.leq main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE .cse0) ((_ to_fp 8 24) RNE 100000.0))) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse1 main_~x~0) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse1 (fp.add RNE (fp.neg main_~x~0) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 69.0 10.0))))))) (exists ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_3 (_ BitVec 32))) (let ((.cse2 (bvadd v_prenex_3 (_ bv4294967295 32)))) (and (fp.geq v_prenex_1 (_ +zero 8 24)) (not (bvsle v_prenex_3 (_ bv100000 32))) (bvsle .cse2 (_ bv100000 32)) (not (fp.leq (let ((.cse3 ((_ to_fp 8 24) RNE 2.0))) (fp.add RNE (fp.sub RNE (fp.mul RNE .cse3 v_prenex_1) ((_ to_fp 8 24) RNE 3.0)) (fp.mul RNE .cse3 (fp.add RNE (fp.neg v_prenex_1) ((_ to_fp 8 24) RNE 5.0))))) ((_ to_fp 8 24) RNE (/ 71.0 10.0)))) (fp.leq v_prenex_1 (fp.div RNE ((_ to_fp 8 24) RNE .cse2) ((_ to_fp 8 24) RNE 100000.0))))))) is different from true [2018-09-19 15:53:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 181 proven. 4 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2018-09-19 15:53:59,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:54:25,529 WARN L178 SmtUtils]: Spent 2.99 s on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 15:54:39,855 WARN L178 SmtUtils]: Spent 3.96 s on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 15:54:56,161 WARN L178 SmtUtils]: Spent 3.79 s on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 15:55:23,525 WARN L178 SmtUtils]: Spent 3.28 s on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 15:55:23,708 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 15:55:23,846 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 15:55:24,189 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 15:55:24,754 WARN L178 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 15:56:08,690 WARN L178 SmtUtils]: Spent 9.44 s on a formula simplification that was a NOOP. DAG size: 24 [2018-09-19 15:56:10,728 WARN L797 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 2.0))) (let ((.cse0 (fp.add RNE v_prenex_8 (fp.mul RNE .cse2 (fp.add RNE (fp.neg |c_g_#in~x|) ((_ to_fp 8 24) RNE 5.0))))) (.cse1 ((_ to_fp 8 24) RNE (/ 71.0 10.0)))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 ((_ to_fp 8 24) RNE (/ 69.0 10.0)))) (fp.leq (fp.add RNE v_prenex_8 (fp.mul RNE .cse2 |c_g_#res|)) .cse1))))) (forall ((v_main_~y~0_BEFORE_CALL_6 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE 2.0))) (let ((.cse4 ((_ to_fp 8 24) RNE (/ 69.0 10.0))) (.cse5 (fp.add RNE v_main_~y~0_BEFORE_CALL_6 (fp.mul RNE .cse3 (fp.add RNE (fp.neg |c_g_#in~x|) ((_ to_fp 8 24) RNE 5.0)))))) (or (fp.geq (fp.add RNE v_main_~y~0_BEFORE_CALL_6 (fp.mul RNE .cse3 |c_g_#res|)) .cse4) (not (fp.geq .cse5 .cse4)) (not (fp.leq .cse5 ((_ to_fp 8 24) RNE (/ 71.0 10.0))))))))) is different from false [2018-09-19 15:56:12,775 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) RNE 2.0))) (let ((.cse0 (fp.add RNE v_prenex_8 (fp.mul RNE .cse2 (fp.add RNE (fp.neg |c_g_#in~x|) ((_ to_fp 8 24) RNE 5.0))))) (.cse1 ((_ to_fp 8 24) RNE (/ 71.0 10.0)))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 ((_ to_fp 8 24) RNE (/ 69.0 10.0)))) (fp.leq (fp.add RNE v_prenex_8 (fp.mul RNE .cse2 |c_g_#res|)) .cse1))))) (forall ((v_main_~y~0_BEFORE_CALL_6 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) RNE 2.0))) (let ((.cse4 ((_ to_fp 8 24) RNE (/ 69.0 10.0))) (.cse5 (fp.add RNE v_main_~y~0_BEFORE_CALL_6 (fp.mul RNE .cse3 (fp.add RNE (fp.neg |c_g_#in~x|) ((_ to_fp 8 24) RNE 5.0)))))) (or (fp.geq (fp.add RNE v_main_~y~0_BEFORE_CALL_6 (fp.mul RNE .cse3 |c_g_#res|)) .cse4) (not (fp.geq .cse5 .cse4)) (not (fp.leq .cse5 ((_ to_fp 8 24) RNE (/ 71.0 10.0))))))))) is different from true Received shutdown request... [2018-09-19 15:56:47,678 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-19 15:56:47,879 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2018-09-19 15:56:47,880 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 15:56:47,888 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 15:56:47,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:56:47 BoogieIcfgContainer [2018-09-19 15:56:47,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:56:47,889 INFO L168 Benchmark]: Toolchain (without parser) took 292875.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -335.2 MB). Peak memory consumption was 408.7 MB. Max. memory is 7.1 GB. [2018-09-19 15:56:47,892 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:56:47,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:56:47,897 INFO L168 Benchmark]: Boogie Preprocessor took 62.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:56:47,898 INFO L168 Benchmark]: RCFGBuilder took 3153.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:56:47,899 INFO L168 Benchmark]: TraceAbstraction took 289322.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 438.7 MB). Peak memory consumption was 438.7 MB. Max. memory is 7.1 GB. [2018-09-19 15:56:47,907 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 329.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3153.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 289322.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 438.7 MB). Peak memory consumption was 438.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 10]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 10). Cancelled while BasicCegarLoop was analyzing trace of length 263 with TraceHistMax 22, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 24 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. TIMEOUT Result, 289.2s OverallTime, 5 OverallIterations, 22 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 266 SDtfs, 80 SDslu, 490 SDs, 0 SdLazy, 291 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 82743 SizeOfPredicates, 3 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 624/776 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown