/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/Problem11_label35.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:06:10,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:06:10,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:06:10,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:06:10,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:06:10,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:06:10,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:06:10,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:06:10,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:06:10,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:06:10,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:06:10,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:06:10,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:06:10,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:06:10,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:06:10,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:06:10,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:06:10,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:06:10,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:06:10,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:06:10,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:06:10,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:06:10,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:06:10,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:06:10,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:06:10,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:06:10,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:06:10,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:06:10,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:06:10,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:06:10,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:06:10,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:06:10,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:06:10,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:06:10,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:06:10,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:06:10,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:06:10,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:06:10,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:06:10,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:06:10,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:06:10,870 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:06:10,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:06:10,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:06:10,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:06:10,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:06:10,889 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:06:10,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:06:10,890 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:06:10,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:06:10,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:06:10,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:06:10,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:06:10,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:06:10,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:06:10,891 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:06:10,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:06:10,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:06:10,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:06:10,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:06:10,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:06:10,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:06:10,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:06:10,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:06:10,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:06:10,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:06:10,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:06:10,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:06:10,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:06:10,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:06:10,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:06:10,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:06:11,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:06:11,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:06:11,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:06:11,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:06:11,182 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:06:11,183 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label35.c [2019-11-23 21:06:11,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e61d03d3/e314ec585dae45ba90092f2ec2eba750/FLAG7e7355626 [2019-11-23 21:06:11,853 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:06:11,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label35.c [2019-11-23 21:06:11,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e61d03d3/e314ec585dae45ba90092f2ec2eba750/FLAG7e7355626 [2019-11-23 21:06:12,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e61d03d3/e314ec585dae45ba90092f2ec2eba750 [2019-11-23 21:06:12,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:06:12,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:06:12,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:06:12,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:06:12,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:06:12,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:06:12" (1/1) ... [2019-11-23 21:06:12,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22537aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:12, skipping insertion in model container [2019-11-23 21:06:12,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:06:12" (1/1) ... [2019-11-23 21:06:12,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:06:12,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:06:13,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:06:13,098 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:06:13,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:06:13,280 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:06:13,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13 WrapperNode [2019-11-23 21:06:13,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:06:13,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:06:13,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:06:13,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:06:13,291 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:06:13" (1/1) ... [2019-11-23 21:06:13,324 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:06:13" (1/1) ... [2019-11-23 21:06:13,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:06:13,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:06:13,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:06:13,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:06:13,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (1/1) ... [2019-11-23 21:06:13,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:06:13" (1/1) ... [2019-11-23 21:06:13,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (1/1) ... [2019-11-23 21:06:13,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (1/1) ... [2019-11-23 21:06:13,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (1/1) ... [2019-11-23 21:06:13,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (1/1) ... [2019-11-23 21:06:13,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (1/1) ... [2019-11-23 21:06:13,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:06:13,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:06:13,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:06:13,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:06:13,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (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:06:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:06:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:06:15,607 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:06:15,608 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:06:15,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:06:15 BoogieIcfgContainer [2019-11-23 21:06:15,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:06:15,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:06:15,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:06:15,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:06:15,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:06:12" (1/3) ... [2019-11-23 21:06:15,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3256bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:06:15, skipping insertion in model container [2019-11-23 21:06:15,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:13" (2/3) ... [2019-11-23 21:06:15,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3256bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:06:15, skipping insertion in model container [2019-11-23 21:06:15,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:06:15" (3/3) ... [2019-11-23 21:06:15,618 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label35.c [2019-11-23 21:06:15,628 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:06:15,637 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:06:15,650 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:06:15,679 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:06:15,679 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:06:15,679 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:06:15,679 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:06:15,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:06:15,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:06:15,680 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:06:15,680 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:06:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-23 21:06:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 21:06:15,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:15,712 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, 1, 1, 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:06:15,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2019-11-23 21:06:15,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:15,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790653761] [2019-11-23 21:06:15,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:16,117 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:06:16,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790653761] [2019-11-23 21:06:16,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:16,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:06:16,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592371460] [2019-11-23 21:06:16,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:16,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:16,151 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-23 21:06:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:18,204 INFO L93 Difference]: Finished difference Result 954 states and 1721 transitions. [2019-11-23 21:06:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:18,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-23 21:06:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:18,226 INFO L225 Difference]: With dead ends: 954 [2019-11-23 21:06:18,227 INFO L226 Difference]: Without dead ends: 603 [2019-11-23 21:06:18,234 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:06:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-23 21:06:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-11-23 21:06:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-11-23 21:06:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 837 transitions. [2019-11-23 21:06:18,332 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 837 transitions. Word has length 58 [2019-11-23 21:06:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:18,333 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 837 transitions. [2019-11-23 21:06:18,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 837 transitions. [2019-11-23 21:06:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-23 21:06:18,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:18,339 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, 2, 2, 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:06:18,340 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash 720217396, now seen corresponding path program 1 times [2019-11-23 21:06:18,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:18,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363444437] [2019-11-23 21:06:18,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:18,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363444437] [2019-11-23 21:06:18,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:18,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:06:18,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990362204] [2019-11-23 21:06:18,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:18,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:18,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:18,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:18,532 INFO L87 Difference]: Start difference. First operand 603 states and 837 transitions. Second operand 4 states. [2019-11-23 21:06:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:20,363 INFO L93 Difference]: Finished difference Result 2330 states and 3249 transitions. [2019-11-23 21:06:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:20,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-23 21:06:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:20,373 INFO L225 Difference]: With dead ends: 2330 [2019-11-23 21:06:20,374 INFO L226 Difference]: Without dead ends: 1729 [2019-11-23 21:06:20,376 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:06:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2019-11-23 21:06:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1343. [2019-11-23 21:06:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-23 21:06:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1799 transitions. [2019-11-23 21:06:20,424 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1799 transitions. Word has length 127 [2019-11-23 21:06:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:20,425 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1799 transitions. [2019-11-23 21:06:20,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1799 transitions. [2019-11-23 21:06:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 21:06:20,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:20,432 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, 2, 2, 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] [2019-11-23 21:06:20,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1117470811, now seen corresponding path program 1 times [2019-11-23 21:06:20,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:20,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377091983] [2019-11-23 21:06:20,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:20,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377091983] [2019-11-23 21:06:20,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:20,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:06:20,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56921293] [2019-11-23 21:06:20,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:06:20,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:06:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:06:20,704 INFO L87 Difference]: Start difference. First operand 1343 states and 1799 transitions. Second operand 5 states. [2019-11-23 21:06:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:22,998 INFO L93 Difference]: Finished difference Result 5086 states and 6859 transitions. [2019-11-23 21:06:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:06:22,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-11-23 21:06:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:23,019 INFO L225 Difference]: With dead ends: 5086 [2019-11-23 21:06:23,020 INFO L226 Difference]: Without dead ends: 3561 [2019-11-23 21:06:23,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:06:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2019-11-23 21:06:23,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3188. [2019-11-23 21:06:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-11-23 21:06:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 3880 transitions. [2019-11-23 21:06:23,102 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 3880 transitions. Word has length 148 [2019-11-23 21:06:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:23,104 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 3880 transitions. [2019-11-23 21:06:23,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:06:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 3880 transitions. [2019-11-23 21:06:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-23 21:06:23,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:23,123 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:23,123 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash -226709585, now seen corresponding path program 1 times [2019-11-23 21:06:23,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:23,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21591485] [2019-11-23 21:06:23,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 21:06:23,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21591485] [2019-11-23 21:06:23,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:23,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:06:23,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006471185] [2019-11-23 21:06:23,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:23,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:23,448 INFO L87 Difference]: Start difference. First operand 3188 states and 3880 transitions. Second operand 4 states. [2019-11-23 21:06:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:25,166 INFO L93 Difference]: Finished difference Result 8784 states and 10747 transitions. [2019-11-23 21:06:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:25,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-11-23 21:06:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:25,189 INFO L225 Difference]: With dead ends: 8784 [2019-11-23 21:06:25,190 INFO L226 Difference]: Without dead ends: 5598 [2019-11-23 21:06:25,194 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:06:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2019-11-23 21:06:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5396. [2019-11-23 21:06:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2019-11-23 21:06:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 6405 transitions. [2019-11-23 21:06:25,300 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 6405 transitions. Word has length 263 [2019-11-23 21:06:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:25,300 INFO L462 AbstractCegarLoop]: Abstraction has 5396 states and 6405 transitions. [2019-11-23 21:06:25,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 6405 transitions. [2019-11-23 21:06:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-23 21:06:25,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:25,308 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:25,308 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1038105358, now seen corresponding path program 1 times [2019-11-23 21:06:25,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:25,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277714231] [2019-11-23 21:06:25,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 21:06:25,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277714231] [2019-11-23 21:06:25,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:25,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:06:25,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238989151] [2019-11-23 21:06:25,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:06:25,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:06:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:06:25,585 INFO L87 Difference]: Start difference. First operand 5396 states and 6405 transitions. Second operand 3 states. [2019-11-23 21:06:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:26,721 INFO L93 Difference]: Finished difference Result 11525 states and 13880 transitions. [2019-11-23 21:06:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:06:26,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-23 21:06:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:26,753 INFO L225 Difference]: With dead ends: 11525 [2019-11-23 21:06:26,753 INFO L226 Difference]: Without dead ends: 6131 [2019-11-23 21:06:26,760 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:06:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-11-23 21:06:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 6131. [2019-11-23 21:06:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6131 states. [2019-11-23 21:06:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 7295 transitions. [2019-11-23 21:06:26,891 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 7295 transitions. Word has length 272 [2019-11-23 21:06:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:26,892 INFO L462 AbstractCegarLoop]: Abstraction has 6131 states and 7295 transitions. [2019-11-23 21:06:26,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:06:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 7295 transitions. [2019-11-23 21:06:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-23 21:06:26,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:26,903 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:26,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -782853808, now seen corresponding path program 1 times [2019-11-23 21:06:26,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:26,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550037254] [2019-11-23 21:06:26,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:27,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550037254] [2019-11-23 21:06:27,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:27,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:06:27,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690338326] [2019-11-23 21:06:27,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:06:27,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:27,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:06:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:06:27,319 INFO L87 Difference]: Start difference. First operand 6131 states and 7295 transitions. Second operand 5 states. [2019-11-23 21:06:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:29,854 INFO L93 Difference]: Finished difference Result 14493 states and 17627 transitions. [2019-11-23 21:06:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:06:29,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 275 [2019-11-23 21:06:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:29,886 INFO L225 Difference]: With dead ends: 14493 [2019-11-23 21:06:29,887 INFO L226 Difference]: Without dead ends: 8364 [2019-11-23 21:06:29,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:06:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-11-23 21:06:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 7979. [2019-11-23 21:06:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2019-11-23 21:06:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 9488 transitions. [2019-11-23 21:06:30,088 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 9488 transitions. Word has length 275 [2019-11-23 21:06:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:30,089 INFO L462 AbstractCegarLoop]: Abstraction has 7979 states and 9488 transitions. [2019-11-23 21:06:30,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:06:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 9488 transitions. [2019-11-23 21:06:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-23 21:06:30,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:30,100 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:30,100 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1481290674, now seen corresponding path program 1 times [2019-11-23 21:06:30,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:30,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909259142] [2019-11-23 21:06:30,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 197 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:30,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909259142] [2019-11-23 21:06:30,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108752186] [2019-11-23 21:06:30,384 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:06:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:30,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 21:06:30,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:06:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:30,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:06:30,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:06:30,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16726185] [2019-11-23 21:06:30,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:30,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:06:30,774 INFO L87 Difference]: Start difference. First operand 7979 states and 9488 transitions. Second operand 4 states. [2019-11-23 21:06:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:32,513 INFO L93 Difference]: Finished difference Result 17062 states and 20370 transitions. [2019-11-23 21:06:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:32,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-23 21:06:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:32,566 INFO L225 Difference]: With dead ends: 17062 [2019-11-23 21:06:32,566 INFO L226 Difference]: Without dead ends: 8716 [2019-11-23 21:06:32,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:06:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8716 states. [2019-11-23 21:06:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8716 to 7790. [2019-11-23 21:06:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-11-23 21:06:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 9036 transitions. [2019-11-23 21:06:32,767 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 9036 transitions. Word has length 291 [2019-11-23 21:06:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:32,768 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 9036 transitions. [2019-11-23 21:06:32,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 9036 transitions. [2019-11-23 21:06:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-11-23 21:06:32,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:32,788 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, 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, 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] [2019-11-23 21:06:32,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:06:32,998 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1258174705, now seen corresponding path program 1 times [2019-11-23 21:06:33,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:33,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104108662] [2019-11-23 21:06:33,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:06:33,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104108662] [2019-11-23 21:06:33,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:33,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:06:33,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184181380] [2019-11-23 21:06:33,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:33,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:33,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:33,548 INFO L87 Difference]: Start difference. First operand 7790 states and 9036 transitions. Second operand 4 states. [2019-11-23 21:06:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:35,387 INFO L93 Difference]: Finished difference Result 16516 states and 19129 transitions. [2019-11-23 21:06:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:35,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2019-11-23 21:06:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:35,404 INFO L225 Difference]: With dead ends: 16516 [2019-11-23 21:06:35,404 INFO L226 Difference]: Without dead ends: 8728 [2019-11-23 21:06:35,414 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:06:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2019-11-23 21:06:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 8158. [2019-11-23 21:06:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8158 states. [2019-11-23 21:06:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 9307 transitions. [2019-11-23 21:06:35,533 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 9307 transitions. Word has length 340 [2019-11-23 21:06:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:35,534 INFO L462 AbstractCegarLoop]: Abstraction has 8158 states and 9307 transitions. [2019-11-23 21:06:35,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 9307 transitions. [2019-11-23 21:06:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-23 21:06:35,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:35,547 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:35,547 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1242905813, now seen corresponding path program 1 times [2019-11-23 21:06:35,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:35,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080433918] [2019-11-23 21:06:35,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:36,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080433918] [2019-11-23 21:06:36,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465354774] [2019-11-23 21:06:36,083 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:06:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:36,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:06:36,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:06:36,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:36,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 179 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:36,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:06:36,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-23 21:06:36,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317358256] [2019-11-23 21:06:36,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:06:36,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:36,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:06:36,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:06:36,905 INFO L87 Difference]: Start difference. First operand 8158 states and 9307 transitions. Second operand 9 states. [2019-11-23 21:06:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:50,721 INFO L93 Difference]: Finished difference Result 40539 states and 46181 transitions. [2019-11-23 21:06:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 21:06:50,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 356 [2019-11-23 21:06:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:50,782 INFO L225 Difference]: With dead ends: 40539 [2019-11-23 21:06:50,782 INFO L226 Difference]: Without dead ends: 32199 [2019-11-23 21:06:50,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2019-11-23 21:06:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32199 states. [2019-11-23 21:06:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32199 to 18323. [2019-11-23 21:06:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18323 states. [2019-11-23 21:06:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18323 states to 18323 states and 20426 transitions. [2019-11-23 21:06:51,215 INFO L78 Accepts]: Start accepts. Automaton has 18323 states and 20426 transitions. Word has length 356 [2019-11-23 21:06:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:51,215 INFO L462 AbstractCegarLoop]: Abstraction has 18323 states and 20426 transitions. [2019-11-23 21:06:51,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:06:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 18323 states and 20426 transitions. [2019-11-23 21:06:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-23 21:06:51,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:51,229 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, 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, 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] [2019-11-23 21:06:51,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:06:51,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -503808845, now seen corresponding path program 1 times [2019-11-23 21:06:51,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:51,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228619781] [2019-11-23 21:06:51,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 240 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:52,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228619781] [2019-11-23 21:06:52,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375649378] [2019-11-23 21:06:52,022 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:06:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:52,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:06:52,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:06:52,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:52,524 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-11-23 21:06:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 167 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 21:06:53,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:06:53,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2019-11-23 21:06:53,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469012284] [2019-11-23 21:06:53,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:06:53,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:53,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:06:53,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:06:53,035 INFO L87 Difference]: Start difference. First operand 18323 states and 20426 transitions. Second operand 11 states. [2019-11-23 21:07:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:08,567 INFO L93 Difference]: Finished difference Result 47923 states and 53415 transitions. [2019-11-23 21:07:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 21:07:08,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2019-11-23 21:07:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:08,601 INFO L225 Difference]: With dead ends: 47923 [2019-11-23 21:07:08,601 INFO L226 Difference]: Without dead ends: 28498 [2019-11-23 21:07:08,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2019-11-23 21:07:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28498 states. [2019-11-23 21:07:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28498 to 20169. [2019-11-23 21:07:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20169 states. [2019-11-23 21:07:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 22202 transitions. [2019-11-23 21:07:08,967 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 22202 transitions. Word has length 357 [2019-11-23 21:07:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:08,968 INFO L462 AbstractCegarLoop]: Abstraction has 20169 states and 22202 transitions. [2019-11-23 21:07:08,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:07:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 22202 transitions. [2019-11-23 21:07:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-23 21:07:09,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:09,003 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:07:09,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:07:09,209 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash -209708669, now seen corresponding path program 1 times [2019-11-23 21:07:09,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:09,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416074229] [2019-11-23 21:07:09,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 432 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:07:09,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416074229] [2019-11-23 21:07:09,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642369690] [2019-11-23 21:07:09,838 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:07:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:10,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:07:10,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:07:10,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:10,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 257 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:07:11,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:07:11,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-11-23 21:07:11,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828003829] [2019-11-23 21:07:11,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:07:11,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:07:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:07:11,208 INFO L87 Difference]: Start difference. First operand 20169 states and 22202 transitions. Second operand 10 states. [2019-11-23 21:07:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:18,633 INFO L93 Difference]: Finished difference Result 48275 states and 53158 transitions. [2019-11-23 21:07:18,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:07:18,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 453 [2019-11-23 21:07:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:18,667 INFO L225 Difference]: With dead ends: 48275 [2019-11-23 21:07:18,667 INFO L226 Difference]: Without dead ends: 27740 [2019-11-23 21:07:18,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:07:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27740 states. [2019-11-23 21:07:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27740 to 16276. [2019-11-23 21:07:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16276 states. [2019-11-23 21:07:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16276 states to 16276 states and 17771 transitions. [2019-11-23 21:07:19,093 INFO L78 Accepts]: Start accepts. Automaton has 16276 states and 17771 transitions. Word has length 453 [2019-11-23 21:07:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:19,094 INFO L462 AbstractCegarLoop]: Abstraction has 16276 states and 17771 transitions. [2019-11-23 21:07:19,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:07:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 16276 states and 17771 transitions. [2019-11-23 21:07:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-11-23 21:07:19,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:19,115 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:19,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:07:19,320 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 602582262, now seen corresponding path program 1 times [2019-11-23 21:07:19,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:19,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225749210] [2019-11-23 21:07:19,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-23 21:07:19,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225749210] [2019-11-23 21:07:19,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:19,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:07:19,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89272918] [2019-11-23 21:07:19,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:07:19,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:07:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:07:19,955 INFO L87 Difference]: Start difference. First operand 16276 states and 17771 transitions. Second operand 5 states. [2019-11-23 21:07:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:22,246 INFO L93 Difference]: Finished difference Result 40671 states and 44356 transitions. [2019-11-23 21:07:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:07:22,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 528 [2019-11-23 21:07:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:22,267 INFO L225 Difference]: With dead ends: 40671 [2019-11-23 21:07:22,267 INFO L226 Difference]: Without dead ends: 23476 [2019-11-23 21:07:22,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:07:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23476 states. [2019-11-23 21:07:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23476 to 20883. [2019-11-23 21:07:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20883 states. [2019-11-23 21:07:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20883 states to 20883 states and 22756 transitions. [2019-11-23 21:07:22,601 INFO L78 Accepts]: Start accepts. Automaton has 20883 states and 22756 transitions. Word has length 528 [2019-11-23 21:07:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:22,601 INFO L462 AbstractCegarLoop]: Abstraction has 20883 states and 22756 transitions. [2019-11-23 21:07:22,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:07:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 20883 states and 22756 transitions. [2019-11-23 21:07:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2019-11-23 21:07:22,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:22,628 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, 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, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:22,628 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1722003640, now seen corresponding path program 1 times [2019-11-23 21:07:22,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:22,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587886646] [2019-11-23 21:07:22,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1293 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-23 21:07:23,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587886646] [2019-11-23 21:07:23,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:23,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:07:23,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604612089] [2019-11-23 21:07:23,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:07:23,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:23,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:07:23,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:07:23,217 INFO L87 Difference]: Start difference. First operand 20883 states and 22756 transitions. Second operand 4 states. [2019-11-23 21:07:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:25,004 INFO L93 Difference]: Finished difference Result 41781 states and 45535 transitions. [2019-11-23 21:07:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:07:25,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 708 [2019-11-23 21:07:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:25,022 INFO L225 Difference]: With dead ends: 41781 [2019-11-23 21:07:25,022 INFO L226 Difference]: Without dead ends: 21084 [2019-11-23 21:07:25,034 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:07:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21084 states. [2019-11-23 21:07:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21084 to 20331. [2019-11-23 21:07:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20331 states. [2019-11-23 21:07:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20331 states to 20331 states and 21878 transitions. [2019-11-23 21:07:25,210 INFO L78 Accepts]: Start accepts. Automaton has 20331 states and 21878 transitions. Word has length 708 [2019-11-23 21:07:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:25,211 INFO L462 AbstractCegarLoop]: Abstraction has 20331 states and 21878 transitions. [2019-11-23 21:07:25,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:07:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 20331 states and 21878 transitions. [2019-11-23 21:07:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-11-23 21:07:25,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:25,228 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, 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, 5, 5, 5, 5, 5, 5, 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, 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:07:25,228 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash -472132574, now seen corresponding path program 1 times [2019-11-23 21:07:25,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:25,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030654739] [2019-11-23 21:07:25,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 792 proven. 0 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2019-11-23 21:07:25,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030654739] [2019-11-23 21:07:25,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:25,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:07:25,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089739435] [2019-11-23 21:07:25,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:07:25,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:07:25,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:07:25,754 INFO L87 Difference]: Start difference. First operand 20331 states and 21878 transitions. Second operand 3 states. [2019-11-23 21:07:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:26,855 INFO L93 Difference]: Finished difference Result 41763 states and 44921 transitions. [2019-11-23 21:07:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:07:26,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-11-23 21:07:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:26,858 INFO L225 Difference]: With dead ends: 41763 [2019-11-23 21:07:26,858 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:07:26,873 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:07:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:07:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:07:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:07:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:07:26,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-11-23 21:07:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:26,875 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:07:26,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:07:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:07:26,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:07:26,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:07:28,344 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 726 DAG size of output: 478 [2019-11-23 21:07:29,624 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 726 DAG size of output: 478