java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 15:00:13,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 15:00:13,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 15:00:13,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 15:00:13,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 15:00:13,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 15:00:13,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 15:00:13,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 15:00:13,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 15:00:13,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 15:00:13,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 15:00:13,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 15:00:13,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 15:00:13,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 15:00:13,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 15:00:13,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 15:00:13,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 15:00:13,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 15:00:13,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 15:00:13,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 15:00:13,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 15:00:13,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 15:00:13,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 15:00:13,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 15:00:13,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 15:00:13,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 15:00:13,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 15:00:13,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 15:00:13,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 15:00:13,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 15:00:13,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 15:00:13,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 15:00:13,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 15:00:13,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 15:00:13,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 15:00:13,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 15:00:13,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 15:00:13,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 15:00:13,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 15:00:13,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 15:00:13,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 15:00:13,938 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-10-02 15:00:13,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 15:00:13,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 15:00:13,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 15:00:13,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 15:00:13,954 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 15:00:13,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 15:00:13,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 15:00:13,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 15:00:13,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 15:00:13,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 15:00:13,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 15:00:13,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 15:00:13,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 15:00:13,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 15:00:13,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 15:00:13,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 15:00:13,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 15:00:13,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 15:00:13,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 15:00:13,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 15:00:13,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 15:00:13,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:00:13,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 15:00:13,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 15:00:13,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 15:00:13,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 15:00:13,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 15:00:13,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 15:00:13,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 15:00:13,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 15:00:14,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 15:00:14,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 15:00:14,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 15:00:14,007 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 15:00:14,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 15:00:14,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa7ba1fa/cff083198c1343b3a10a00142ae004ef/FLAG83eaac419 [2019-10-02 15:00:14,777 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 15:00:14,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 15:00:14,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa7ba1fa/cff083198c1343b3a10a00142ae004ef/FLAG83eaac419 [2019-10-02 15:00:14,901 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa7ba1fa/cff083198c1343b3a10a00142ae004ef [2019-10-02 15:00:14,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 15:00:14,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 15:00:14,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 15:00:14,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 15:00:14,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 15:00:14,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ada9fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:14, skipping insertion in model container [2019-10-02 15:00:14,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:00:14" (1/1) ... [2019-10-02 15:00:14,933 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 15:00:15,085 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 15:00:16,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:00:16,103 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 15:00:16,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:00:16,414 INFO L192 MainTranslator]: Completed translation [2019-10-02 15:00:16,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16 WrapperNode [2019-10-02 15:00:16,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 15:00:16,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 15:00:16,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 15:00:16,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 15:00:16,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (1/1) ... [2019-10-02 15:00:16,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (1/1) ... [2019-10-02 15:00:16,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (1/1) ... [2019-10-02 15:00:16,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (1/1) ... [2019-10-02 15:00:16,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (1/1) ... [2019-10-02 15:00:16,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (1/1) ... [2019-10-02 15:00:16,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (1/1) ... [2019-10-02 15:00:16,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 15:00:16,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 15:00:16,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 15:00:16,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 15:00:16,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (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-10-02 15:00:16,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 15:00:16,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 15:00:16,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 15:00:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 15:00:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 15:00:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 15:00:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 15:00:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 15:00:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 15:00:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 15:00:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 15:00:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 15:00:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 15:00:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 15:00:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 15:00:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 15:00:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 15:00:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 15:00:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 15:00:20,412 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 15:00:20,412 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 15:00:20,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:00:20 BoogieIcfgContainer [2019-10-02 15:00:20,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 15:00:20,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 15:00:20,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 15:00:20,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 15:00:20,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 03:00:14" (1/3) ... [2019-10-02 15:00:20,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30509094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:00:20, skipping insertion in model container [2019-10-02 15:00:20,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:16" (2/3) ... [2019-10-02 15:00:20,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30509094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:00:20, skipping insertion in model container [2019-10-02 15:00:20,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:00:20" (3/3) ... [2019-10-02 15:00:20,422 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 15:00:20,432 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 15:00:20,441 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-02 15:00:20,459 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-02 15:00:20,498 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 15:00:20,499 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 15:00:20,499 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 15:00:20,499 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 15:00:20,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 15:00:20,499 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 15:00:20,499 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 15:00:20,499 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 15:00:20,500 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 15:00:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-02 15:00:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 15:00:20,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:20,559 INFO L411 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] [2019-10-02 15:00:20,561 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:20,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-02 15:00:20,569 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:20,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:20,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:21,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:21,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:00:21,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:00:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:00:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:21,121 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-02 15:00:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:23,630 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2019-10-02 15:00:23,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:23,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-02 15:00:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:23,656 INFO L225 Difference]: With dead ends: 2475 [2019-10-02 15:00:23,657 INFO L226 Difference]: Without dead ends: 1554 [2019-10-02 15:00:23,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:00:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-10-02 15:00:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1548. [2019-10-02 15:00:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-02 15:00:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2090 transitions. [2019-10-02 15:00:23,901 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2090 transitions. Word has length 55 [2019-10-02 15:00:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:23,902 INFO L475 AbstractCegarLoop]: Abstraction has 1548 states and 2090 transitions. [2019-10-02 15:00:23,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:00:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2090 transitions. [2019-10-02 15:00:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 15:00:23,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:23,908 INFO L411 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] [2019-10-02 15:00:23,908 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-02 15:00:23,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:23,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:24,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:24,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:00:24,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:00:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:00:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:00:24,170 INFO L87 Difference]: Start difference. First operand 1548 states and 2090 transitions. Second operand 6 states. [2019-10-02 15:00:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:25,549 INFO L93 Difference]: Finished difference Result 3384 states and 4662 transitions. [2019-10-02 15:00:25,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:25,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 15:00:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:25,562 INFO L225 Difference]: With dead ends: 3384 [2019-10-02 15:00:25,562 INFO L226 Difference]: Without dead ends: 2296 [2019-10-02 15:00:25,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:00:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-10-02 15:00:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2280. [2019-10-02 15:00:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-10-02 15:00:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3126 transitions. [2019-10-02 15:00:25,741 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3126 transitions. Word has length 56 [2019-10-02 15:00:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:25,741 INFO L475 AbstractCegarLoop]: Abstraction has 2280 states and 3126 transitions. [2019-10-02 15:00:25,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:00:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3126 transitions. [2019-10-02 15:00:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 15:00:25,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:25,746 INFO L411 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] [2019-10-02 15:00:25,746 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-02 15:00:25,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:25,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:25,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:25,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:25,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:25,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:00:25,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:00:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:00:25,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:00:25,862 INFO L87 Difference]: Start difference. First operand 2280 states and 3126 transitions. Second operand 6 states. [2019-10-02 15:00:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:27,310 INFO L93 Difference]: Finished difference Result 5893 states and 8147 transitions. [2019-10-02 15:00:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:27,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 15:00:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:27,339 INFO L225 Difference]: With dead ends: 5893 [2019-10-02 15:00:27,339 INFO L226 Difference]: Without dead ends: 4335 [2019-10-02 15:00:27,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:00:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-10-02 15:00:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4315. [2019-10-02 15:00:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-02 15:00:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5971 transitions. [2019-10-02 15:00:27,647 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5971 transitions. Word has length 56 [2019-10-02 15:00:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:27,650 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5971 transitions. [2019-10-02 15:00:27,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:00:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5971 transitions. [2019-10-02 15:00:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 15:00:27,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:27,656 INFO L411 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-10-02 15:00:27,656 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-02 15:00:27,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:27,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:27,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:27,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:00:27,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:00:27,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:00:27,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:27,927 INFO L87 Difference]: Start difference. First operand 4315 states and 5971 transitions. Second operand 9 states. [2019-10-02 15:00:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:31,920 INFO L93 Difference]: Finished difference Result 8360 states and 12149 transitions. [2019-10-02 15:00:31,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 15:00:31,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-02 15:00:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:31,981 INFO L225 Difference]: With dead ends: 8360 [2019-10-02 15:00:31,982 INFO L226 Difference]: Without dead ends: 8355 [2019-10-02 15:00:31,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-02 15:00:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2019-10-02 15:00:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 4315. [2019-10-02 15:00:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-02 15:00:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5970 transitions. [2019-10-02 15:00:32,417 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5970 transitions. Word has length 57 [2019-10-02 15:00:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:32,418 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5970 transitions. [2019-10-02 15:00:32,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:00:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5970 transitions. [2019-10-02 15:00:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 15:00:32,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:32,424 INFO L411 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-10-02 15:00:32,424 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:32,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:32,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-02 15:00:32,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:32,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:32,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:00:32,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:00:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:00:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:32,634 INFO L87 Difference]: Start difference. First operand 4315 states and 5970 transitions. Second operand 9 states. [2019-10-02 15:00:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:36,671 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-10-02 15:00:36,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 15:00:36,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-02 15:00:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:36,727 INFO L225 Difference]: With dead ends: 12184 [2019-10-02 15:00:36,728 INFO L226 Difference]: Without dead ends: 11066 [2019-10-02 15:00:36,735 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-02 15:00:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-02 15:00:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4315. [2019-10-02 15:00:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-02 15:00:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5969 transitions. [2019-10-02 15:00:37,125 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5969 transitions. Word has length 57 [2019-10-02 15:00:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:37,125 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5969 transitions. [2019-10-02 15:00:37,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:00:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5969 transitions. [2019-10-02 15:00:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 15:00:37,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:37,132 INFO L411 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-10-02 15:00:37,134 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:37,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-02 15:00:37,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:37,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:37,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:37,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:37,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:00:37,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:00:37,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:00:37,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:00:37,298 INFO L87 Difference]: Start difference. First operand 4315 states and 5969 transitions. Second operand 8 states. [2019-10-02 15:00:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:40,711 INFO L93 Difference]: Finished difference Result 9387 states and 13823 transitions. [2019-10-02 15:00:40,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 15:00:40,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-02 15:00:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:40,734 INFO L225 Difference]: With dead ends: 9387 [2019-10-02 15:00:40,734 INFO L226 Difference]: Without dead ends: 8061 [2019-10-02 15:00:40,740 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-02 15:00:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2019-10-02 15:00:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 4315. [2019-10-02 15:00:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-02 15:00:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5968 transitions. [2019-10-02 15:00:41,032 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5968 transitions. Word has length 57 [2019-10-02 15:00:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:41,033 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5968 transitions. [2019-10-02 15:00:41,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:00:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5968 transitions. [2019-10-02 15:00:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 15:00:41,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:41,039 INFO L411 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-10-02 15:00:41,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-02 15:00:41,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:41,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:41,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:41,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:41,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:41,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:41,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:41,134 INFO L87 Difference]: Start difference. First operand 4315 states and 5968 transitions. Second operand 3 states. [2019-10-02 15:00:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:41,658 INFO L93 Difference]: Finished difference Result 7979 states and 11287 transitions. [2019-10-02 15:00:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:41,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 15:00:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:41,670 INFO L225 Difference]: With dead ends: 7979 [2019-10-02 15:00:41,671 INFO L226 Difference]: Without dead ends: 5459 [2019-10-02 15:00:41,678 INFO L640 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-10-02 15:00:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-10-02 15:00:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5453. [2019-10-02 15:00:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-02 15:00:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7525 transitions. [2019-10-02 15:00:42,055 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7525 transitions. Word has length 58 [2019-10-02 15:00:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:42,056 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 7525 transitions. [2019-10-02 15:00:42,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7525 transitions. [2019-10-02 15:00:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 15:00:42,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:42,062 INFO L411 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-10-02 15:00:42,063 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-02 15:00:42,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:42,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:42,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:42,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:42,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:42,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:42,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:42,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:42,157 INFO L87 Difference]: Start difference. First operand 5453 states and 7525 transitions. Second operand 3 states. [2019-10-02 15:00:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:42,809 INFO L93 Difference]: Finished difference Result 8882 states and 12823 transitions. [2019-10-02 15:00:42,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:42,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 15:00:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:42,827 INFO L225 Difference]: With dead ends: 8882 [2019-10-02 15:00:42,828 INFO L226 Difference]: Without dead ends: 6617 [2019-10-02 15:00:42,835 INFO L640 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-10-02 15:00:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-10-02 15:00:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6025. [2019-10-02 15:00:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6025 states. [2019-10-02 15:00:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8443 transitions. [2019-10-02 15:00:43,396 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8443 transitions. Word has length 58 [2019-10-02 15:00:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:43,397 INFO L475 AbstractCegarLoop]: Abstraction has 6025 states and 8443 transitions. [2019-10-02 15:00:43,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8443 transitions. [2019-10-02 15:00:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 15:00:43,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:43,401 INFO L411 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-10-02 15:00:43,404 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-02 15:00:43,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:43,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:43,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:43,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:43,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:43,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:43,484 INFO L87 Difference]: Start difference. First operand 6025 states and 8443 transitions. Second operand 3 states. [2019-10-02 15:00:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:43,951 INFO L93 Difference]: Finished difference Result 11249 states and 16372 transitions. [2019-10-02 15:00:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:43,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 15:00:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:43,969 INFO L225 Difference]: With dead ends: 11249 [2019-10-02 15:00:43,970 INFO L226 Difference]: Without dead ends: 8007 [2019-10-02 15:00:43,979 INFO L640 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-10-02 15:00:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8007 states. [2019-10-02 15:00:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8007 to 7105. [2019-10-02 15:00:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-10-02 15:00:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 10025 transitions. [2019-10-02 15:00:44,706 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 10025 transitions. Word has length 58 [2019-10-02 15:00:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:44,706 INFO L475 AbstractCegarLoop]: Abstraction has 7105 states and 10025 transitions. [2019-10-02 15:00:44,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 10025 transitions. [2019-10-02 15:00:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 15:00:44,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:44,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:44,711 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-02 15:00:44,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:44,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:44,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:44,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:44,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:44,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:44,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:44,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:44,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:44,768 INFO L87 Difference]: Start difference. First operand 7105 states and 10025 transitions. Second operand 3 states. [2019-10-02 15:00:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:45,855 INFO L93 Difference]: Finished difference Result 13710 states and 19567 transitions. [2019-10-02 15:00:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:45,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 15:00:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:45,875 INFO L225 Difference]: With dead ends: 13710 [2019-10-02 15:00:45,876 INFO L226 Difference]: Without dead ends: 7194 [2019-10-02 15:00:45,890 INFO L640 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-10-02 15:00:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-10-02 15:00:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 5653. [2019-10-02 15:00:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-10-02 15:00:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8055 transitions. [2019-10-02 15:00:46,592 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8055 transitions. Word has length 59 [2019-10-02 15:00:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:46,593 INFO L475 AbstractCegarLoop]: Abstraction has 5653 states and 8055 transitions. [2019-10-02 15:00:46,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8055 transitions. [2019-10-02 15:00:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 15:00:46,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:46,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:46,597 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-10-02 15:00:46,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:46,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:46,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:46,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:46,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:46,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:46,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:46,659 INFO L87 Difference]: Start difference. First operand 5653 states and 8055 transitions. Second operand 3 states. [2019-10-02 15:00:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:47,361 INFO L93 Difference]: Finished difference Result 13247 states and 19432 transitions. [2019-10-02 15:00:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:47,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 15:00:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:47,381 INFO L225 Difference]: With dead ends: 13247 [2019-10-02 15:00:47,382 INFO L226 Difference]: Without dead ends: 8449 [2019-10-02 15:00:47,394 INFO L640 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-10-02 15:00:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-10-02 15:00:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 6679. [2019-10-02 15:00:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2019-10-02 15:00:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 9719 transitions. [2019-10-02 15:00:48,080 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 9719 transitions. Word has length 59 [2019-10-02 15:00:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:48,080 INFO L475 AbstractCegarLoop]: Abstraction has 6679 states and 9719 transitions. [2019-10-02 15:00:48,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 9719 transitions. [2019-10-02 15:00:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 15:00:48,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:48,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:48,083 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-10-02 15:00:48,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:48,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:48,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:48,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:48,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:48,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:48,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:48,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:48,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:48,140 INFO L87 Difference]: Start difference. First operand 6679 states and 9719 transitions. Second operand 3 states. [2019-10-02 15:00:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:49,061 INFO L93 Difference]: Finished difference Result 16908 states and 25060 transitions. [2019-10-02 15:00:49,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:49,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 15:00:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:49,079 INFO L225 Difference]: With dead ends: 16908 [2019-10-02 15:00:49,079 INFO L226 Difference]: Without dead ends: 10816 [2019-10-02 15:00:49,090 INFO L640 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-10-02 15:00:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2019-10-02 15:00:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 8416. [2019-10-02 15:00:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-10-02 15:00:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 12405 transitions. [2019-10-02 15:00:49,931 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 12405 transitions. Word has length 59 [2019-10-02 15:00:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:49,931 INFO L475 AbstractCegarLoop]: Abstraction has 8416 states and 12405 transitions. [2019-10-02 15:00:49,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 12405 transitions. [2019-10-02 15:00:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:00:49,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:49,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:49,934 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:49,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1408819210, now seen corresponding path program 1 times [2019-10-02 15:00:49,934 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:49,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:49,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 15:00:50,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 15:00:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 15:00:50,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:00:50,622 INFO L87 Difference]: Start difference. First operand 8416 states and 12405 transitions. Second operand 19 states. [2019-10-02 15:00:50,795 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-10-02 15:00:51,802 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-02 15:00:53,737 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 15:00:53,909 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 15:00:54,766 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-02 15:00:55,645 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-02 15:01:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:02,867 INFO L93 Difference]: Finished difference Result 29893 states and 44689 transitions. [2019-10-02 15:01:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 15:01:02,867 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-02 15:01:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:02,900 INFO L225 Difference]: With dead ends: 29893 [2019-10-02 15:01:02,900 INFO L226 Difference]: Without dead ends: 29889 [2019-10-02 15:01:02,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 15:01:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29889 states. [2019-10-02 15:01:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29889 to 8428. [2019-10-02 15:01:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8428 states. [2019-10-02 15:01:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 12422 transitions. [2019-10-02 15:01:04,004 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 12422 transitions. Word has length 60 [2019-10-02 15:01:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:04,004 INFO L475 AbstractCegarLoop]: Abstraction has 8428 states and 12422 transitions. [2019-10-02 15:01:04,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 15:01:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 12422 transitions. [2019-10-02 15:01:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:01:04,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:04,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:04,007 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1965728590, now seen corresponding path program 1 times [2019-10-02 15:01:04,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:04,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:04,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:04,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:04,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 15:01:04,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 15:01:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 15:01:04,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 15:01:04,612 INFO L87 Difference]: Start difference. First operand 8428 states and 12422 transitions. Second operand 18 states. [2019-10-02 15:01:04,915 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-10-02 15:01:05,184 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-10-02 15:01:05,943 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 15:01:06,626 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-10-02 15:01:06,810 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-02 15:01:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:15,448 INFO L93 Difference]: Finished difference Result 29932 states and 44747 transitions. [2019-10-02 15:01:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 15:01:15,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-10-02 15:01:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:15,480 INFO L225 Difference]: With dead ends: 29932 [2019-10-02 15:01:15,481 INFO L226 Difference]: Without dead ends: 29928 [2019-10-02 15:01:15,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 15:01:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29928 states. [2019-10-02 15:01:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29928 to 8428. [2019-10-02 15:01:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8428 states. [2019-10-02 15:01:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 12421 transitions. [2019-10-02 15:01:17,294 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 12421 transitions. Word has length 60 [2019-10-02 15:01:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:17,294 INFO L475 AbstractCegarLoop]: Abstraction has 8428 states and 12421 transitions. [2019-10-02 15:01:17,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 15:01:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 12421 transitions. [2019-10-02 15:01:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:01:17,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:17,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:17,296 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1464680332, now seen corresponding path program 1 times [2019-10-02 15:01:17,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:17,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:17,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:17,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 15:01:17,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 15:01:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 15:01:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:01:17,977 INFO L87 Difference]: Start difference. First operand 8428 states and 12421 transitions. Second operand 19 states. [2019-10-02 15:01:18,209 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-02 15:01:19,079 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 15:01:19,315 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 15:01:19,609 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 15:01:19,795 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 15:01:20,086 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-02 15:01:20,295 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-02 15:01:20,521 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-10-02 15:01:21,264 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-02 15:01:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:28,221 INFO L93 Difference]: Finished difference Result 22185 states and 33119 transitions. [2019-10-02 15:01:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 15:01:28,221 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-02 15:01:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:28,242 INFO L225 Difference]: With dead ends: 22185 [2019-10-02 15:01:28,242 INFO L226 Difference]: Without dead ends: 22179 [2019-10-02 15:01:28,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 15:01:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22179 states. [2019-10-02 15:01:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22179 to 8428. [2019-10-02 15:01:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8428 states. [2019-10-02 15:01:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 12420 transitions. [2019-10-02 15:01:29,359 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 12420 transitions. Word has length 60 [2019-10-02 15:01:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:29,360 INFO L475 AbstractCegarLoop]: Abstraction has 8428 states and 12420 transitions. [2019-10-02 15:01:29,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 15:01:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 12420 transitions. [2019-10-02 15:01:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:01:29,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:29,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:29,362 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1506240748, now seen corresponding path program 1 times [2019-10-02 15:01:29,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:29,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:29,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:29,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 15:01:29,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 15:01:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 15:01:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:01:29,873 INFO L87 Difference]: Start difference. First operand 8428 states and 12420 transitions. Second operand 11 states. [2019-10-02 15:01:30,519 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-02 15:01:30,812 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-02 15:01:31,088 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-10-02 15:01:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:37,670 INFO L93 Difference]: Finished difference Result 32325 states and 47978 transitions. [2019-10-02 15:01:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 15:01:37,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-02 15:01:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:37,701 INFO L225 Difference]: With dead ends: 32325 [2019-10-02 15:01:37,701 INFO L226 Difference]: Without dead ends: 32028 [2019-10-02 15:01:37,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2019-10-02 15:01:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32028 states. [2019-10-02 15:01:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32028 to 8317. [2019-10-02 15:01:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2019-10-02 15:01:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 12278 transitions. [2019-10-02 15:01:38,955 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 12278 transitions. Word has length 60 [2019-10-02 15:01:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:38,956 INFO L475 AbstractCegarLoop]: Abstraction has 8317 states and 12278 transitions. [2019-10-02 15:01:38,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 15:01:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 12278 transitions. [2019-10-02 15:01:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 15:01:38,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:38,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:38,958 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash 818671798, now seen corresponding path program 1 times [2019-10-02 15:01:38,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:38,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:38,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:39,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:39,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 15:01:39,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 15:01:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 15:01:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-02 15:01:39,506 INFO L87 Difference]: Start difference. First operand 8317 states and 12278 transitions. Second operand 13 states. [2019-10-02 15:01:40,067 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-02 15:01:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:43,865 INFO L93 Difference]: Finished difference Result 13743 states and 20166 transitions. [2019-10-02 15:01:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 15:01:43,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-10-02 15:01:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:43,886 INFO L225 Difference]: With dead ends: 13743 [2019-10-02 15:01:43,886 INFO L226 Difference]: Without dead ends: 13510 [2019-10-02 15:01:43,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-10-02 15:01:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13510 states. [2019-10-02 15:01:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13510 to 8308. [2019-10-02 15:01:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8308 states. [2019-10-02 15:01:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8308 states to 8308 states and 12266 transitions. [2019-10-02 15:01:45,461 INFO L78 Accepts]: Start accepts. Automaton has 8308 states and 12266 transitions. Word has length 61 [2019-10-02 15:01:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:45,461 INFO L475 AbstractCegarLoop]: Abstraction has 8308 states and 12266 transitions. [2019-10-02 15:01:45,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 15:01:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8308 states and 12266 transitions. [2019-10-02 15:01:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 15:01:45,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:45,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:45,464 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash 624248826, now seen corresponding path program 1 times [2019-10-02 15:01:45,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:45,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:45,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:45,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:45,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:45,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:01:45,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:01:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:01:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:01:45,552 INFO L87 Difference]: Start difference. First operand 8308 states and 12266 transitions. Second operand 6 states. [2019-10-02 15:01:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:50,732 INFO L93 Difference]: Finished difference Result 36883 states and 54646 transitions. [2019-10-02 15:01:50,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 15:01:50,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-02 15:01:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:50,760 INFO L225 Difference]: With dead ends: 36883 [2019-10-02 15:01:50,760 INFO L226 Difference]: Without dead ends: 29251 [2019-10-02 15:01:50,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:01:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29251 states. [2019-10-02 15:01:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29251 to 25663. [2019-10-02 15:01:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25663 states. [2019-10-02 15:01:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25663 states to 25663 states and 37128 transitions. [2019-10-02 15:01:55,143 INFO L78 Accepts]: Start accepts. Automaton has 25663 states and 37128 transitions. Word has length 67 [2019-10-02 15:01:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:55,143 INFO L475 AbstractCegarLoop]: Abstraction has 25663 states and 37128 transitions. [2019-10-02 15:01:55,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:01:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25663 states and 37128 transitions. [2019-10-02 15:01:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 15:01:55,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:55,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:55,146 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:55,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1849830759, now seen corresponding path program 1 times [2019-10-02 15:01:55,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:55,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:55,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:55,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:55,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:55,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:55,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:55,252 INFO L87 Difference]: Start difference. First operand 25663 states and 37128 transitions. Second operand 5 states. [2019-10-02 15:01:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:59,620 INFO L93 Difference]: Finished difference Result 47042 states and 68031 transitions. [2019-10-02 15:01:59,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:01:59,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-02 15:01:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:59,645 INFO L225 Difference]: With dead ends: 47042 [2019-10-02 15:01:59,645 INFO L226 Difference]: Without dead ends: 22028 [2019-10-02 15:01:59,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-02 15:01:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22028 states. [2019-10-02 15:02:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22028 to 19439. [2019-10-02 15:02:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19439 states. [2019-10-02 15:02:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19439 states to 19439 states and 27788 transitions. [2019-10-02 15:02:04,572 INFO L78 Accepts]: Start accepts. Automaton has 19439 states and 27788 transitions. Word has length 68 [2019-10-02 15:02:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:04,573 INFO L475 AbstractCegarLoop]: Abstraction has 19439 states and 27788 transitions. [2019-10-02 15:02:04,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:02:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 19439 states and 27788 transitions. [2019-10-02 15:02:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 15:02:04,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:04,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:04,577 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1871092716, now seen corresponding path program 1 times [2019-10-02 15:02:04,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:04,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:04,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:04,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:04,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:02:04,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:02:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:02:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:02:04,675 INFO L87 Difference]: Start difference. First operand 19439 states and 27788 transitions. Second operand 6 states. [2019-10-02 15:02:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:11,946 INFO L93 Difference]: Finished difference Result 33741 states and 47598 transitions. [2019-10-02 15:02:11,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:02:11,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-02 15:02:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:11,980 INFO L225 Difference]: With dead ends: 33741 [2019-10-02 15:02:11,980 INFO L226 Difference]: Without dead ends: 33739 [2019-10-02 15:02:11,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:02:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33739 states. [2019-10-02 15:02:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33739 to 20081. [2019-10-02 15:02:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20081 states. [2019-10-02 15:02:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20081 states to 20081 states and 28281 transitions. [2019-10-02 15:02:16,324 INFO L78 Accepts]: Start accepts. Automaton has 20081 states and 28281 transitions. Word has length 70 [2019-10-02 15:02:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:16,324 INFO L475 AbstractCegarLoop]: Abstraction has 20081 states and 28281 transitions. [2019-10-02 15:02:16,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:02:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 20081 states and 28281 transitions. [2019-10-02 15:02:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 15:02:16,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:16,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:16,330 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2055411099, now seen corresponding path program 1 times [2019-10-02 15:02:16,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:16,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:16,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:16,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:16,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:16,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:16,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:16,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:16,392 INFO L87 Difference]: Start difference. First operand 20081 states and 28281 transitions. Second operand 3 states. [2019-10-02 15:02:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:23,904 INFO L93 Difference]: Finished difference Result 54539 states and 76989 transitions. [2019-10-02 15:02:23,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:23,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 15:02:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:23,942 INFO L225 Difference]: With dead ends: 54539 [2019-10-02 15:02:23,942 INFO L226 Difference]: Without dead ends: 35079 [2019-10-02 15:02:23,958 INFO L640 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-10-02 15:02:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35079 states. [2019-10-02 15:02:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35079 to 34613. [2019-10-02 15:02:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34613 states. [2019-10-02 15:02:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34613 states to 34613 states and 48149 transitions. [2019-10-02 15:02:32,485 INFO L78 Accepts]: Start accepts. Automaton has 34613 states and 48149 transitions. Word has length 71 [2019-10-02 15:02:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:32,486 INFO L475 AbstractCegarLoop]: Abstraction has 34613 states and 48149 transitions. [2019-10-02 15:02:32,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34613 states and 48149 transitions. [2019-10-02 15:02:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 15:02:32,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:32,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:32,492 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1175358734, now seen corresponding path program 1 times [2019-10-02 15:02:32,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:32,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:32,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:32,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:32,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:32,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:32,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:32,557 INFO L87 Difference]: Start difference. First operand 34613 states and 48149 transitions. Second operand 3 states. [2019-10-02 15:02:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:39,922 INFO L93 Difference]: Finished difference Result 39363 states and 54677 transitions. [2019-10-02 15:02:39,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:39,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-02 15:02:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:39,959 INFO L225 Difference]: With dead ends: 39363 [2019-10-02 15:02:39,959 INFO L226 Difference]: Without dead ends: 34598 [2019-10-02 15:02:39,969 INFO L640 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-10-02 15:02:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34598 states. [2019-10-02 15:02:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34598 to 29446. [2019-10-02 15:02:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29446 states. [2019-10-02 15:02:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29446 states to 29446 states and 40768 transitions. [2019-10-02 15:02:46,351 INFO L78 Accepts]: Start accepts. Automaton has 29446 states and 40768 transitions. Word has length 72 [2019-10-02 15:02:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:46,351 INFO L475 AbstractCegarLoop]: Abstraction has 29446 states and 40768 transitions. [2019-10-02 15:02:46,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 29446 states and 40768 transitions. [2019-10-02 15:02:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 15:02:46,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:46,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:46,356 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:46,356 INFO L82 PathProgramCache]: Analyzing trace with hash 353507174, now seen corresponding path program 1 times [2019-10-02 15:02:46,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:46,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:46,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:46,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:46,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:02:46,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:02:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:02:46,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:02:46,443 INFO L87 Difference]: Start difference. First operand 29446 states and 40768 transitions. Second operand 5 states. [2019-10-02 15:03:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:08,934 INFO L93 Difference]: Finished difference Result 120894 states and 167626 transitions. [2019-10-02 15:03:08,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:03:08,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-02 15:03:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:09,037 INFO L225 Difference]: With dead ends: 120894 [2019-10-02 15:03:09,037 INFO L226 Difference]: Without dead ends: 92051 [2019-10-02 15:03:09,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:03:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92051 states. [2019-10-02 15:03:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92051 to 47960. [2019-10-02 15:03:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47960 states. [2019-10-02 15:03:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47960 states to 47960 states and 65386 transitions. [2019-10-02 15:03:21,552 INFO L78 Accepts]: Start accepts. Automaton has 47960 states and 65386 transitions. Word has length 74 [2019-10-02 15:03:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:21,552 INFO L475 AbstractCegarLoop]: Abstraction has 47960 states and 65386 transitions. [2019-10-02 15:03:21,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:03:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 47960 states and 65386 transitions. [2019-10-02 15:03:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 15:03:21,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:21,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:03:21,557 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2143339772, now seen corresponding path program 1 times [2019-10-02 15:03:21,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:03:21,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:21,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:03:21,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:03:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:03:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:03:21,637 INFO L87 Difference]: Start difference. First operand 47960 states and 65386 transitions. Second operand 5 states. [2019-10-02 15:03:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:56,506 INFO L93 Difference]: Finished difference Result 193122 states and 263082 transitions. [2019-10-02 15:03:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:03:56,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 15:03:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:56,686 INFO L225 Difference]: With dead ends: 193122 [2019-10-02 15:03:56,686 INFO L226 Difference]: Without dead ends: 145763 [2019-10-02 15:03:56,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:03:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145763 states. [2019-10-02 15:04:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145763 to 94921. [2019-10-02 15:04:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94921 states. [2019-10-02 15:04:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94921 states to 94921 states and 128897 transitions. [2019-10-02 15:04:20,231 INFO L78 Accepts]: Start accepts. Automaton has 94921 states and 128897 transitions. Word has length 77 [2019-10-02 15:04:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:20,231 INFO L475 AbstractCegarLoop]: Abstraction has 94921 states and 128897 transitions. [2019-10-02 15:04:20,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:04:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 94921 states and 128897 transitions. [2019-10-02 15:04:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 15:04:20,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:20,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:04:20,236 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1797768461, now seen corresponding path program 1 times [2019-10-02 15:04:20,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:20,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:20,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:20,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:20,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:04:20,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:20,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:04:20,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:04:20,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:04:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:04:20,402 INFO L87 Difference]: Start difference. First operand 94921 states and 128897 transitions. Second operand 6 states. [2019-10-02 15:04:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:50,146 INFO L93 Difference]: Finished difference Result 164713 states and 224206 transitions. [2019-10-02 15:04:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:04:50,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-02 15:04:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:50,296 INFO L225 Difference]: With dead ends: 164713 [2019-10-02 15:04:50,296 INFO L226 Difference]: Without dead ends: 121603 [2019-10-02 15:04:50,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:04:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121603 states. [2019-10-02 15:05:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121603 to 111125. [2019-10-02 15:05:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111125 states. [2019-10-02 15:05:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111125 states to 111125 states and 150595 transitions. [2019-10-02 15:05:18,307 INFO L78 Accepts]: Start accepts. Automaton has 111125 states and 150595 transitions. Word has length 79 [2019-10-02 15:05:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:18,308 INFO L475 AbstractCegarLoop]: Abstraction has 111125 states and 150595 transitions. [2019-10-02 15:05:18,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:05:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 111125 states and 150595 transitions. [2019-10-02 15:05:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 15:05:18,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:18,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:18,313 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1867381610, now seen corresponding path program 1 times [2019-10-02 15:05:18,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:18,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:18,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:18,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:18,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:18,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:18,387 INFO L87 Difference]: Start difference. First operand 111125 states and 150595 transitions. Second operand 3 states. [2019-10-02 15:06:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:08,427 INFO L93 Difference]: Finished difference Result 310618 states and 419743 transitions. [2019-10-02 15:06:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:06:08,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-02 15:06:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:08,697 INFO L225 Difference]: With dead ends: 310618 [2019-10-02 15:06:08,697 INFO L226 Difference]: Without dead ends: 200108 [2019-10-02 15:06:08,779 INFO L640 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-10-02 15:06:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200108 states. [2019-10-02 15:06:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200108 to 142347. [2019-10-02 15:06:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142347 states. [2019-10-02 15:06:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142347 states to 142347 states and 189634 transitions. [2019-10-02 15:06:47,365 INFO L78 Accepts]: Start accepts. Automaton has 142347 states and 189634 transitions. Word has length 79 [2019-10-02 15:06:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:47,365 INFO L475 AbstractCegarLoop]: Abstraction has 142347 states and 189634 transitions. [2019-10-02 15:06:47,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:06:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 142347 states and 189634 transitions. [2019-10-02 15:06:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 15:06:47,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:47,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:06:47,370 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:47,371 INFO L82 PathProgramCache]: Analyzing trace with hash 186938905, now seen corresponding path program 1 times [2019-10-02 15:06:47,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:47,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:47,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:47,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:47,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:06:47,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:47,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:06:47,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:06:47,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:06:47,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:06:47,435 INFO L87 Difference]: Start difference. First operand 142347 states and 189634 transitions. Second operand 3 states. [2019-10-02 15:07:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:07:35,873 INFO L93 Difference]: Finished difference Result 321273 states and 426691 transitions. [2019-10-02 15:07:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:07:35,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-02 15:07:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:07:36,104 INFO L225 Difference]: With dead ends: 321273 [2019-10-02 15:07:36,104 INFO L226 Difference]: Without dead ends: 179532 [2019-10-02 15:07:36,223 INFO L640 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-10-02 15:07:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179532 states. [2019-10-02 15:08:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179532 to 140517. [2019-10-02 15:08:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140517 states. [2019-10-02 15:08:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140517 states to 140517 states and 183828 transitions. [2019-10-02 15:08:16,175 INFO L78 Accepts]: Start accepts. Automaton has 140517 states and 183828 transitions. Word has length 82 [2019-10-02 15:08:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:08:16,176 INFO L475 AbstractCegarLoop]: Abstraction has 140517 states and 183828 transitions. [2019-10-02 15:08:16,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:08:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 140517 states and 183828 transitions. [2019-10-02 15:08:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 15:08:16,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:08:16,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:08:16,183 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:08:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:08:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash 778717480, now seen corresponding path program 1 times [2019-10-02 15:08:16,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:08:16,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:08:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:16,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:08:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:08:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:08:16,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:08:16,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:08:16,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:08:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:08:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:08:16,246 INFO L87 Difference]: Start difference. First operand 140517 states and 183828 transitions. Second operand 3 states. [2019-10-02 15:09:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:03,142 INFO L93 Difference]: Finished difference Result 304071 states and 396410 transitions. [2019-10-02 15:09:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:03,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-02 15:09:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:03,376 INFO L225 Difference]: With dead ends: 304071 [2019-10-02 15:09:03,376 INFO L226 Difference]: Without dead ends: 164128 [2019-10-02 15:09:03,465 INFO L640 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-10-02 15:09:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164128 states. [2019-10-02 15:09:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164128 to 155254. [2019-10-02 15:09:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155254 states. [2019-10-02 15:09:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155254 states to 155254 states and 200097 transitions. [2019-10-02 15:09:45,078 INFO L78 Accepts]: Start accepts. Automaton has 155254 states and 200097 transitions. Word has length 85 [2019-10-02 15:09:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:45,078 INFO L475 AbstractCegarLoop]: Abstraction has 155254 states and 200097 transitions. [2019-10-02 15:09:45,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 155254 states and 200097 transitions. [2019-10-02 15:09:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 15:09:45,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:45,087 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:09:45,088 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash 25741144, now seen corresponding path program 1 times [2019-10-02 15:09:45,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:45,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:09:45,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:45,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:09:45,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:09:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:09:45,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:09:45,239 INFO L87 Difference]: Start difference. First operand 155254 states and 200097 transitions. Second operand 9 states. [2019-10-02 15:11:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:32,442 INFO L93 Difference]: Finished difference Result 412123 states and 529294 transitions. [2019-10-02 15:11:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 15:11:32,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-02 15:11:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:32,949 INFO L225 Difference]: With dead ends: 412123 [2019-10-02 15:11:32,949 INFO L226 Difference]: Without dead ends: 382949 [2019-10-02 15:11:33,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-10-02 15:11:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382949 states. [2019-10-02 15:12:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382949 to 155239. [2019-10-02 15:12:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155239 states. [2019-10-02 15:12:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155239 states to 155239 states and 200081 transitions. [2019-10-02 15:12:21,171 INFO L78 Accepts]: Start accepts. Automaton has 155239 states and 200081 transitions. Word has length 92 [2019-10-02 15:12:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:12:21,171 INFO L475 AbstractCegarLoop]: Abstraction has 155239 states and 200081 transitions. [2019-10-02 15:12:21,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:12:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 155239 states and 200081 transitions. [2019-10-02 15:12:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 15:12:21,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:12:21,181 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:12:21,181 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:12:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:12:21,182 INFO L82 PathProgramCache]: Analyzing trace with hash -978519268, now seen corresponding path program 1 times [2019-10-02 15:12:21,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:12:21,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:12:21,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:21,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:21,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:12:21,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:12:21,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 15:12:21,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:12:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:12:21,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:12:21,400 INFO L87 Difference]: Start difference. First operand 155239 states and 200081 transitions. Second operand 10 states.