/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:16:50,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:16:50,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:16:50,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:16:50,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:16:50,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:16:50,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:16:50,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:16:50,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:16:50,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:16:50,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:16:50,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:16:50,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:16:50,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:16:50,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:16:50,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:16:50,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:16:50,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:16:50,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:16:50,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:16:50,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:16:50,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:16:50,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:16:50,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:16:50,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:16:50,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:16:50,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:16:50,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:16:50,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:16:50,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:16:50,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:16:50,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:16:50,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:16:50,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:16:50,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:16:50,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:16:50,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:16:50,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:16:50,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:16:50,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:16:50,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:16:50,872 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:16:50,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:16:50,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:16:50,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:16:50,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:16:50,888 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:16:50,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:16:50,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:16:50,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:16:50,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:16:50,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:16:50,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:16:50,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:16:50,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:16:50,890 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:16:50,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:16:50,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:16:50,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:16:50,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:16:50,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:16:50,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:16:50,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:16:50,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:16:50,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:16:50,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:16:50,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:16:50,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:16:50,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:16:50,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:16:50,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:16:50,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:16:51,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:16:51,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:16:51,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:16:51,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:16:51,185 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:16:51,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label55.c [2019-11-23 21:16:51,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d054a9d/d429f3e4fa564dc78fc4102159fe33e6/FLAG72f8a5c43 [2019-11-23 21:16:51,884 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:16:51,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label55.c [2019-11-23 21:16:51,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d054a9d/d429f3e4fa564dc78fc4102159fe33e6/FLAG72f8a5c43 [2019-11-23 21:16:52,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d054a9d/d429f3e4fa564dc78fc4102159fe33e6 [2019-11-23 21:16:52,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:16:52,047 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:16:52,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:16:52,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:16:52,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:16:52,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:16:52" (1/1) ... [2019-11-23 21:16:52,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7643fccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:52, skipping insertion in model container [2019-11-23 21:16:52,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:16:52" (1/1) ... [2019-11-23 21:16:52,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:16:52,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:16:53,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:16:53,010 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:16:53,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:16:53,503 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:16:53,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53 WrapperNode [2019-11-23 21:16:53,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:16:53,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:16:53,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:16:53,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:16:53,515 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:16:53" (1/1) ... [2019-11-23 21:16:53,549 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:16:53" (1/1) ... [2019-11-23 21:16:53,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:16:53,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:16:53,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:16:53,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:16:53,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (1/1) ... [2019-11-23 21:16:53,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (1/1) ... [2019-11-23 21:16:53,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (1/1) ... [2019-11-23 21:16:53,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (1/1) ... [2019-11-23 21:16:53,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (1/1) ... [2019-11-23 21:16:53,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (1/1) ... [2019-11-23 21:16:53,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (1/1) ... [2019-11-23 21:16:53,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:16:53,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:16:53,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:16:53,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:16:53,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (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:16:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:16:54,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:16:56,942 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:16:56,944 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:16:56,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:56 BoogieIcfgContainer [2019-11-23 21:16:56,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:16:56,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:16:56,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:16:56,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:16:56,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:16:52" (1/3) ... [2019-11-23 21:16:56,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130bf06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:56, skipping insertion in model container [2019-11-23 21:16:56,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:16:53" (2/3) ... [2019-11-23 21:16:56,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130bf06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:56, skipping insertion in model container [2019-11-23 21:16:56,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:56" (3/3) ... [2019-11-23 21:16:56,957 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label55.c [2019-11-23 21:16:56,969 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:16:56,978 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:16:56,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:16:57,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:16:57,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:16:57,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:16:57,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:16:57,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:16:57,049 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:16:57,049 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:16:57,049 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:16:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-23 21:16:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 21:16:57,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:57,111 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] [2019-11-23 21:16:57,112 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2019-11-23 21:16:57,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:57,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350462226] [2019-11-23 21:16:57,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:57,575 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:16:57,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350462226] [2019-11-23 21:16:57,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:57,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:57,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652570734] [2019-11-23 21:16:57,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:57,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:57,602 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-23 21:17:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:02,408 INFO L93 Difference]: Finished difference Result 1467 states and 2715 transitions. [2019-11-23 21:17:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:17:02,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-23 21:17:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:02,434 INFO L225 Difference]: With dead ends: 1467 [2019-11-23 21:17:02,435 INFO L226 Difference]: Without dead ends: 976 [2019-11-23 21:17:02,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:17:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-23 21:17:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-11-23 21:17:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-23 21:17:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1477 transitions. [2019-11-23 21:17:02,544 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1477 transitions. Word has length 57 [2019-11-23 21:17:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:02,545 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1477 transitions. [2019-11-23 21:17:02,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:17:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1477 transitions. [2019-11-23 21:17:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 21:17:02,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:02,551 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, 1, 1, 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:17:02,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:02,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash -664289441, now seen corresponding path program 1 times [2019-11-23 21:17:02,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:02,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165675271] [2019-11-23 21:17:02,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:17:02,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165675271] [2019-11-23 21:17:02,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:02,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:17:02,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636581617] [2019-11-23 21:17:02,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:17:02,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:02,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:17:02,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:17:02,750 INFO L87 Difference]: Start difference. First operand 974 states and 1477 transitions. Second operand 4 states. [2019-11-23 21:17:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:06,146 INFO L93 Difference]: Finished difference Result 3747 states and 5705 transitions. [2019-11-23 21:17:06,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:17:06,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-23 21:17:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:06,163 INFO L225 Difference]: With dead ends: 3747 [2019-11-23 21:17:06,164 INFO L226 Difference]: Without dead ends: 2775 [2019-11-23 21:17:06,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:17:06,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2019-11-23 21:17:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1872. [2019-11-23 21:17:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-11-23 21:17:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2484 transitions. [2019-11-23 21:17:06,263 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2484 transitions. Word has length 132 [2019-11-23 21:17:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:06,266 INFO L462 AbstractCegarLoop]: Abstraction has 1872 states and 2484 transitions. [2019-11-23 21:17:06,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:17:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2484 transitions. [2019-11-23 21:17:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-11-23 21:17:06,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:06,287 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:17:06,288 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1383331188, now seen corresponding path program 1 times [2019-11-23 21:17:06,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:06,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899520296] [2019-11-23 21:17:06,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-23 21:17:07,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899520296] [2019-11-23 21:17:07,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:07,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:17:07,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596465745] [2019-11-23 21:17:07,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:17:07,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:17:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:17:07,182 INFO L87 Difference]: Start difference. First operand 1872 states and 2484 transitions. Second operand 5 states. [2019-11-23 21:17:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:12,050 INFO L93 Difference]: Finished difference Result 4641 states and 5945 transitions. [2019-11-23 21:17:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:17:12,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 404 [2019-11-23 21:17:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:12,066 INFO L225 Difference]: With dead ends: 4641 [2019-11-23 21:17:12,066 INFO L226 Difference]: Without dead ends: 2771 [2019-11-23 21:17:12,069 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:17:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-11-23 21:17:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2471. [2019-11-23 21:17:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-11-23 21:17:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3125 transitions. [2019-11-23 21:17:12,119 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3125 transitions. Word has length 404 [2019-11-23 21:17:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:12,122 INFO L462 AbstractCegarLoop]: Abstraction has 2471 states and 3125 transitions. [2019-11-23 21:17:12,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:17:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3125 transitions. [2019-11-23 21:17:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-11-23 21:17:12,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:12,139 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:12,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:12,141 INFO L82 PathProgramCache]: Analyzing trace with hash -19444322, now seen corresponding path program 1 times [2019-11-23 21:17:12,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:12,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266713756] [2019-11-23 21:17:12,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-23 21:17:12,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266713756] [2019-11-23 21:17:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:12,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:17:12,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905685170] [2019-11-23 21:17:12,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:17:12,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:17:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:17:12,766 INFO L87 Difference]: Start difference. First operand 2471 states and 3125 transitions. Second operand 4 states. [2019-11-23 21:17:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:17,888 INFO L93 Difference]: Finished difference Result 5542 states and 7080 transitions. [2019-11-23 21:17:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:17:17,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 478 [2019-11-23 21:17:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:17,905 INFO L225 Difference]: With dead ends: 5542 [2019-11-23 21:17:17,905 INFO L226 Difference]: Without dead ends: 3073 [2019-11-23 21:17:17,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 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:17:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2019-11-23 21:17:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3071. [2019-11-23 21:17:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-11-23 21:17:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3699 transitions. [2019-11-23 21:17:17,967 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3699 transitions. Word has length 478 [2019-11-23 21:17:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:17,968 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 3699 transitions. [2019-11-23 21:17:17,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:17:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3699 transitions. [2019-11-23 21:17:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-11-23 21:17:17,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:17,978 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:17,979 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash -788153871, now seen corresponding path program 1 times [2019-11-23 21:17:17,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:17,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163490940] [2019-11-23 21:17:17,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 21:17:18,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163490940] [2019-11-23 21:17:18,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:18,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:17:18,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607680241] [2019-11-23 21:17:18,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:17:18,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:17:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:17:18,537 INFO L87 Difference]: Start difference. First operand 3071 states and 3699 transitions. Second operand 4 states. [2019-11-23 21:17:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:23,562 INFO L93 Difference]: Finished difference Result 6745 states and 8190 transitions. [2019-11-23 21:17:23,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:17:23,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2019-11-23 21:17:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:23,584 INFO L225 Difference]: With dead ends: 6745 [2019-11-23 21:17:23,584 INFO L226 Difference]: Without dead ends: 3676 [2019-11-23 21:17:23,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 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:17:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2019-11-23 21:17:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3672. [2019-11-23 21:17:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3672 states. [2019-11-23 21:17:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4289 transitions. [2019-11-23 21:17:23,655 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4289 transitions. Word has length 487 [2019-11-23 21:17:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:23,656 INFO L462 AbstractCegarLoop]: Abstraction has 3672 states and 4289 transitions. [2019-11-23 21:17:23,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:17:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4289 transitions. [2019-11-23 21:17:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-11-23 21:17:23,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:23,670 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:23,671 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1478191957, now seen corresponding path program 1 times [2019-11-23 21:17:23,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:23,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587751868] [2019-11-23 21:17:23,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-23 21:17:24,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587751868] [2019-11-23 21:17:24,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:24,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:17:24,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474605347] [2019-11-23 21:17:24,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:24,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:24,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:17:24,220 INFO L87 Difference]: Start difference. First operand 3672 states and 4289 transitions. Second operand 3 states. [2019-11-23 21:17:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:26,634 INFO L93 Difference]: Finished difference Result 9136 states and 10587 transitions. [2019-11-23 21:17:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:26,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-11-23 21:17:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:26,657 INFO L225 Difference]: With dead ends: 9136 [2019-11-23 21:17:26,657 INFO L226 Difference]: Without dead ends: 5466 [2019-11-23 21:17:26,663 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:17:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-11-23 21:17:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 3971. [2019-11-23 21:17:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-23 21:17:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4630 transitions. [2019-11-23 21:17:26,742 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4630 transitions. Word has length 508 [2019-11-23 21:17:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:26,743 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 4630 transitions. [2019-11-23 21:17:26,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4630 transitions. [2019-11-23 21:17:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-23 21:17:26,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:26,750 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:26,750 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2034412369, now seen corresponding path program 1 times [2019-11-23 21:17:26,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:26,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669341890] [2019-11-23 21:17:26,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-11-23 21:17:27,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669341890] [2019-11-23 21:17:27,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:27,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:17:27,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631216930] [2019-11-23 21:17:27,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:17:27,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:27,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:17:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:17:27,283 INFO L87 Difference]: Start difference. First operand 3971 states and 4630 transitions. Second operand 4 states. [2019-11-23 21:17:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:31,411 INFO L93 Difference]: Finished difference Result 13287 states and 15292 transitions. [2019-11-23 21:17:31,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:17:31,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 510 [2019-11-23 21:17:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:31,441 INFO L225 Difference]: With dead ends: 13287 [2019-11-23 21:17:31,442 INFO L226 Difference]: Without dead ends: 5730 [2019-11-23 21:17:31,452 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:17:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2019-11-23 21:17:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5730. [2019-11-23 21:17:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5730 states. [2019-11-23 21:17:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 6014 transitions. [2019-11-23 21:17:31,536 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 6014 transitions. Word has length 510 [2019-11-23 21:17:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:31,536 INFO L462 AbstractCegarLoop]: Abstraction has 5730 states and 6014 transitions. [2019-11-23 21:17:31,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:17:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 6014 transitions. [2019-11-23 21:17:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-11-23 21:17:31,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:31,552 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:31,553 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1599202760, now seen corresponding path program 1 times [2019-11-23 21:17:31,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:31,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121960349] [2019-11-23 21:17:31,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 1062 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-23 21:17:32,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121960349] [2019-11-23 21:17:32,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:32,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:17:32,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64807740] [2019-11-23 21:17:32,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:32,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:17:32,634 INFO L87 Difference]: Start difference. First operand 5730 states and 6014 transitions. Second operand 3 states. [2019-11-23 21:17:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:33,843 INFO L93 Difference]: Finished difference Result 14449 states and 15177 transitions. [2019-11-23 21:17:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:33,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 829 [2019-11-23 21:17:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:33,875 INFO L225 Difference]: With dead ends: 14449 [2019-11-23 21:17:33,876 INFO L226 Difference]: Without dead ends: 8721 [2019-11-23 21:17:33,883 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:17:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2019-11-23 21:17:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 7226. [2019-11-23 21:17:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7226 states. [2019-11-23 21:17:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 7572 transitions. [2019-11-23 21:17:33,987 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 7572 transitions. Word has length 829 [2019-11-23 21:17:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:33,988 INFO L462 AbstractCegarLoop]: Abstraction has 7226 states and 7572 transitions. [2019-11-23 21:17:33,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 7572 transitions. [2019-11-23 21:17:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-11-23 21:17:34,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:34,004 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:17:34,005 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:34,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:34,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1479206236, now seen corresponding path program 1 times [2019-11-23 21:17:34,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:34,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716056894] [2019-11-23 21:17:34,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2019-11-23 21:17:34,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716056894] [2019-11-23 21:17:34,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:17:34,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:17:34,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596790988] [2019-11-23 21:17:34,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:34,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:34,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:17:34,613 INFO L87 Difference]: Start difference. First operand 7226 states and 7572 transitions. Second operand 3 states. [2019-11-23 21:17:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:35,928 INFO L93 Difference]: Finished difference Result 15346 states and 16079 transitions. [2019-11-23 21:17:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:35,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 842 [2019-11-23 21:17:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:35,946 INFO L225 Difference]: With dead ends: 15346 [2019-11-23 21:17:35,947 INFO L226 Difference]: Without dead ends: 8122 [2019-11-23 21:17:35,952 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:17:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2019-11-23 21:17:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 7225. [2019-11-23 21:17:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2019-11-23 21:17:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 7570 transitions. [2019-11-23 21:17:36,032 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 7570 transitions. Word has length 842 [2019-11-23 21:17:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:36,033 INFO L462 AbstractCegarLoop]: Abstraction has 7225 states and 7570 transitions. [2019-11-23 21:17:36,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 7570 transitions. [2019-11-23 21:17:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2019-11-23 21:17:36,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:36,050 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:17:36,050 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -537887034, now seen corresponding path program 1 times [2019-11-23 21:17:36,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:36,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139032110] [2019-11-23 21:17:36,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 520 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:17:38,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139032110] [2019-11-23 21:17:38,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712685969] [2019-11-23 21:17:38,520 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:17:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:38,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:17:38,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:17:38,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:38,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-11-23 21:17:39,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:17:39,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-23 21:17:39,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873443008] [2019-11-23 21:17:39,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:39,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:17:39,772 INFO L87 Difference]: Start difference. First operand 7225 states and 7570 transitions. Second operand 3 states. [2019-11-23 21:17:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:42,093 INFO L93 Difference]: Finished difference Result 19545 states and 20509 transitions. [2019-11-23 21:17:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:42,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 863 [2019-11-23 21:17:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:42,117 INFO L225 Difference]: With dead ends: 19545 [2019-11-23 21:17:42,117 INFO L226 Difference]: Without dead ends: 12322 [2019-11-23 21:17:42,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 862 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:17:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-11-23 21:17:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11420. [2019-11-23 21:17:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11420 states. [2019-11-23 21:17:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11420 states to 11420 states and 11964 transitions. [2019-11-23 21:17:42,440 INFO L78 Accepts]: Start accepts. Automaton has 11420 states and 11964 transitions. Word has length 863 [2019-11-23 21:17:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:42,441 INFO L462 AbstractCegarLoop]: Abstraction has 11420 states and 11964 transitions. [2019-11-23 21:17:42,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 11420 states and 11964 transitions. [2019-11-23 21:17:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-11-23 21:17:42,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:42,465 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:17:42,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:17:42,671 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 943867835, now seen corresponding path program 1 times [2019-11-23 21:17:42,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:42,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541230563] [2019-11-23 21:17:42,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 211 proven. 977 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:17:46,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541230563] [2019-11-23 21:17:46,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032099353] [2019-11-23 21:17:46,364 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:17:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:46,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:17:46,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:17:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:55,378 WARN L192 SmtUtils]: Spent 7.16 s on a formula simplification. DAG size of input: 232 DAG size of output: 29 [2019-11-23 21:17:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2019-11-23 21:17:56,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:17:56,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-23 21:17:56,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036743177] [2019-11-23 21:17:56,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:56,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:56,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:17:56,116 INFO L87 Difference]: Start difference. First operand 11420 states and 11964 transitions. Second operand 3 states.