java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:20:12,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:20:12,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:20:12,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:20:12,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:20:12,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:20:12,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:20:12,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:20:12,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:20:12,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:20:12,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:20:12,565 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:20:12,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:20:12,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:20:12,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:20:12,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:20:12,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:20:12,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:20:12,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:20:12,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:20:12,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:20:12,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:20:12,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:20:12,582 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:20:12,582 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:20:12,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:20:12,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:20:12,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:20:12,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:20:12,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:20:12,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:20:12,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:20:12,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:20:12,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:20:12,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:20:12,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:20:12,598 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 01:20:12,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:20:12,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:20:12,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:20:12,620 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:20:12,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:20:12,621 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:20:12,621 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:20:12,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:20:12,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:20:12,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:20:12,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:20:12,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:20:12,622 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:20:12,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:20:12,623 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:20:12,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:20:12,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:20:12,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:20:12,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:20:12,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:20:12,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:20:12,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:20:12,624 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:20:12,624 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:20:12,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:20:12,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:20:12,625 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:20:12,625 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:20:12,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:20:12,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:20:12,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:20:12,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:20:12,693 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:20:12,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-07-24 01:20:13,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4ce5a71/9ccbfb11a7b44ee993dd861315fc1442/FLAG5d92ab32a [2018-07-24 01:20:13,330 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:20:13,334 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-07-24 01:20:13,368 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4ce5a71/9ccbfb11a7b44ee993dd861315fc1442/FLAG5d92ab32a [2018-07-24 01:20:13,390 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4ce5a71/9ccbfb11a7b44ee993dd861315fc1442 [2018-07-24 01:20:13,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:20:13,404 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:20:13,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:13,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:20:13,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:20:13,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:13" (1/1) ... [2018-07-24 01:20:13,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f31e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:13, skipping insertion in model container [2018-07-24 01:20:13,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:13" (1/1) ... [2018-07-24 01:20:13,657 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:20:13,946 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:13,964 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:20:14,108 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:14,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14 WrapperNode [2018-07-24 01:20:14,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:14,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:14,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:20:14,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:20:14,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:14,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:20:14,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:20:14,255 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:20:14,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (1/1) ... [2018-07-24 01:20:14,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:20:14,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:20:14,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:20:14,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:20:14,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (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-07-24 01:20:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:20:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:20:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:20:17,634 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:20:17,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:17 BoogieIcfgContainer [2018-07-24 01:20:17,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:20:17,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:20:17,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:20:17,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:20:17,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:20:13" (1/3) ... [2018-07-24 01:20:17,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf4cf63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:17, skipping insertion in model container [2018-07-24 01:20:17,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:14" (2/3) ... [2018-07-24 01:20:17,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf4cf63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:17, skipping insertion in model container [2018-07-24 01:20:17,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:17" (3/3) ... [2018-07-24 01:20:17,645 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30_true-unreach-call_false-termination.c [2018-07-24 01:20:17,658 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:20:17,667 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:20:17,723 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:20:17,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:20:17,725 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:20:17,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:20:17,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:20:17,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:20:17,726 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:20:17,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:20:17,726 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:20:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:20:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-24 01:20:17,767 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:17,768 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-07-24 01:20:17,768 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1027439751, now seen corresponding path program 1 times [2018-07-24 01:20:17,779 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:17,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:17,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:17,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:18,571 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:18,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:18,578 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:18,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:18,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:18,600 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-07-24 01:20:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:21,085 INFO L93 Difference]: Finished difference Result 691 states and 1207 transitions. [2018-07-24 01:20:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:21,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-07-24 01:20:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:21,108 INFO L225 Difference]: With dead ends: 691 [2018-07-24 01:20:21,109 INFO L226 Difference]: Without dead ends: 485 [2018-07-24 01:20:21,114 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-07-24 01:20:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 328. [2018-07-24 01:20:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-24 01:20:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-07-24 01:20:21,180 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 126 [2018-07-24 01:20:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:21,181 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-07-24 01:20:21,181 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-07-24 01:20:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-24 01:20:21,186 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:21,186 INFO L353 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 01:20:21,186 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1543594982, now seen corresponding path program 1 times [2018-07-24 01:20:21,187 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:21,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:21,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:21,317 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:21,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:21,320 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:21,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:21,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:21,321 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 3 states. [2018-07-24 01:20:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:22,315 INFO L93 Difference]: Finished difference Result 918 states and 1516 transitions. [2018-07-24 01:20:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:22,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-07-24 01:20:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:22,322 INFO L225 Difference]: With dead ends: 918 [2018-07-24 01:20:22,322 INFO L226 Difference]: Without dead ends: 592 [2018-07-24 01:20:22,325 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-24 01:20:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-07-24 01:20:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-07-24 01:20:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-07-24 01:20:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 901 transitions. [2018-07-24 01:20:22,356 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 901 transitions. Word has length 133 [2018-07-24 01:20:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:22,357 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 901 transitions. [2018-07-24 01:20:22,357 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 901 transitions. [2018-07-24 01:20:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-24 01:20:22,363 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:22,363 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:22,363 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash 449729837, now seen corresponding path program 1 times [2018-07-24 01:20:22,364 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:22,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:22,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:20:22,517 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:22,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:22,520 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:22,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:22,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:22,522 INFO L87 Difference]: Start difference. First operand 592 states and 901 transitions. Second operand 3 states. [2018-07-24 01:20:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:23,983 INFO L93 Difference]: Finished difference Result 1446 states and 2264 transitions. [2018-07-24 01:20:23,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:23,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-07-24 01:20:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:23,991 INFO L225 Difference]: With dead ends: 1446 [2018-07-24 01:20:23,991 INFO L226 Difference]: Without dead ends: 856 [2018-07-24 01:20:23,994 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-24 01:20:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-07-24 01:20:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-07-24 01:20:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-24 01:20:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1329 transitions. [2018-07-24 01:20:24,034 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1329 transitions. Word has length 151 [2018-07-24 01:20:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:24,034 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1329 transitions. [2018-07-24 01:20:24,035 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1329 transitions. [2018-07-24 01:20:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-24 01:20:24,040 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:24,040 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:24,040 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:24,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1397931721, now seen corresponding path program 1 times [2018-07-24 01:20:24,041 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:24,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:24,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:24,395 WARN L169 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-07-24 01:20:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-07-24 01:20:24,425 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:24,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:24,426 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:24,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:24,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:24,426 INFO L87 Difference]: Start difference. First operand 856 states and 1329 transitions. Second operand 4 states. [2018-07-24 01:20:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:26,414 INFO L93 Difference]: Finished difference Result 1845 states and 2828 transitions. [2018-07-24 01:20:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:26,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-07-24 01:20:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:26,420 INFO L225 Difference]: With dead ends: 1845 [2018-07-24 01:20:26,420 INFO L226 Difference]: Without dead ends: 991 [2018-07-24 01:20:26,422 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-07-24 01:20:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-07-24 01:20:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-07-24 01:20:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1467 transitions. [2018-07-24 01:20:26,445 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1467 transitions. Word has length 155 [2018-07-24 01:20:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:26,445 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1467 transitions. [2018-07-24 01:20:26,445 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1467 transitions. [2018-07-24 01:20:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-24 01:20:26,449 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:26,449 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:26,449 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:26,449 INFO L82 PathProgramCache]: Analyzing trace with hash 374428383, now seen corresponding path program 1 times [2018-07-24 01:20:26,450 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:26,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:26,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-07-24 01:20:26,622 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:26,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:26,623 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:26,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:26,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:26,623 INFO L87 Difference]: Start difference. First operand 988 states and 1467 transitions. Second operand 3 states. [2018-07-24 01:20:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:27,871 INFO L93 Difference]: Finished difference Result 2370 states and 3596 transitions. [2018-07-24 01:20:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:27,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2018-07-24 01:20:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:27,879 INFO L225 Difference]: With dead ends: 2370 [2018-07-24 01:20:27,880 INFO L226 Difference]: Without dead ends: 1516 [2018-07-24 01:20:27,881 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2018-07-24 01:20:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1516. [2018-07-24 01:20:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2018-07-24 01:20:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2134 transitions. [2018-07-24 01:20:27,910 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2134 transitions. Word has length 160 [2018-07-24 01:20:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:27,911 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 2134 transitions. [2018-07-24 01:20:27,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2134 transitions. [2018-07-24 01:20:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-24 01:20:27,915 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:27,915 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:27,915 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash 303990096, now seen corresponding path program 1 times [2018-07-24 01:20:27,916 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:27,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-24 01:20:28,073 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:28,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:28,073 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:28,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:28,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:28,074 INFO L87 Difference]: Start difference. First operand 1516 states and 2134 transitions. Second operand 4 states. [2018-07-24 01:20:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:29,370 INFO L93 Difference]: Finished difference Result 5004 states and 7042 transitions. [2018-07-24 01:20:29,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:29,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-07-24 01:20:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:29,386 INFO L225 Difference]: With dead ends: 5004 [2018-07-24 01:20:29,386 INFO L226 Difference]: Without dead ends: 3622 [2018-07-24 01:20:29,389 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2018-07-24 01:20:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2018-07-24 01:20:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2018-07-24 01:20:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4668 transitions. [2018-07-24 01:20:29,455 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4668 transitions. Word has length 170 [2018-07-24 01:20:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:29,456 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 4668 transitions. [2018-07-24 01:20:29,456 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4668 transitions. [2018-07-24 01:20:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-24 01:20:29,463 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:29,463 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:29,463 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1666411743, now seen corresponding path program 1 times [2018-07-24 01:20:29,464 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:29,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:29,912 WARN L169 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-24 01:20:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-24 01:20:29,930 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:29,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:29,931 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:20:29,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:20:29,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:29,932 INFO L87 Difference]: Start difference. First operand 3622 states and 4668 transitions. Second operand 5 states. [2018-07-24 01:20:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:31,461 INFO L93 Difference]: Finished difference Result 7242 states and 9391 transitions. [2018-07-24 01:20:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:20:31,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2018-07-24 01:20:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:31,474 INFO L225 Difference]: With dead ends: 7242 [2018-07-24 01:20:31,474 INFO L226 Difference]: Without dead ends: 3754 [2018-07-24 01:20:31,478 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2018-07-24 01:20:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3754. [2018-07-24 01:20:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2018-07-24 01:20:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4736 transitions. [2018-07-24 01:20:31,543 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4736 transitions. Word has length 176 [2018-07-24 01:20:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:31,544 INFO L471 AbstractCegarLoop]: Abstraction has 3754 states and 4736 transitions. [2018-07-24 01:20:31,544 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:20:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4736 transitions. [2018-07-24 01:20:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-24 01:20:31,552 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:31,552 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:31,553 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1774375715, now seen corresponding path program 1 times [2018-07-24 01:20:31,553 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:31,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:31,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:31,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:31,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-24 01:20:31,894 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:31,895 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:31,895 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:31,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:31,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:31,897 INFO L87 Difference]: Start difference. First operand 3754 states and 4736 transitions. Second operand 4 states. [2018-07-24 01:20:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:34,099 INFO L93 Difference]: Finished difference Result 12254 states and 15458 transitions. [2018-07-24 01:20:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:34,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-07-24 01:20:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:34,115 INFO L225 Difference]: With dead ends: 12254 [2018-07-24 01:20:34,115 INFO L226 Difference]: Without dead ends: 4777 [2018-07-24 01:20:34,123 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2018-07-24 01:20:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4645. [2018-07-24 01:20:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4645 states. [2018-07-24 01:20:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 5070 transitions. [2018-07-24 01:20:34,197 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 5070 transitions. Word has length 179 [2018-07-24 01:20:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:34,197 INFO L471 AbstractCegarLoop]: Abstraction has 4645 states and 5070 transitions. [2018-07-24 01:20:34,198 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 5070 transitions. [2018-07-24 01:20:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-24 01:20:34,205 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:34,205 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:34,205 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2031020270, now seen corresponding path program 1 times [2018-07-24 01:20:34,206 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:34,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:34,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 01:20:34,346 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:34,346 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:34,346 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:34,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:34,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:34,347 INFO L87 Difference]: Start difference. First operand 4645 states and 5070 transitions. Second operand 3 states. [2018-07-24 01:20:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:34,865 INFO L93 Difference]: Finished difference Result 9156 states and 10003 transitions. [2018-07-24 01:20:34,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:34,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-07-24 01:20:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:34,876 INFO L225 Difference]: With dead ends: 9156 [2018-07-24 01:20:34,877 INFO L226 Difference]: Without dead ends: 3714 [2018-07-24 01:20:34,881 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-24 01:20:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2018-07-24 01:20:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3318. [2018-07-24 01:20:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3318 states. [2018-07-24 01:20:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 3588 transitions. [2018-07-24 01:20:34,932 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 3588 transitions. Word has length 193 [2018-07-24 01:20:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:34,933 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 3588 transitions. [2018-07-24 01:20:34,933 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 3588 transitions. [2018-07-24 01:20:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-24 01:20:34,940 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:34,940 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:34,940 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1444568145, now seen corresponding path program 1 times [2018-07-24 01:20:34,940 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:34,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:34,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:34,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-24 01:20:35,323 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:20:35,323 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:20:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:35,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:20:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-07-24 01:20:35,718 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:20:35,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-07-24 01:20:35,719 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:20:35,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:20:35,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:20:35,720 INFO L87 Difference]: Start difference. First operand 3318 states and 3588 transitions. Second operand 7 states. [2018-07-24 01:20:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:39,525 INFO L93 Difference]: Finished difference Result 6377 states and 6910 transitions. [2018-07-24 01:20:39,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 01:20:39,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2018-07-24 01:20:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:39,527 INFO L225 Difference]: With dead ends: 6377 [2018-07-24 01:20:39,527 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:20:39,532 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:20:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:20:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:20:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:20:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:20:39,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2018-07-24 01:20:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:39,534 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:20:39,534 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:20:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:20:39,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:20:39,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:20:40,606 WARN L169 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-07-24 01:20:41,048 WARN L169 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-07-24 01:20:41,052 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:20:41,052 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:20:41,052 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:20:41,052 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:20:41,052 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:20:41,052 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:20:41,053 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:20:41,053 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:20:41,053 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:20:41,053 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,053 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:20:41,053 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:20:41,053 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,054 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,055 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:20:41,055 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:20:41,055 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,055 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,055 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,055 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:20:41,055 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,056 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:20:41,056 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,056 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:20:41,056 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:20:41,056 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,056 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:20:41,056 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,057 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:20:41,057 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,057 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,057 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:20:41,057 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,057 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:20:41,063 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,064 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:20:41,065 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:20:41,066 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,067 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:20:41,068 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:20:41,069 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:20:41,070 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,071 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse7 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15))) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4) .cse3) (and .cse0 .cse1 .cse5 .cse3) (and .cse0 .cse2 .cse6) (and .cse7 .cse2 .cse3) (and .cse7 .cse4 .cse3) (and .cse1 .cse8 .cse3) (and .cse5 .cse6) (and .cse8 .cse4 .cse3) (and .cse7 .cse1 .cse5 .cse3))) [2018-07-24 01:20:41,071 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:20:41,071 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,072 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:20:41,072 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:20:41,072 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:20:41,072 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,072 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:20:41,072 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:20:41,072 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:20:41,072 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:20:41,073 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:20:41,074 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:20:41,075 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:20:41,076 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L550'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,077 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:20:41,078 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,078 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse7 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15))) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4) .cse3) (and .cse0 .cse1 .cse5 .cse3) (and .cse0 .cse2 .cse6) (and .cse7 .cse2 .cse3) (and .cse7 .cse4 .cse3) (and .cse1 .cse8 .cse3) (and .cse5 .cse6) (and .cse8 .cse4 .cse3) (and .cse7 .cse1 .cse5 .cse3))) [2018-07-24 01:20:41,078 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:20:41,078 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:20:41,078 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:20:41,078 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:41,079 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 551) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:20:41,080 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:20:41,081 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:20:41,081 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:20:41,081 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:20:41,081 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:20:41,081 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:20:41,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:20:41 BoogieIcfgContainer [2018-07-24 01:20:41,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:20:41,116 INFO L168 Benchmark]: Toolchain (without parser) took 27712.85 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:41,117 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:20:41,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.43 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:41,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.35 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-07-24 01:20:41,119 INFO L168 Benchmark]: Boogie Preprocessor took 227.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -864.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:41,120 INFO L168 Benchmark]: RCFGBuilder took 3152.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 136.1 MB). Peak memory consumption was 136.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:41,121 INFO L168 Benchmark]: TraceAbstraction took 23478.44 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 335.0 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -366.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:20:41,126 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.43 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 108.35 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 227.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -864.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3152.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 136.1 MB). Peak memory consumption was 136.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23478.44 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 335.0 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -366.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 23.3s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1310 SDtfs, 3011 SDslu, 587 SDs, 0 SdLazy, 6917 SolverSat, 1327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 236 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4645occurred in iteration=8, 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 688 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 132 NumberOfFragments, 235 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2240 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 304 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1878 ConstructedInterpolants, 0 QuantifiedInterpolants, 664234 SizeOfPredicates, 1 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 894/921 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label30_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-20-41-157.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label30_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-20-41-157.csv Received shutdown request...