/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:11:39,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:11:39,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:11:39,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:11:39,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:11:39,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:11:39,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:11:39,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:11:39,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:11:39,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:11:39,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:11:39,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:11:39,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:11:39,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:11:39,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:11:39,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:11:39,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:11:39,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:11:39,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:11:39,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:11:39,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:11:39,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:11:39,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:11:39,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:11:39,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:11:39,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:11:39,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:11:39,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:11:39,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:11:39,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:11:39,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:11:39,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:11:39,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:11:39,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:11:39,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:11:39,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:11:39,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:11:39,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:11:39,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:11:39,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:11:39,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:11:39,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:11:39,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:11:39,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:11:39,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:11:39,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:11:39,580 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:11:39,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:11:39,581 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:11:39,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:11:39,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:11:39,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:11:39,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:11:39,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:11:39,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:11:39,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:11:39,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:11:39,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:11:39,582 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:11:39,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:11:39,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:11:39,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:11:39,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:11:39,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:11:39,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:11:39,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:11:39,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:11:39,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:11:39,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:11:39,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:11:39,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:11:39,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:11:39,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:11:39,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:11:39,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:11:39,883 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:11:39,883 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:11:39,884 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23.c [2019-11-23 21:11:39,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b0f8ade/0f233623eadc4e3ba3bf1449e8ac54ce/FLAG92cd2d303 [2019-11-23 21:11:40,551 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:11:40,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23.c [2019-11-23 21:11:40,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b0f8ade/0f233623eadc4e3ba3bf1449e8ac54ce/FLAG92cd2d303 [2019-11-23 21:11:40,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b0f8ade/0f233623eadc4e3ba3bf1449e8ac54ce [2019-11-23 21:11:40,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:11:40,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:11:40,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:11:40,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:11:40,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:11:40,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:11:40" (1/1) ... [2019-11-23 21:11:40,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a06d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:40, skipping insertion in model container [2019-11-23 21:11:40,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:11:40" (1/1) ... [2019-11-23 21:11:40,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:11:40,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:11:41,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:11:41,487 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:11:41,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:11:41,746 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:11:41,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41 WrapperNode [2019-11-23 21:11:41,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:11:41,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:11:41,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:11:41,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:11:41,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:41,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:41,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:11:41,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:11:41,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:11:41,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:11:41,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:41,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:41,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:41,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:42,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:42,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:42,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (1/1) ... [2019-11-23 21:11:42,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:11:42,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:11:42,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:11:42,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:11:42,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (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 [2019-11-23 21:11:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:11:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:11:43,655 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:11:43,656 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:11:43,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:11:43 BoogieIcfgContainer [2019-11-23 21:11:43,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:11:43,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:11:43,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:11:43,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:11:43,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:11:40" (1/3) ... [2019-11-23 21:11:43,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d06e696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:11:43, skipping insertion in model container [2019-11-23 21:11:43,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:41" (2/3) ... [2019-11-23 21:11:43,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d06e696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:11:43, skipping insertion in model container [2019-11-23 21:11:43,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:11:43" (3/3) ... [2019-11-23 21:11:43,669 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label23.c [2019-11-23 21:11:43,680 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:11:43,690 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:11:43,701 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:11:43,730 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:11:43,730 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:11:43,730 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:11:43,730 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:11:43,730 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:11:43,730 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:11:43,731 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:11:43,731 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:11:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-23 21:11:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 21:11:43,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:43,768 INFO L410 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] [2019-11-23 21:11:43,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2019-11-23 21:11:43,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:43,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777720209] [2019-11-23 21:11:43,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:11:44,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777720209] [2019-11-23 21:11:44,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:11:44,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:11:44,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679580392] [2019-11-23 21:11:44,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:11:44,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:11:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:44,101 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-23 21:11:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:45,857 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-23 21:11:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:11:45,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-23 21:11:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:45,878 INFO L225 Difference]: With dead ends: 850 [2019-11-23 21:11:45,879 INFO L226 Difference]: Without dead ends: 538 [2019-11-23 21:11:45,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-23 21:11:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-23 21:11:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-23 21:11:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-11-23 21:11:45,967 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 32 [2019-11-23 21:11:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:45,968 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-11-23 21:11:45,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:11:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-11-23 21:11:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-23 21:11:45,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:45,973 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:11:45,974 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:45,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:45,974 INFO L82 PathProgramCache]: Analyzing trace with hash 266816249, now seen corresponding path program 1 times [2019-11-23 21:11:45,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:45,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959375077] [2019-11-23 21:11:45,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:11:46,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959375077] [2019-11-23 21:11:46,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:11:46,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:11:46,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281141412] [2019-11-23 21:11:46,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:11:46,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:11:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:46,184 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-11-23 21:11:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:47,639 INFO L93 Difference]: Finished difference Result 2144 states and 3249 transitions. [2019-11-23 21:11:47,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:11:47,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-23 21:11:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:47,655 INFO L225 Difference]: With dead ends: 2144 [2019-11-23 21:11:47,655 INFO L226 Difference]: Without dead ends: 1608 [2019-11-23 21:11:47,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-11-23 21:11:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2019-11-23 21:11:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-11-23 21:11:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2208 transitions. [2019-11-23 21:11:47,723 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2208 transitions. Word has length 114 [2019-11-23 21:11:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:47,723 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 2208 transitions. [2019-11-23 21:11:47,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:11:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2208 transitions. [2019-11-23 21:11:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-23 21:11:47,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:47,728 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:11:47,728 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:47,729 INFO L82 PathProgramCache]: Analyzing trace with hash -827986371, now seen corresponding path program 1 times [2019-11-23 21:11:47,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:47,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798187987] [2019-11-23 21:11:47,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:11:48,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798187987] [2019-11-23 21:11:48,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417511476] [2019-11-23 21:11:48,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:48,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:11:48,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:11:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 21:11:48,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:11:48,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-23 21:11:48,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296715895] [2019-11-23 21:11:48,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:11:48,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:48,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:11:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:11:48,298 INFO L87 Difference]: Start difference. First operand 1606 states and 2208 transitions. Second operand 3 states. [2019-11-23 21:11:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:49,255 INFO L93 Difference]: Finished difference Result 2854 states and 3985 transitions. [2019-11-23 21:11:49,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:11:49,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-23 21:11:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:49,275 INFO L225 Difference]: With dead ends: 2854 [2019-11-23 21:11:49,275 INFO L226 Difference]: Without dead ends: 2852 [2019-11-23 21:11:49,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:11:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-23 21:11:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1428. [2019-11-23 21:11:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-23 21:11:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1993 transitions. [2019-11-23 21:11:49,336 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1993 transitions. Word has length 138 [2019-11-23 21:11:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:49,337 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1993 transitions. [2019-11-23 21:11:49,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:11:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1993 transitions. [2019-11-23 21:11:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 21:11:49,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:49,341 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 21:11:49,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:49,556 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash 819167030, now seen corresponding path program 1 times [2019-11-23 21:11:49,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:49,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119915253] [2019-11-23 21:11:49,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 21:11:49,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119915253] [2019-11-23 21:11:49,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:11:49,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:11:49,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5179992] [2019-11-23 21:11:49,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:11:49,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:49,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:11:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:49,708 INFO L87 Difference]: Start difference. First operand 1428 states and 1993 transitions. Second operand 4 states. [2019-11-23 21:11:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:51,040 INFO L93 Difference]: Finished difference Result 4278 states and 5972 transitions. [2019-11-23 21:11:51,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:11:51,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-23 21:11:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:51,054 INFO L225 Difference]: With dead ends: 4278 [2019-11-23 21:11:51,054 INFO L226 Difference]: Without dead ends: 2852 [2019-11-23 21:11:51,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:11:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-23 21:11:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2019-11-23 21:11:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2019-11-23 21:11:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3217 transitions. [2019-11-23 21:11:51,108 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3217 transitions. Word has length 177 [2019-11-23 21:11:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:51,109 INFO L462 AbstractCegarLoop]: Abstraction has 2496 states and 3217 transitions. [2019-11-23 21:11:51,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:11:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3217 transitions. [2019-11-23 21:11:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 21:11:51,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:51,112 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:11:51,112 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:51,113 INFO L82 PathProgramCache]: Analyzing trace with hash 872689753, now seen corresponding path program 1 times [2019-11-23 21:11:51,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:51,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052371037] [2019-11-23 21:11:51,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 132 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:11:51,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052371037] [2019-11-23 21:11:51,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433308225] [2019-11-23 21:11:51,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:51,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:11:51,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:11:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:11:51,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:11:51,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 21:11:51,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27120104] [2019-11-23 21:11:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:11:51,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:11:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:11:51,521 INFO L87 Difference]: Start difference. First operand 2496 states and 3217 transitions. Second operand 4 states. [2019-11-23 21:11:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:52,420 INFO L93 Difference]: Finished difference Result 5226 states and 6692 transitions. [2019-11-23 21:11:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:11:52,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-23 21:11:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:52,433 INFO L225 Difference]: With dead ends: 5226 [2019-11-23 21:11:52,433 INFO L226 Difference]: Without dead ends: 2674 [2019-11-23 21:11:52,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:11:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-23 21:11:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-23 21:11:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-23 21:11:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2574 transitions. [2019-11-23 21:11:52,485 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2574 transitions. Word has length 191 [2019-11-23 21:11:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:52,485 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2574 transitions. [2019-11-23 21:11:52,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:11:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2574 transitions. [2019-11-23 21:11:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-23 21:11:52,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:52,490 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 21:11:52,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:52,695 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:52,695 INFO L82 PathProgramCache]: Analyzing trace with hash -424271452, now seen corresponding path program 1 times [2019-11-23 21:11:52,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:52,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095954245] [2019-11-23 21:11:52,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 209 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 21:11:53,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095954245] [2019-11-23 21:11:53,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061646708] [2019-11-23 21:11:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:53,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:11:53,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:11:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-23 21:11:53,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:11:53,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-23 21:11:53,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219206693] [2019-11-23 21:11:53,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:11:53,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:11:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:11:53,746 INFO L87 Difference]: Start difference. First operand 2318 states and 2574 transitions. Second operand 7 states. [2019-11-23 21:11:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:54,814 INFO L93 Difference]: Finished difference Result 4912 states and 5436 transitions. [2019-11-23 21:11:54,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:11:54,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 286 [2019-11-23 21:11:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:54,828 INFO L225 Difference]: With dead ends: 4912 [2019-11-23 21:11:54,828 INFO L226 Difference]: Without dead ends: 2496 [2019-11-23 21:11:54,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:11:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2019-11-23 21:11:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2019-11-23 21:11:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-23 21:11:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2526 transitions. [2019-11-23 21:11:54,893 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2526 transitions. Word has length 286 [2019-11-23 21:11:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:54,894 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2526 transitions. [2019-11-23 21:11:54,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:11:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2526 transitions. [2019-11-23 21:11:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-11-23 21:11:54,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:54,914 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 21:11:55,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:55,127 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1180337235, now seen corresponding path program 1 times [2019-11-23 21:11:55,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:55,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000530374] [2019-11-23 21:11:55,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 551 proven. 4 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-23 21:11:56,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000530374] [2019-11-23 21:11:56,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137821394] [2019-11-23 21:11:56,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:11:56,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:11:56,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:11:56,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:11:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 532 proven. 23 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-23 21:11:56,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:11:56,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-23 21:11:56,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715432195] [2019-11-23 21:11:56,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:11:56,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:11:56,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:11:56,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:11:56,663 INFO L87 Difference]: Start difference. First operand 2318 states and 2526 transitions. Second operand 8 states. [2019-11-23 21:11:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:11:58,680 INFO L93 Difference]: Finished difference Result 5394 states and 5828 transitions. [2019-11-23 21:11:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:11:58,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 521 [2019-11-23 21:11:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:11:58,693 INFO L225 Difference]: With dead ends: 5394 [2019-11-23 21:11:58,693 INFO L226 Difference]: Without dead ends: 3078 [2019-11-23 21:11:58,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:11:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-11-23 21:11:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2318. [2019-11-23 21:11:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-23 21:11:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2524 transitions. [2019-11-23 21:11:58,741 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2524 transitions. Word has length 521 [2019-11-23 21:11:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:11:58,741 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2524 transitions. [2019-11-23 21:11:58,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:11:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2524 transitions. [2019-11-23 21:11:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-11-23 21:11:58,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:11:58,758 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:11:58,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:11:58,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:11:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:11:58,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1907590994, now seen corresponding path program 1 times [2019-11-23 21:11:58,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:11:58,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572235914] [2019-11-23 21:11:58,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:11:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 628 proven. 174 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-23 21:12:00,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572235914] [2019-11-23 21:12:00,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183278264] [2019-11-23 21:12:00,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:12:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:00,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:12:00,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:12:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 773 proven. 29 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-23 21:12:01,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:12:01,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-23 21:12:01,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183120164] [2019-11-23 21:12:01,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:12:01,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:01,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:12:01,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:12:01,673 INFO L87 Difference]: Start difference. First operand 2318 states and 2524 transitions. Second operand 8 states. [2019-11-23 21:12:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:03,001 INFO L93 Difference]: Finished difference Result 5399 states and 5837 transitions. [2019-11-23 21:12:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:12:03,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 655 [2019-11-23 21:12:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:03,014 INFO L225 Difference]: With dead ends: 5399 [2019-11-23 21:12:03,014 INFO L226 Difference]: Without dead ends: 3083 [2019-11-23 21:12:03,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 652 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:12:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-11-23 21:12:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2496. [2019-11-23 21:12:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2019-11-23 21:12:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2706 transitions. [2019-11-23 21:12:03,060 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2706 transitions. Word has length 655 [2019-11-23 21:12:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:03,061 INFO L462 AbstractCegarLoop]: Abstraction has 2496 states and 2706 transitions. [2019-11-23 21:12:03,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:12:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2706 transitions. [2019-11-23 21:12:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-11-23 21:12:03,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:03,076 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:03,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:12:03,280 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1502033299, now seen corresponding path program 1 times [2019-11-23 21:12:03,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:03,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108091963] [2019-11-23 21:12:03,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 813 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-23 21:12:05,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108091963] [2019-11-23 21:12:05,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:05,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:12:05,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006880401] [2019-11-23 21:12:05,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:12:05,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:12:05,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:12:05,022 INFO L87 Difference]: Start difference. First operand 2496 states and 2706 transitions. Second operand 7 states. [2019-11-23 21:12:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:06,752 INFO L93 Difference]: Finished difference Result 5580 states and 6016 transitions. [2019-11-23 21:12:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:12:06,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 666 [2019-11-23 21:12:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:06,766 INFO L225 Difference]: With dead ends: 5580 [2019-11-23 21:12:06,767 INFO L226 Difference]: Without dead ends: 3086 [2019-11-23 21:12:06,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:12:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2019-11-23 21:12:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 2674. [2019-11-23 21:12:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-23 21:12:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2887 transitions. [2019-11-23 21:12:06,829 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2887 transitions. Word has length 666 [2019-11-23 21:12:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:06,832 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2887 transitions. [2019-11-23 21:12:06,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:12:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2887 transitions. [2019-11-23 21:12:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-11-23 21:12:06,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:06,839 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-23 21:12:06,840 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash -834510759, now seen corresponding path program 1 times [2019-11-23 21:12:06,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:06,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754141001] [2019-11-23 21:12:06,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 1037 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-11-23 21:12:07,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754141001] [2019-11-23 21:12:07,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:07,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:12:07,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025197772] [2019-11-23 21:12:07,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:12:07,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:12:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:12:07,372 INFO L87 Difference]: Start difference. First operand 2674 states and 2887 transitions. Second operand 3 states. [2019-11-23 21:12:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:08,029 INFO L93 Difference]: Finished difference Result 6592 states and 7106 transitions. [2019-11-23 21:12:08,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:12:08,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 682 [2019-11-23 21:12:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:08,041 INFO L225 Difference]: With dead ends: 6592 [2019-11-23 21:12:08,041 INFO L226 Difference]: Without dead ends: 3920 [2019-11-23 21:12:08,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:12:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-23 21:12:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-23 21:12:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-23 21:12:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4015 transitions. [2019-11-23 21:12:08,101 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4015 transitions. Word has length 682 [2019-11-23 21:12:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:08,101 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 4015 transitions. [2019-11-23 21:12:08,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:12:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4015 transitions. [2019-11-23 21:12:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2019-11-23 21:12:08,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:08,110 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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, 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] [2019-11-23 21:12:08,110 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash -907298080, now seen corresponding path program 1 times [2019-11-23 21:12:08,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:08,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195363506] [2019-11-23 21:12:08,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2149 backedges. 1373 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-11-23 21:12:08,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195363506] [2019-11-23 21:12:08,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:08,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:12:08,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421999458] [2019-11-23 21:12:08,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:08,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:08,675 INFO L87 Difference]: Start difference. First operand 3742 states and 4015 transitions. Second operand 4 states. [2019-11-23 21:12:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:09,750 INFO L93 Difference]: Finished difference Result 9262 states and 10025 transitions. [2019-11-23 21:12:09,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:09,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 837 [2019-11-23 21:12:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:09,783 INFO L225 Difference]: With dead ends: 9262 [2019-11-23 21:12:09,783 INFO L226 Difference]: Without dead ends: 5522 [2019-11-23 21:12:09,791 INFO L630 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 [2019-11-23 21:12:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-11-23 21:12:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4988. [2019-11-23 21:12:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-23 21:12:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5322 transitions. [2019-11-23 21:12:09,882 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5322 transitions. Word has length 837 [2019-11-23 21:12:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:09,883 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5322 transitions. [2019-11-23 21:12:09,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5322 transitions. [2019-11-23 21:12:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2019-11-23 21:12:09,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:09,894 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:09,894 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:09,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:09,895 INFO L82 PathProgramCache]: Analyzing trace with hash -596181461, now seen corresponding path program 1 times [2019-11-23 21:12:09,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:09,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202842044] [2019-11-23 21:12:09,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1552 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-11-23 21:12:11,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202842044] [2019-11-23 21:12:11,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:11,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:12:11,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306266559] [2019-11-23 21:12:11,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:12:11,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:11,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:12:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:12:11,240 INFO L87 Difference]: Start difference. First operand 4988 states and 5322 transitions. Second operand 7 states. [2019-11-23 21:12:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:12,579 INFO L93 Difference]: Finished difference Result 10155 states and 10829 transitions. [2019-11-23 21:12:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:12:12,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 858 [2019-11-23 21:12:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:12,588 INFO L225 Difference]: With dead ends: 10155 [2019-11-23 21:12:12,588 INFO L226 Difference]: Without dead ends: 5347 [2019-11-23 21:12:12,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:12:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2019-11-23 21:12:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 4988. [2019-11-23 21:12:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-23 21:12:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5317 transitions. [2019-11-23 21:12:12,661 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5317 transitions. Word has length 858 [2019-11-23 21:12:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:12,662 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5317 transitions. [2019-11-23 21:12:12,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:12:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5317 transitions. [2019-11-23 21:12:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2019-11-23 21:12:12,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:12,672 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:12,672 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1984770699, now seen corresponding path program 1 times [2019-11-23 21:12:12,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:12,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494433826] [2019-11-23 21:12:12,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-11-23 21:12:13,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494433826] [2019-11-23 21:12:13,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:13,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:12:13,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519551540] [2019-11-23 21:12:13,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:13,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:13,445 INFO L87 Difference]: Start difference. First operand 4988 states and 5317 transitions. Second operand 4 states. [2019-11-23 21:12:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:14,397 INFO L93 Difference]: Finished difference Result 11398 states and 12149 transitions. [2019-11-23 21:12:14,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:14,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 935 [2019-11-23 21:12:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:14,412 INFO L225 Difference]: With dead ends: 11398 [2019-11-23 21:12:14,413 INFO L226 Difference]: Without dead ends: 5166 [2019-11-23 21:12:14,418 INFO L630 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 [2019-11-23 21:12:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-23 21:12:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2019-11-23 21:12:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-23 21:12:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4894 transitions. [2019-11-23 21:12:14,477 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4894 transitions. Word has length 935 [2019-11-23 21:12:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:14,478 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4894 transitions. [2019-11-23 21:12:14,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4894 transitions. [2019-11-23 21:12:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2019-11-23 21:12:14,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:14,491 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:14,491 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:14,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash 870770276, now seen corresponding path program 1 times [2019-11-23 21:12:14,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:14,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886887410] [2019-11-23 21:12:14,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-23 21:12:15,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886887410] [2019-11-23 21:12:15,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:15,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:12:15,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261506863] [2019-11-23 21:12:15,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:15,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:15,433 INFO L87 Difference]: Start difference. First operand 4632 states and 4894 transitions. Second operand 4 states. [2019-11-23 21:12:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:16,445 INFO L93 Difference]: Finished difference Result 9262 states and 9793 transitions. [2019-11-23 21:12:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:16,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1007 [2019-11-23 21:12:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:16,453 INFO L225 Difference]: With dead ends: 9262 [2019-11-23 21:12:16,453 INFO L226 Difference]: Without dead ends: 4810 [2019-11-23 21:12:16,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-23 21:12:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4454. [2019-11-23 21:12:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-23 21:12:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4654 transitions. [2019-11-23 21:12:16,514 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4654 transitions. Word has length 1007 [2019-11-23 21:12:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:16,515 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4654 transitions. [2019-11-23 21:12:16,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4654 transitions. [2019-11-23 21:12:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-11-23 21:12:16,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:16,534 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:16,534 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash -730527857, now seen corresponding path program 1 times [2019-11-23 21:12:16,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:16,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206152060] [2019-11-23 21:12:16,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3487 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2019-11-23 21:12:17,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206152060] [2019-11-23 21:12:17,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:17,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:12:17,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53942790] [2019-11-23 21:12:17,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:17,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:17,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:17,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:17,769 INFO L87 Difference]: Start difference. First operand 4454 states and 4654 transitions. Second operand 4 states. [2019-11-23 21:12:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:18,453 INFO L93 Difference]: Finished difference Result 8750 states and 9149 transitions. [2019-11-23 21:12:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:18,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1032 [2019-11-23 21:12:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:18,464 INFO L225 Difference]: With dead ends: 8750 [2019-11-23 21:12:18,464 INFO L226 Difference]: Without dead ends: 4454 [2019-11-23 21:12:18,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-23 21:12:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2019-11-23 21:12:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-23 21:12:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4650 transitions. [2019-11-23 21:12:18,525 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4650 transitions. Word has length 1032 [2019-11-23 21:12:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:18,526 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4650 transitions. [2019-11-23 21:12:18,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4650 transitions. [2019-11-23 21:12:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2019-11-23 21:12:18,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:18,539 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:18,540 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:18,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:18,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1412080206, now seen corresponding path program 1 times [2019-11-23 21:12:18,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:18,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436994447] [2019-11-23 21:12:18,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3539 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 2648 trivial. 0 not checked. [2019-11-23 21:12:19,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436994447] [2019-11-23 21:12:19,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:19,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:12:19,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150337732] [2019-11-23 21:12:19,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:19,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:19,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:19,430 INFO L87 Difference]: Start difference. First operand 4454 states and 4650 transitions. Second operand 4 states. [2019-11-23 21:12:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:20,384 INFO L93 Difference]: Finished difference Result 8906 states and 9298 transitions. [2019-11-23 21:12:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:20,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1046 [2019-11-23 21:12:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:20,390 INFO L225 Difference]: With dead ends: 8906 [2019-11-23 21:12:20,390 INFO L226 Difference]: Without dead ends: 4632 [2019-11-23 21:12:20,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-23 21:12:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2019-11-23 21:12:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-11-23 21:12:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4443 transitions. [2019-11-23 21:12:20,460 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4443 transitions. Word has length 1046 [2019-11-23 21:12:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:20,462 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4443 transitions. [2019-11-23 21:12:20,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4443 transitions. [2019-11-23 21:12:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2019-11-23 21:12:20,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:20,479 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:20,480 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash -166325796, now seen corresponding path program 1 times [2019-11-23 21:12:20,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:20,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326468180] [2019-11-23 21:12:20,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 1603 proven. 6 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-23 21:12:21,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326468180] [2019-11-23 21:12:21,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952919856] [2019-11-23 21:12:21,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:12:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:21,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:12:21,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:12:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-23 21:12:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:12:23,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 21:12:23,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43081835] [2019-11-23 21:12:23,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:23,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:12:23,164 INFO L87 Difference]: Start difference. First operand 4276 states and 4443 transitions. Second operand 4 states. [2019-11-23 21:12:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:24,173 INFO L93 Difference]: Finished difference Result 8728 states and 9105 transitions. [2019-11-23 21:12:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:24,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1055 [2019-11-23 21:12:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:24,182 INFO L225 Difference]: With dead ends: 8728 [2019-11-23 21:12:24,183 INFO L226 Difference]: Without dead ends: 4632 [2019-11-23 21:12:24,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1055 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:12:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-23 21:12:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2019-11-23 21:12:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-23 21:12:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4625 transitions. [2019-11-23 21:12:24,246 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4625 transitions. Word has length 1055 [2019-11-23 21:12:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:24,248 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4625 transitions. [2019-11-23 21:12:24,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4625 transitions. [2019-11-23 21:12:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2019-11-23 21:12:24,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:24,269 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:12:24,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:12:24,474 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash 199964749, now seen corresponding path program 1 times [2019-11-23 21:12:24,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:24,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341446811] [2019-11-23 21:12:24,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 3390 trivial. 0 not checked. [2019-11-23 21:12:25,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341446811] [2019-11-23 21:12:25,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:25,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:12:25,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038457727] [2019-11-23 21:12:25,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:25,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:25,336 INFO L87 Difference]: Start difference. First operand 4454 states and 4625 transitions. Second operand 4 states. [2019-11-23 21:12:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:26,324 INFO L93 Difference]: Finished difference Result 9972 states and 10351 transitions. [2019-11-23 21:12:26,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:26,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1108 [2019-11-23 21:12:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:26,325 INFO L225 Difference]: With dead ends: 9972 [2019-11-23 21:12:26,325 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:12:26,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:12:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:12:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:12:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:12:26,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1108 [2019-11-23 21:12:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:26,333 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:12:26,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:12:26,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:12:26,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:12:26,889 WARN L192 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 195 [2019-11-23 21:12:27,325 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 198 [2019-11-23 21:12:28,160 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 51 [2019-11-23 21:12:29,148 WARN L192 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 51 [2019-11-23 21:12:29,152 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-23 21:12:29,152 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:12:29,153 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-23 21:12:29,154 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,155 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-23 21:12:29,156 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-23 21:12:29,157 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-23 21:12:29,158 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:12:29,159 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:12:29,160 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,161 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,162 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-23 21:12:29,163 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:12:29,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:12:29,165 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:12:29,166 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:12:29,167 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:12:29,168 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:12:29,169 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-23 21:12:29,169 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-23 21:12:29,170 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-23 21:12:29,170 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,170 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,170 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse2 (= ~a21~0 10))) (let ((.cse3 (<= 0 (+ ~a12~0 41))) (.cse1 (<= 8 ~a15~0)) (.cse4 (not .cse2)) (.cse6 (<= ~a15~0 8)) (.cse0 (= ~a24~0 1)) (.cse7 (not (= ~a15~0 6)))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse0 .cse2) (and .cse0 (<= ~a12~0 11) .cse3) (and .cse0 .cse3 .cse4) (and (= ~a21~0 6) .cse0 (= ~a15~0 5)) (and (let ((.cse5 (<= (+ ~a12~0 49) 0))) (or (and .cse1 .cse5) (and .cse5 .cse4))) .cse6 .cse7) (and .cse0 .cse6 (= ~a21~0 9)) (and .cse0 (= ~a21~0 8) .cse7) (and .cse0 .cse2 (< 0 (+ ~a12~0 43)) .cse7)))) [2019-11-23 21:12:29,170 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,171 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:12:29,172 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse2 (= ~a21~0 10))) (let ((.cse3 (<= 0 (+ ~a12~0 41))) (.cse1 (<= 8 ~a15~0)) (.cse4 (not .cse2)) (.cse6 (<= ~a15~0 8)) (.cse0 (= ~a24~0 1)) (.cse7 (not (= ~a15~0 6)))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse0 .cse2) (and .cse0 (<= ~a12~0 11) .cse3) (and .cse0 .cse3 .cse4) (and (= ~a21~0 6) .cse0 (= ~a15~0 5)) (and (let ((.cse5 (<= (+ ~a12~0 49) 0))) (or (and .cse1 .cse5) (and .cse5 .cse4))) .cse6 .cse7) (and .cse0 .cse6 (= ~a21~0 9)) (and .cse0 (= ~a21~0 8) .cse7) (and .cse0 .cse2 (< 0 (+ ~a12~0 43)) .cse7)))) [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:12:29,173 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-23 21:12:29,174 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,175 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,176 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:12:29,177 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-23 21:12:29,177 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:12:29,177 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:12:29,177 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:12:29,177 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-23 21:12:29,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:12:29 BoogieIcfgContainer [2019-11-23 21:12:29,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:12:29,205 INFO L168 Benchmark]: Toolchain (without parser) took 48383.40 ms. Allocated memory was 143.7 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 99.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-11-23 21:12:29,206 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 21:12:29,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 927.36 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.0 MB in the beginning and 155.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:12:29,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.86 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 145.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:12:29,208 INFO L168 Benchmark]: Boogie Preprocessor took 160.74 ms. Allocated memory is still 201.3 MB. Free memory was 145.1 MB in the beginning and 138.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2019-11-23 21:12:29,208 INFO L168 Benchmark]: RCFGBuilder took 1555.85 ms. Allocated memory was 201.3 MB in the beginning and 231.7 MB in the end (delta: 30.4 MB). Free memory was 138.7 MB in the beginning and 126.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:12:29,209 INFO L168 Benchmark]: TraceAbstraction took 45540.42 ms. Allocated memory was 231.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 126.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-11-23 21:12:29,217 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 927.36 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.0 MB in the beginning and 155.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 193.86 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 145.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.74 ms. Allocated memory is still 201.3 MB. Free memory was 145.1 MB in the beginning and 138.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1555.85 ms. Allocated memory was 201.3 MB in the beginning and 231.7 MB in the end (delta: 30.4 MB). Free memory was 138.7 MB in the beginning and 126.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45540.42 ms. Allocated memory was 231.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 126.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((a15 == 7 && a24 == 1) || ((8 <= a15 && a24 == 1) && a21 == 10)) || ((a24 == 1 && a12 <= 11) && 0 <= a12 + 41)) || ((a24 == 1 && 0 <= a12 + 41) && !(a21 == 10))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((8 <= a15 && a12 + 49 <= 0) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8) && !(a15 == 6))) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || ((a24 == 1 && a21 == 8) && !(a15 == 6))) || (((a24 == 1 && a21 == 10) && 0 < a12 + 43) && !(a15 == 6)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((a15 == 7 && a24 == 1) || ((8 <= a15 && a24 == 1) && a21 == 10)) || ((a24 == 1 && a12 <= 11) && 0 <= a12 + 41)) || ((a24 == 1 && 0 <= a12 + 41) && !(a21 == 10))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((8 <= a15 && a12 + 49 <= 0) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8) && !(a15 == 6))) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || ((a24 == 1 && a21 == 8) && !(a15 == 6))) || (((a24 == 1 && a21 == 10) && 0 < a12 + 43) && !(a15 == 6)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 45.4s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, HoareTripleCheckerStatistics: 722 SDtfs, 4832 SDslu, 234 SDs, 0 SdLazy, 16343 SolverSat, 1773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2939 GetRequests, 2852 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 6570 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 96 NumberOfFragments, 237 HoareAnnotationTreeSize, 3 FomulaSimplifications, 86693 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 34425 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 14186 NumberOfCodeBlocks, 14186 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14162 ConstructedInterpolants, 0 QuantifiedInterpolants, 34634166 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3603 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 35339/35651 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...