/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/Problem15_label34.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:14:46,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:14:46,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:14:46,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:14:46,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:14:46,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:14:46,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:14:46,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:14:46,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:14:46,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:14:46,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:14:46,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:14:46,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:14:46,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:14:46,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:14:46,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:14:46,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:14:46,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:14:46,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:14:46,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:14:46,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:14:46,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:14:46,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:14:46,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:14:46,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:14:46,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:14:46,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:14:46,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:14:46,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:14:46,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:14:46,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:14:46,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:14:46,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:14:46,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:14:46,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:14:46,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:14:46,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:14:46,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:14:46,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:14:46,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:14:46,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:14:46,582 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:14:46,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:14:46,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:14:46,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:14:46,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:14:46,598 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:14:46,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:14:46,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:14:46,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:14:46,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:14:46,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:14:46,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:14:46,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:14:46,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:14:46,599 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:14:46,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:14:46,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:14:46,600 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:14:46,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:14:46,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:14:46,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:14:46,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:14:46,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:14:46,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:14:46,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:14:46,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:14:46,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:14:46,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:14:46,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:14:46,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:14:46,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:14:46,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:14:46,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:14:46,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:14:46,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:14:46,870 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:14:46,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label34.c [2019-11-23 21:14:46,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fddfd98a6/4c737c2026f1410c8f5cb2e1b0bae1c0/FLAGa0cb24718 [2019-11-23 21:14:47,593 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:14:47,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label34.c [2019-11-23 21:14:47,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fddfd98a6/4c737c2026f1410c8f5cb2e1b0bae1c0/FLAGa0cb24718 [2019-11-23 21:14:47,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fddfd98a6/4c737c2026f1410c8f5cb2e1b0bae1c0 [2019-11-23 21:14:47,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:14:47,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:14:47,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:14:47,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:14:47,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:14:47,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:14:47" (1/1) ... [2019-11-23 21:14:47,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449a90aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:47, skipping insertion in model container [2019-11-23 21:14:47,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:14:47" (1/1) ... [2019-11-23 21:14:47,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:14:47,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:14:48,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:14:48,907 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:14:49,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:14:49,141 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:14:49,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49 WrapperNode [2019-11-23 21:14:49,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:14:49,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:14:49,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:14:49,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:14:49,153 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:14:49" (1/1) ... [2019-11-23 21:14:49,183 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:14:49" (1/1) ... [2019-11-23 21:14:49,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:14:49,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:14:49,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:14:49,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:14:49,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (1/1) ... [2019-11-23 21:14:49,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (1/1) ... [2019-11-23 21:14:49,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (1/1) ... [2019-11-23 21:14:49,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (1/1) ... [2019-11-23 21:14:49,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (1/1) ... [2019-11-23 21:14:49,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (1/1) ... [2019-11-23 21:14:49,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (1/1) ... [2019-11-23 21:14:49,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:14:49,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:14:49,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:14:49,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:14:49,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (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:14:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:14:49,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:14:53,505 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:14:53,506 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:14:53,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:14:53 BoogieIcfgContainer [2019-11-23 21:14:53,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:14:53,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:14:53,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:14:53,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:14:53,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:14:47" (1/3) ... [2019-11-23 21:14:53,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64617dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:14:53, skipping insertion in model container [2019-11-23 21:14:53,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:49" (2/3) ... [2019-11-23 21:14:53,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64617dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:14:53, skipping insertion in model container [2019-11-23 21:14:53,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:14:53" (3/3) ... [2019-11-23 21:14:53,520 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label34.c [2019-11-23 21:14:53,530 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:14:53,541 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:14:53,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:14:53,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:14:53,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:14:53,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:14:53,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:14:53,600 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:14:53,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:14:53,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:14:53,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:14:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-23 21:14:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 21:14:53,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:53,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:14:53,644 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -461255479, now seen corresponding path program 1 times [2019-11-23 21:14:53,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:53,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159912344] [2019-11-23 21:14:53,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:53,863 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:14:53,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159912344] [2019-11-23 21:14:53,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:53,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:14:53,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583560297] [2019-11-23 21:14:53,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:53,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:53,889 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-23 21:14:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:58,519 INFO L93 Difference]: Finished difference Result 1514 states and 2788 transitions. [2019-11-23 21:14:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:58,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-23 21:14:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:58,548 INFO L225 Difference]: With dead ends: 1514 [2019-11-23 21:14:58,548 INFO L226 Difference]: Without dead ends: 1008 [2019-11-23 21:14:58,554 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:14:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-23 21:14:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 985. [2019-11-23 21:14:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-11-23 21:14:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1598 transitions. [2019-11-23 21:14:58,650 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1598 transitions. Word has length 13 [2019-11-23 21:14:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:58,651 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1598 transitions. [2019-11-23 21:14:58,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1598 transitions. [2019-11-23 21:14:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 21:14:58,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:58,655 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:14:58,655 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 548830201, now seen corresponding path program 1 times [2019-11-23 21:14:58,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:58,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415474846] [2019-11-23 21:14:58,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:14:58,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415474846] [2019-11-23 21:14:58,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:58,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:14:58,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988046569] [2019-11-23 21:14:58,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:58,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:58,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:58,915 INFO L87 Difference]: Start difference. First operand 985 states and 1598 transitions. Second operand 4 states. [2019-11-23 21:15:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:01,979 INFO L93 Difference]: Finished difference Result 3768 states and 6161 transitions. [2019-11-23 21:15:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:15:01,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-23 21:15:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:01,994 INFO L225 Difference]: With dead ends: 3768 [2019-11-23 21:15:01,995 INFO L226 Difference]: Without dead ends: 2785 [2019-11-23 21:15:02,002 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:15:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2019-11-23 21:15:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 1882. [2019-11-23 21:15:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2019-11-23 21:15:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2628 transitions. [2019-11-23 21:15:02,080 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2628 transitions. Word has length 81 [2019-11-23 21:15:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:02,081 INFO L462 AbstractCegarLoop]: Abstraction has 1882 states and 2628 transitions. [2019-11-23 21:15:02,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:15:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2628 transitions. [2019-11-23 21:15:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 21:15:02,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:02,087 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:15:02,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 378919309, now seen corresponding path program 1 times [2019-11-23 21:15:02,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:02,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037068623] [2019-11-23 21:15:02,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:15:02,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037068623] [2019-11-23 21:15:02,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:02,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:15:02,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499103230] [2019-11-23 21:15:02,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:15:02,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:15:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:15:02,458 INFO L87 Difference]: Start difference. First operand 1882 states and 2628 transitions. Second operand 6 states. [2019-11-23 21:15:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:13,230 INFO L93 Difference]: Finished difference Result 5882 states and 8099 transitions. [2019-11-23 21:15:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:15:13,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-11-23 21:15:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:13,251 INFO L225 Difference]: With dead ends: 5882 [2019-11-23 21:15:13,251 INFO L226 Difference]: Without dead ends: 4002 [2019-11-23 21:15:13,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:15:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2019-11-23 21:15:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3389. [2019-11-23 21:15:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3389 states. [2019-11-23 21:15:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4473 transitions. [2019-11-23 21:15:13,321 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4473 transitions. Word has length 89 [2019-11-23 21:15:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:13,321 INFO L462 AbstractCegarLoop]: Abstraction has 3389 states and 4473 transitions. [2019-11-23 21:15:13,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:15:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4473 transitions. [2019-11-23 21:15:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 21:15:13,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:13,325 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 21:15:13,325 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -34468414, now seen corresponding path program 1 times [2019-11-23 21:15:13,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:13,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890218092] [2019-11-23 21:15:13,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 92 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:15:13,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890218092] [2019-11-23 21:15:13,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652149426] [2019-11-23 21:15:13,863 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:15:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:14,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 21:15:14,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:15:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:15:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:15:14,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:15:14,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-23 21:15:14,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233916037] [2019-11-23 21:15:14,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:15:14,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:15:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:15:14,278 INFO L87 Difference]: Start difference. First operand 3389 states and 4473 transitions. Second operand 12 states. [2019-11-23 21:15:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:27,717 INFO L93 Difference]: Finished difference Result 10839 states and 14199 transitions. [2019-11-23 21:15:27,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 21:15:27,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2019-11-23 21:15:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:27,744 INFO L225 Difference]: With dead ends: 10839 [2019-11-23 21:15:27,745 INFO L226 Difference]: Without dead ends: 5801 [2019-11-23 21:15:27,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:15:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-11-23 21:15:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 4897. [2019-11-23 21:15:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2019-11-23 21:15:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 5747 transitions. [2019-11-23 21:15:27,840 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 5747 transitions. Word has length 180 [2019-11-23 21:15:27,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:27,841 INFO L462 AbstractCegarLoop]: Abstraction has 4897 states and 5747 transitions. [2019-11-23 21:15:27,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:15:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 5747 transitions. [2019-11-23 21:15:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-23 21:15:27,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:27,844 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:28,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:15:28,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash -883157980, now seen corresponding path program 1 times [2019-11-23 21:15:28,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:28,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47242709] [2019-11-23 21:15:28,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 21:15:28,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47242709] [2019-11-23 21:15:28,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561712242] [2019-11-23 21:15:28,554 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:15:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:28,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:15:28,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:15:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 21:15:28,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:15:28,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 21:15:28,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977761909] [2019-11-23 21:15:28,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:28,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:15:28,876 INFO L87 Difference]: Start difference. First operand 4897 states and 5747 transitions. Second operand 3 states. [2019-11-23 21:15:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:30,830 INFO L93 Difference]: Finished difference Result 11590 states and 13475 transitions. [2019-11-23 21:15:30,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:30,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-11-23 21:15:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:30,860 INFO L225 Difference]: With dead ends: 11590 [2019-11-23 21:15:30,860 INFO L226 Difference]: Without dead ends: 6695 [2019-11-23 21:15:30,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 295 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:15:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6695 states. [2019-11-23 21:15:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6695 to 6394. [2019-11-23 21:15:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6394 states. [2019-11-23 21:15:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6394 states to 6394 states and 7320 transitions. [2019-11-23 21:15:30,976 INFO L78 Accepts]: Start accepts. Automaton has 6394 states and 7320 transitions. Word has length 295 [2019-11-23 21:15:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:30,978 INFO L462 AbstractCegarLoop]: Abstraction has 6394 states and 7320 transitions. [2019-11-23 21:15:30,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6394 states and 7320 transitions. [2019-11-23 21:15:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-23 21:15:30,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:30,986 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:31,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:15:31,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1678423318, now seen corresponding path program 1 times [2019-11-23 21:15:31,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:31,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641616239] [2019-11-23 21:15:31,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:15:32,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641616239] [2019-11-23 21:15:32,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291499528] [2019-11-23 21:15:32,594 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:15:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:32,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:15:32,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:15:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:15:32,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:15:32,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-11-23 21:15:32,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543930937] [2019-11-23 21:15:32,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:32,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:32,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:32,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:15:32,855 INFO L87 Difference]: Start difference. First operand 6394 states and 7320 transitions. Second operand 3 states. [2019-11-23 21:15:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:34,665 INFO L93 Difference]: Finished difference Result 16078 states and 18626 transitions. [2019-11-23 21:15:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:34,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-23 21:15:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:34,700 INFO L225 Difference]: With dead ends: 16078 [2019-11-23 21:15:34,700 INFO L226 Difference]: Without dead ends: 9686 [2019-11-23 21:15:34,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 358 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:15:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9686 states. [2019-11-23 21:15:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9686 to 8487. [2019-11-23 21:15:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8487 states. [2019-11-23 21:15:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8487 states to 8487 states and 9655 transitions. [2019-11-23 21:15:34,832 INFO L78 Accepts]: Start accepts. Automaton has 8487 states and 9655 transitions. Word has length 359 [2019-11-23 21:15:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:34,833 INFO L462 AbstractCegarLoop]: Abstraction has 8487 states and 9655 transitions. [2019-11-23 21:15:34,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:34,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8487 states and 9655 transitions. [2019-11-23 21:15:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-23 21:15:34,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:34,839 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:35,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:15:35,043 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash 706730256, now seen corresponding path program 1 times [2019-11-23 21:15:35,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:35,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044203193] [2019-11-23 21:15:35,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:15:35,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044203193] [2019-11-23 21:15:35,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:35,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:35,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469712843] [2019-11-23 21:15:35,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:35,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:35,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:35,362 INFO L87 Difference]: Start difference. First operand 8487 states and 9655 transitions. Second operand 3 states. [2019-11-23 21:15:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:37,016 INFO L93 Difference]: Finished difference Result 19664 states and 22657 transitions. [2019-11-23 21:15:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:37,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 390 [2019-11-23 21:15:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:37,051 INFO L225 Difference]: With dead ends: 19664 [2019-11-23 21:15:37,051 INFO L226 Difference]: Without dead ends: 11179 [2019-11-23 21:15:37,060 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:15:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11179 states. [2019-11-23 21:15:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11179 to 10278. [2019-11-23 21:15:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10278 states. [2019-11-23 21:15:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10278 states to 10278 states and 11549 transitions. [2019-11-23 21:15:37,202 INFO L78 Accepts]: Start accepts. Automaton has 10278 states and 11549 transitions. Word has length 390 [2019-11-23 21:15:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:37,203 INFO L462 AbstractCegarLoop]: Abstraction has 10278 states and 11549 transitions. [2019-11-23 21:15:37,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 10278 states and 11549 transitions. [2019-11-23 21:15:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-23 21:15:37,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:37,217 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:37,217 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:37,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1105945566, now seen corresponding path program 1 times [2019-11-23 21:15:37,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:37,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959888637] [2019-11-23 21:15:37,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 288 proven. 106 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 21:15:38,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959888637] [2019-11-23 21:15:38,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304583370] [2019-11-23 21:15:38,686 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:15:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:38,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:15:38,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:15:38,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:15:38,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:38,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 298 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:15:40,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:15:40,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2019-11-23 21:15:40,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578911550] [2019-11-23 21:15:40,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:15:40,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:15:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:15:40,006 INFO L87 Difference]: Start difference. First operand 10278 states and 11549 transitions. Second operand 12 states. [2019-11-23 21:15:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:52,735 INFO L93 Difference]: Finished difference Result 29363 states and 33014 transitions. [2019-11-23 21:15:52,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 21:15:52,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 551 [2019-11-23 21:15:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:52,777 INFO L225 Difference]: With dead ends: 29363 [2019-11-23 21:15:52,777 INFO L226 Difference]: Without dead ends: 19087 [2019-11-23 21:15:52,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 553 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:15:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19087 states. [2019-11-23 21:15:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19087 to 16871. [2019-11-23 21:15:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16871 states. [2019-11-23 21:15:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16871 states to 16871 states and 18879 transitions. [2019-11-23 21:15:53,135 INFO L78 Accepts]: Start accepts. Automaton has 16871 states and 18879 transitions. Word has length 551 [2019-11-23 21:15:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:53,136 INFO L462 AbstractCegarLoop]: Abstraction has 16871 states and 18879 transitions. [2019-11-23 21:15:53,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:15:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 16871 states and 18879 transitions. [2019-11-23 21:15:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-11-23 21:15:53,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:53,153 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:15:53,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:15:53,358 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash -250617614, now seen corresponding path program 1 times [2019-11-23 21:15:53,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:53,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710115309] [2019-11-23 21:15:53,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2019-11-23 21:15:53,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710115309] [2019-11-23 21:15:53,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:53,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:53,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79267680] [2019-11-23 21:15:53,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:53,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:53,778 INFO L87 Difference]: Start difference. First operand 16871 states and 18879 transitions. Second operand 3 states. [2019-11-23 21:15:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:55,998 INFO L93 Difference]: Finished difference Result 42708 states and 48015 transitions. [2019-11-23 21:15:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:55,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 593 [2019-11-23 21:15:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:56,027 INFO L225 Difference]: With dead ends: 42708 [2019-11-23 21:15:56,027 INFO L226 Difference]: Without dead ends: 21653 [2019-11-23 21:15:56,047 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:15:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21653 states. [2019-11-23 21:15:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21653 to 20155. [2019-11-23 21:15:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20155 states. [2019-11-23 21:15:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20155 states to 20155 states and 21891 transitions. [2019-11-23 21:15:56,453 INFO L78 Accepts]: Start accepts. Automaton has 20155 states and 21891 transitions. Word has length 593 [2019-11-23 21:15:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:56,454 INFO L462 AbstractCegarLoop]: Abstraction has 20155 states and 21891 transitions. [2019-11-23 21:15:56,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20155 states and 21891 transitions. [2019-11-23 21:15:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-23 21:15:56,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:56,480 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-23 21:15:56,480 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash -342176457, now seen corresponding path program 1 times [2019-11-23 21:15:56,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:56,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360852970] [2019-11-23 21:15:56,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-23 21:15:56,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360852970] [2019-11-23 21:15:56,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:56,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:56,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711935545] [2019-11-23 21:15:56,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:56,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:56,917 INFO L87 Difference]: Start difference. First operand 20155 states and 21891 transitions. Second operand 3 states. [2019-11-23 21:15:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:59,075 INFO L93 Difference]: Finished difference Result 43595 states and 47679 transitions. [2019-11-23 21:15:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:59,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 608 [2019-11-23 21:15:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:59,102 INFO L225 Difference]: With dead ends: 43595 [2019-11-23 21:15:59,102 INFO L226 Difference]: Without dead ends: 23442 [2019-11-23 21:15:59,117 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:15:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23442 states. [2019-11-23 21:16:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23442 to 21944. [2019-11-23 21:16:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21944 states. [2019-11-23 21:16:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21944 states to 21944 states and 24009 transitions. [2019-11-23 21:16:00,250 INFO L78 Accepts]: Start accepts. Automaton has 21944 states and 24009 transitions. Word has length 608 [2019-11-23 21:16:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:00,251 INFO L462 AbstractCegarLoop]: Abstraction has 21944 states and 24009 transitions. [2019-11-23 21:16:00,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21944 states and 24009 transitions. [2019-11-23 21:16:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-11-23 21:16:00,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:00,260 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:00,261 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash 308251909, now seen corresponding path program 1 times [2019-11-23 21:16:00,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:00,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294219575] [2019-11-23 21:16:00,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-23 21:16:00,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294219575] [2019-11-23 21:16:00,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:00,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:00,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871736154] [2019-11-23 21:16:00,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:00,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:00,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:16:00,734 INFO L87 Difference]: Start difference. First operand 21944 states and 24009 transitions. Second operand 3 states. [2019-11-23 21:16:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:02,210 INFO L93 Difference]: Finished difference Result 43883 states and 48013 transitions. [2019-11-23 21:16:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:02,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 621 [2019-11-23 21:16:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:02,237 INFO L225 Difference]: With dead ends: 43883 [2019-11-23 21:16:02,237 INFO L226 Difference]: Without dead ends: 21941 [2019-11-23 21:16:02,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:16:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21941 states. [2019-11-23 21:16:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21941 to 21940. [2019-11-23 21:16:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21940 states. [2019-11-23 21:16:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21940 states to 21940 states and 24002 transitions. [2019-11-23 21:16:02,466 INFO L78 Accepts]: Start accepts. Automaton has 21940 states and 24002 transitions. Word has length 621 [2019-11-23 21:16:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:02,467 INFO L462 AbstractCegarLoop]: Abstraction has 21940 states and 24002 transitions. [2019-11-23 21:16:02,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 21940 states and 24002 transitions. [2019-11-23 21:16:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2019-11-23 21:16:02,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:02,479 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:16:02,479 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -9315693, now seen corresponding path program 1 times [2019-11-23 21:16:02,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:02,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421873338] [2019-11-23 21:16:02,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 21:16:03,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421873338] [2019-11-23 21:16:03,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:03,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:03,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841451430] [2019-11-23 21:16:03,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:03,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:03,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:03,141 INFO L87 Difference]: Start difference. First operand 21940 states and 24002 transitions. Second operand 4 states. [2019-11-23 21:16:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:05,226 INFO L93 Difference]: Finished difference Result 43584 states and 47644 transitions. [2019-11-23 21:16:05,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:05,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 665 [2019-11-23 21:16:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:05,249 INFO L225 Difference]: With dead ends: 43584 [2019-11-23 21:16:05,249 INFO L226 Difference]: Without dead ends: 21646 [2019-11-23 21:16:05,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:16:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21646 states. [2019-11-23 21:16:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21646 to 21637. [2019-11-23 21:16:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21637 states. [2019-11-23 21:16:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21637 states to 21637 states and 23328 transitions. [2019-11-23 21:16:05,598 INFO L78 Accepts]: Start accepts. Automaton has 21637 states and 23328 transitions. Word has length 665 [2019-11-23 21:16:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:05,599 INFO L462 AbstractCegarLoop]: Abstraction has 21637 states and 23328 transitions. [2019-11-23 21:16:05,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21637 states and 23328 transitions. [2019-11-23 21:16:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-11-23 21:16:05,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:05,611 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:05,612 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash 121193291, now seen corresponding path program 1 times [2019-11-23 21:16:05,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:05,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700181014] [2019-11-23 21:16:05,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 21:16:06,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700181014] [2019-11-23 21:16:06,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:06,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:06,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609979454] [2019-11-23 21:16:06,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:06,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:06,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:06,145 INFO L87 Difference]: Start difference. First operand 21637 states and 23328 transitions. Second operand 4 states. [2019-11-23 21:16:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:08,626 INFO L93 Difference]: Finished difference Result 42617 states and 45411 transitions. [2019-11-23 21:16:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:08,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 687 [2019-11-23 21:16:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:08,642 INFO L225 Difference]: With dead ends: 42617 [2019-11-23 21:16:08,642 INFO L226 Difference]: Without dead ends: 18590 [2019-11-23 21:16:08,647 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:16:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18590 states. [2019-11-23 21:16:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18590 to 15592. [2019-11-23 21:16:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15592 states. [2019-11-23 21:16:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15592 states to 15592 states and 16150 transitions. [2019-11-23 21:16:08,765 INFO L78 Accepts]: Start accepts. Automaton has 15592 states and 16150 transitions. Word has length 687 [2019-11-23 21:16:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:08,765 INFO L462 AbstractCegarLoop]: Abstraction has 15592 states and 16150 transitions. [2019-11-23 21:16:08,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 15592 states and 16150 transitions. [2019-11-23 21:16:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2019-11-23 21:16:08,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:08,776 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,776 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1521665315, now seen corresponding path program 1 times [2019-11-23 21:16:08,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:08,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120019979] [2019-11-23 21:16:08,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat