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.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:55:52,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:55:52,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:55:52,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:55:52,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:55:52,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:55:52,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:55:52,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:55:52,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:55:52,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:55:52,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:55:52,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:55:52,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:55:52,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:55:52,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:55:52,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:55:52,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:55:52,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:55:52,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:55:52,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:55:52,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:55:52,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:55:52,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:55:52,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:55:52,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:55:52,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:55:52,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:55:52,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:55:52,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:55:52,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:55:52,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:55:52,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:55:52,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:55:52,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:55:52,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:55:52,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:55:52,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:55:52,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:55:52,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:55:52,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:55:52,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:55:52,942 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 14:55:52,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:55:52,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:55:52,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:55:52,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:55:52,959 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:55:52,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:55:52,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:55:52,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:55:52,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:55:52,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:55:52,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:55:52,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:55:52,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:55:52,960 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:55:52,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:55:52,961 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:55:52,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:55:52,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:55:52,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:55:52,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:55:52,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:55:52,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:55:52,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:55:52,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:55:52,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:55:52,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:55:52,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:55:52,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:55:52,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:55:52,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:55:53,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:55:53,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:55:53,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:55:53,014 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:55:53,015 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.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-02 14:55:53,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38ffc613/a4daf2b558b54d538c86a12d4fad8296/FLAG07fecd864 [2019-10-02 14:55:53,726 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:55:53,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-02 14:55:53,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38ffc613/a4daf2b558b54d538c86a12d4fad8296/FLAG07fecd864 [2019-10-02 14:55:53,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38ffc613/a4daf2b558b54d538c86a12d4fad8296 [2019-10-02 14:55:53,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:55:53,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:55:53,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:55:53,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:55:53,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:55:53,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:55:53" (1/1) ... [2019-10-02 14:55:53,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c32c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:53, skipping insertion in model container [2019-10-02 14:55:53,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:55:53" (1/1) ... [2019-10-02 14:55:53,999 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:55:54,109 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:55:54,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:55:55,011 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:55:55,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:55:55,380 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:55:55,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55 WrapperNode [2019-10-02 14:55:55,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:55:55,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:55:55,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:55:55,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:55:55,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (1/1) ... [2019-10-02 14:55:55,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (1/1) ... [2019-10-02 14:55:55,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (1/1) ... [2019-10-02 14:55:55,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (1/1) ... [2019-10-02 14:55:55,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (1/1) ... [2019-10-02 14:55:55,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (1/1) ... [2019-10-02 14:55:55,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (1/1) ... [2019-10-02 14:55:55,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:55:55,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:55:55,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:55:55,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:55:55,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (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 14:55:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:55:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:55:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:55:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:55:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:55:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:55:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:55:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:55:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:55:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:55:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:55:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:55:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:55:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:55:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:55:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:55:55,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:55:55,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:55:57,764 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:55:57,766 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:55:57,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:55:57 BoogieIcfgContainer [2019-10-02 14:55:57,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:55:57,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:55:57,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:55:57,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:55:57,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:55:53" (1/3) ... [2019-10-02 14:55:57,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c000d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:55:57, skipping insertion in model container [2019-10-02 14:55:57,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:55" (2/3) ... [2019-10-02 14:55:57,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c000d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:55:57, skipping insertion in model container [2019-10-02 14:55:57,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:55:57" (3/3) ... [2019-10-02 14:55:57,782 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-02 14:55:57,794 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:55:57,805 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-02 14:55:57,826 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-02 14:55:57,878 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:55:57,879 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:55:57,879 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:55:57,879 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:55:57,880 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:55:57,880 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:55:57,880 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:55:57,880 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:55:57,880 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:55:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states. [2019-10-02 14:55:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:55:57,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:57,946 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] [2019-10-02 14:55:57,948 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1062699127, now seen corresponding path program 1 times [2019-10-02 14:55:57,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:57,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:58,421 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 14:55:58,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:58,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:55:58,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:55:58,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:55:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:55:58,446 INFO L87 Difference]: Start difference. First operand 447 states. Second operand 3 states. [2019-10-02 14:55:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:58,617 INFO L93 Difference]: Finished difference Result 697 states and 1222 transitions. [2019-10-02 14:55:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:55:58,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-02 14:55:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:58,641 INFO L225 Difference]: With dead ends: 697 [2019-10-02 14:55:58,642 INFO L226 Difference]: Without dead ends: 550 [2019-10-02 14:55:58,646 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 14:55:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-02 14:55:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 544. [2019-10-02 14:55:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-02 14:55:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 719 transitions. [2019-10-02 14:55:58,723 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 719 transitions. Word has length 54 [2019-10-02 14:55:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:58,724 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 719 transitions. [2019-10-02 14:55:58,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:55:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 719 transitions. [2019-10-02 14:55:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:55:58,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:58,728 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] [2019-10-02 14:55:58,728 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -194729860, now seen corresponding path program 1 times [2019-10-02 14:55:58,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:58,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:58,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:58,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:58,858 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 14:55:58,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:58,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:55:58,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:55:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:55:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:55:58,863 INFO L87 Difference]: Start difference. First operand 544 states and 719 transitions. Second operand 3 states. [2019-10-02 14:55:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:58,942 INFO L93 Difference]: Finished difference Result 959 states and 1321 transitions. [2019-10-02 14:55:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:55:58,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-02 14:55:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:58,948 INFO L225 Difference]: With dead ends: 959 [2019-10-02 14:55:58,948 INFO L226 Difference]: Without dead ends: 718 [2019-10-02 14:55:58,950 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 14:55:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-02 14:55:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 712. [2019-10-02 14:55:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-02 14:55:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 957 transitions. [2019-10-02 14:55:58,988 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 957 transitions. Word has length 54 [2019-10-02 14:55:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:58,989 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 957 transitions. [2019-10-02 14:55:58,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:55:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 957 transitions. [2019-10-02 14:55:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:55:58,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:58,992 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] [2019-10-02 14:55:58,992 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash 509758050, now seen corresponding path program 1 times [2019-10-02 14:55:58,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:58,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:58,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:58,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:58,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:59,276 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 14:55:59,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:59,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:55:59,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:55:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:55:59,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:55:59,278 INFO L87 Difference]: Start difference. First operand 712 states and 957 transitions. Second operand 10 states. [2019-10-02 14:56:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:01,341 INFO L93 Difference]: Finished difference Result 2252 states and 3213 transitions. [2019-10-02 14:56:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:56:01,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-02 14:56:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:01,353 INFO L225 Difference]: With dead ends: 2252 [2019-10-02 14:56:01,353 INFO L226 Difference]: Without dead ends: 2121 [2019-10-02 14:56:01,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:56:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-10-02 14:56:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 723. [2019-10-02 14:56:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-10-02 14:56:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 971 transitions. [2019-10-02 14:56:01,414 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 971 transitions. Word has length 54 [2019-10-02 14:56:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:01,415 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 971 transitions. [2019-10-02 14:56:01,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 971 transitions. [2019-10-02 14:56:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:01,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:01,418 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 14:56:01,418 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1420674109, now seen corresponding path program 1 times [2019-10-02 14:56:01,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:01,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:01,505 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 14:56:01,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:01,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:01,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:01,507 INFO L87 Difference]: Start difference. First operand 723 states and 971 transitions. Second operand 3 states. [2019-10-02 14:56:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:01,640 INFO L93 Difference]: Finished difference Result 1390 states and 1920 transitions. [2019-10-02 14:56:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:01,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 14:56:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:01,647 INFO L225 Difference]: With dead ends: 1390 [2019-10-02 14:56:01,647 INFO L226 Difference]: Without dead ends: 1061 [2019-10-02 14:56:01,648 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 14:56:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-10-02 14:56:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1054. [2019-10-02 14:56:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-02 14:56:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1429 transitions. [2019-10-02 14:56:01,722 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1429 transitions. Word has length 55 [2019-10-02 14:56:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:01,723 INFO L475 AbstractCegarLoop]: Abstraction has 1054 states and 1429 transitions. [2019-10-02 14:56:01,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1429 transitions. [2019-10-02 14:56:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:01,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:01,726 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 14:56:01,726 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:01,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1526715040, now seen corresponding path program 1 times [2019-10-02 14:56:01,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:01,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:01,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:01,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:01,965 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 14:56:01,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:01,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 14:56:01,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:56:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:56:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:56:01,966 INFO L87 Difference]: Start difference. First operand 1054 states and 1429 transitions. Second operand 12 states. [2019-10-02 14:56:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:05,502 INFO L93 Difference]: Finished difference Result 3825 states and 5350 transitions. [2019-10-02 14:56:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:56:05,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-10-02 14:56:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:05,528 INFO L225 Difference]: With dead ends: 3825 [2019-10-02 14:56:05,528 INFO L226 Difference]: Without dead ends: 3626 [2019-10-02 14:56:05,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:56:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-10-02 14:56:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 1070. [2019-10-02 14:56:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-10-02 14:56:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1452 transitions. [2019-10-02 14:56:05,659 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1452 transitions. Word has length 55 [2019-10-02 14:56:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:05,660 INFO L475 AbstractCegarLoop]: Abstraction has 1070 states and 1452 transitions. [2019-10-02 14:56:05,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:56:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1452 transitions. [2019-10-02 14:56:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:05,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:05,663 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 14:56:05,663 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash -822227130, now seen corresponding path program 1 times [2019-10-02 14:56:05,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:05,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:05,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:05,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:05,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:05,842 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 14:56:05,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:05,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:05,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:05,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:05,844 INFO L87 Difference]: Start difference. First operand 1070 states and 1452 transitions. Second operand 9 states. [2019-10-02 14:56:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:07,251 INFO L93 Difference]: Finished difference Result 4052 states and 5667 transitions. [2019-10-02 14:56:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:56:07,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-02 14:56:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:07,267 INFO L225 Difference]: With dead ends: 4052 [2019-10-02 14:56:07,268 INFO L226 Difference]: Without dead ends: 3292 [2019-10-02 14:56:07,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:56:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-10-02 14:56:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2379. [2019-10-02 14:56:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-10-02 14:56:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3335 transitions. [2019-10-02 14:56:07,478 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3335 transitions. Word has length 55 [2019-10-02 14:56:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:07,479 INFO L475 AbstractCegarLoop]: Abstraction has 2379 states and 3335 transitions. [2019-10-02 14:56:07,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3335 transitions. [2019-10-02 14:56:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:56:07,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:07,484 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 14:56:07,485 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1576357576, now seen corresponding path program 1 times [2019-10-02 14:56:07,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:07,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:07,685 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 14:56:07,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:07,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:07,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:07,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:07,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:07,688 INFO L87 Difference]: Start difference. First operand 2379 states and 3335 transitions. Second operand 10 states. [2019-10-02 14:56:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:09,667 INFO L93 Difference]: Finished difference Result 6160 states and 8682 transitions. [2019-10-02 14:56:09,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:56:09,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-02 14:56:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:09,694 INFO L225 Difference]: With dead ends: 6160 [2019-10-02 14:56:09,694 INFO L226 Difference]: Without dead ends: 5771 [2019-10-02 14:56:09,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:56:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2019-10-02 14:56:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 2390. [2019-10-02 14:56:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-10-02 14:56:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3349 transitions. [2019-10-02 14:56:09,951 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3349 transitions. Word has length 55 [2019-10-02 14:56:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:09,952 INFO L475 AbstractCegarLoop]: Abstraction has 2390 states and 3349 transitions. [2019-10-02 14:56:09,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3349 transitions. [2019-10-02 14:56:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:09,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:09,956 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 14:56:09,956 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash 306490719, now seen corresponding path program 1 times [2019-10-02 14:56:09,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:09,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:09,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:09,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:10,098 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 14:56:10,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:10,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:10,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:10,100 INFO L87 Difference]: Start difference. First operand 2390 states and 3349 transitions. Second operand 9 states. [2019-10-02 14:56:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:11,929 INFO L93 Difference]: Finished difference Result 6728 states and 9609 transitions. [2019-10-02 14:56:11,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:11,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-02 14:56:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:11,956 INFO L225 Difference]: With dead ends: 6728 [2019-10-02 14:56:11,956 INFO L226 Difference]: Without dead ends: 6175 [2019-10-02 14:56:11,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:56:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6175 states. [2019-10-02 14:56:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6175 to 2405. [2019-10-02 14:56:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-10-02 14:56:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3371 transitions. [2019-10-02 14:56:12,312 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3371 transitions. Word has length 56 [2019-10-02 14:56:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:12,313 INFO L475 AbstractCegarLoop]: Abstraction has 2405 states and 3371 transitions. [2019-10-02 14:56:12,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3371 transitions. [2019-10-02 14:56:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:12,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:12,317 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 14:56:12,317 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:12,318 INFO L82 PathProgramCache]: Analyzing trace with hash 943835121, now seen corresponding path program 1 times [2019-10-02 14:56:12,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:12,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:12,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:12,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:12,415 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 14:56:12,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:12,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:56:12,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:56:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:56:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:56:12,417 INFO L87 Difference]: Start difference. First operand 2405 states and 3371 transitions. Second operand 6 states. [2019-10-02 14:56:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:12,982 INFO L93 Difference]: Finished difference Result 4144 states and 5874 transitions. [2019-10-02 14:56:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:12,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 14:56:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:12,992 INFO L225 Difference]: With dead ends: 4144 [2019-10-02 14:56:12,992 INFO L226 Difference]: Without dead ends: 2374 [2019-10-02 14:56:12,996 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 14:56:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-10-02 14:56:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1715. [2019-10-02 14:56:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-02 14:56:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-10-02 14:56:13,197 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-10-02 14:56:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:13,197 INFO L475 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-10-02 14:56:13,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:56:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-10-02 14:56:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:13,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:13,200 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 14:56:13,200 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash 776701643, now seen corresponding path program 1 times [2019-10-02 14:56:13,201 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:13,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:13,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:13,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:13,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:13,343 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 14:56:13,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:13,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:13,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:13,345 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 10 states. [2019-10-02 14:56:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:17,153 INFO L93 Difference]: Finished difference Result 8475 states and 12038 transitions. [2019-10-02 14:56:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:56:17,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-02 14:56:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:17,184 INFO L225 Difference]: With dead ends: 8475 [2019-10-02 14:56:17,184 INFO L226 Difference]: Without dead ends: 7941 [2019-10-02 14:56:17,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:56:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2019-10-02 14:56:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 1715. [2019-10-02 14:56:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-02 14:56:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-10-02 14:56:17,534 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-10-02 14:56:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:17,539 INFO L475 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-10-02 14:56:17,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-10-02 14:56:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:17,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:17,542 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 14:56:17,542 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1768109464, now seen corresponding path program 1 times [2019-10-02 14:56:17,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:17,669 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 14:56:17,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:17,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:17,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:17,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:17,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:17,671 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 9 states. [2019-10-02 14:56:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:19,420 INFO L93 Difference]: Finished difference Result 7739 states and 10931 transitions. [2019-10-02 14:56:19,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:56:19,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-02 14:56:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:19,434 INFO L225 Difference]: With dead ends: 7739 [2019-10-02 14:56:19,434 INFO L226 Difference]: Without dead ends: 6267 [2019-10-02 14:56:19,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:56:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6267 states. [2019-10-02 14:56:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6267 to 4343. [2019-10-02 14:56:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-10-02 14:56:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6162 transitions. [2019-10-02 14:56:19,957 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6162 transitions. Word has length 56 [2019-10-02 14:56:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:19,957 INFO L475 AbstractCegarLoop]: Abstraction has 4343 states and 6162 transitions. [2019-10-02 14:56:19,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6162 transitions. [2019-10-02 14:56:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:19,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:19,962 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 14:56:19,962 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:19,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1848159850, now seen corresponding path program 1 times [2019-10-02 14:56:19,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:19,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:19,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:20,069 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 14:56:20,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:20,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:20,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:20,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:20,071 INFO L87 Difference]: Start difference. First operand 4343 states and 6162 transitions. Second operand 9 states. [2019-10-02 14:56:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:24,127 INFO L93 Difference]: Finished difference Result 16319 states and 22817 transitions. [2019-10-02 14:56:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:56:24,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-02 14:56:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:24,151 INFO L225 Difference]: With dead ends: 16319 [2019-10-02 14:56:24,151 INFO L226 Difference]: Without dead ends: 14835 [2019-10-02 14:56:24,158 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:56:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14835 states. [2019-10-02 14:56:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14835 to 4357. [2019-10-02 14:56:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4357 states. [2019-10-02 14:56:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6180 transitions. [2019-10-02 14:56:24,943 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6180 transitions. Word has length 56 [2019-10-02 14:56:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:24,943 INFO L475 AbstractCegarLoop]: Abstraction has 4357 states and 6180 transitions. [2019-10-02 14:56:24,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6180 transitions. [2019-10-02 14:56:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:24,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:24,947 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 14:56:24,947 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -802335602, now seen corresponding path program 1 times [2019-10-02 14:56:24,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:24,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:25,039 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 14:56:25,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:25,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:56:25,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:56:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:56:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:25,040 INFO L87 Difference]: Start difference. First operand 4357 states and 6180 transitions. Second operand 7 states. [2019-10-02 14:56:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:28,292 INFO L93 Difference]: Finished difference Result 15849 states and 22851 transitions. [2019-10-02 14:56:28,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:28,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-02 14:56:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:28,322 INFO L225 Difference]: With dead ends: 15849 [2019-10-02 14:56:28,322 INFO L226 Difference]: Without dead ends: 14955 [2019-10-02 14:56:28,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:56:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14955 states. [2019-10-02 14:56:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14955 to 4375. [2019-10-02 14:56:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2019-10-02 14:56:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6204 transitions. [2019-10-02 14:56:29,169 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6204 transitions. Word has length 56 [2019-10-02 14:56:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:29,169 INFO L475 AbstractCegarLoop]: Abstraction has 4375 states and 6204 transitions. [2019-10-02 14:56:29,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:56:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6204 transitions. [2019-10-02 14:56:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:56:29,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:29,173 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 14:56:29,173 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:29,173 INFO L82 PathProgramCache]: Analyzing trace with hash 766092927, now seen corresponding path program 1 times [2019-10-02 14:56:29,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:29,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:29,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:29,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:29,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:29,269 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 14:56:29,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:29,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:56:29,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:56:29,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:56:29,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:29,271 INFO L87 Difference]: Start difference. First operand 4375 states and 6204 transitions. Second operand 7 states. [2019-10-02 14:56:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:32,524 INFO L93 Difference]: Finished difference Result 14710 states and 21219 transitions. [2019-10-02 14:56:32,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:32,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-10-02 14:56:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:32,546 INFO L225 Difference]: With dead ends: 14710 [2019-10-02 14:56:32,546 INFO L226 Difference]: Without dead ends: 13345 [2019-10-02 14:56:32,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:56:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13345 states. [2019-10-02 14:56:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13345 to 4375. [2019-10-02 14:56:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2019-10-02 14:56:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6204 transitions. [2019-10-02 14:56:33,447 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6204 transitions. Word has length 57 [2019-10-02 14:56:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:33,448 INFO L475 AbstractCegarLoop]: Abstraction has 4375 states and 6204 transitions. [2019-10-02 14:56:33,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:56:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6204 transitions. [2019-10-02 14:56:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:56:33,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:33,451 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 14:56:33,452 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1529152438, now seen corresponding path program 1 times [2019-10-02 14:56:33,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:33,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:33,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:33,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:33,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:33,546 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 14:56:33,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:33,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:56:33,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:56:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:56:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:33,547 INFO L87 Difference]: Start difference. First operand 4375 states and 6204 transitions. Second operand 7 states. [2019-10-02 14:56:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:36,425 INFO L93 Difference]: Finished difference Result 13765 states and 19756 transitions. [2019-10-02 14:56:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:36,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-10-02 14:56:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:36,442 INFO L225 Difference]: With dead ends: 13765 [2019-10-02 14:56:36,443 INFO L226 Difference]: Without dead ends: 12297 [2019-10-02 14:56:36,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:56:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12297 states. [2019-10-02 14:56:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12297 to 4389. [2019-10-02 14:56:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2019-10-02 14:56:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 6222 transitions. [2019-10-02 14:56:37,196 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 6222 transitions. Word has length 57 [2019-10-02 14:56:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:37,196 INFO L475 AbstractCegarLoop]: Abstraction has 4389 states and 6222 transitions. [2019-10-02 14:56:37,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:56:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 6222 transitions. [2019-10-02 14:56:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:56:37,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:37,199 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 14:56:37,199 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2048418832, now seen corresponding path program 1 times [2019-10-02 14:56:37,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:37,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:37,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:37,301 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 14:56:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:37,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:56:37,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:56:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:56:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:56:37,305 INFO L87 Difference]: Start difference. First operand 4389 states and 6222 transitions. Second operand 6 states. [2019-10-02 14:56:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:38,520 INFO L93 Difference]: Finished difference Result 7984 states and 11409 transitions. [2019-10-02 14:56:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:38,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-02 14:56:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:38,525 INFO L225 Difference]: With dead ends: 7984 [2019-10-02 14:56:38,525 INFO L226 Difference]: Without dead ends: 4421 [2019-10-02 14:56:38,531 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 14:56:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2019-10-02 14:56:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3175. [2019-10-02 14:56:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2019-10-02 14:56:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4449 transitions. [2019-10-02 14:56:39,192 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4449 transitions. Word has length 57 [2019-10-02 14:56:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:39,192 INFO L475 AbstractCegarLoop]: Abstraction has 3175 states and 4449 transitions. [2019-10-02 14:56:39,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:56:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4449 transitions. [2019-10-02 14:56:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:56:39,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:39,194 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 14:56:39,195 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash -6593806, now seen corresponding path program 1 times [2019-10-02 14:56:39,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:39,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:39,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:39,266 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 14:56:39,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:39,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:56:39,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:56:39,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:56:39,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:56:39,268 INFO L87 Difference]: Start difference. First operand 3175 states and 4449 transitions. Second operand 5 states. [2019-10-02 14:56:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:40,858 INFO L93 Difference]: Finished difference Result 7264 states and 10221 transitions. [2019-10-02 14:56:40,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:40,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-02 14:56:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:40,863 INFO L225 Difference]: With dead ends: 7264 [2019-10-02 14:56:40,863 INFO L226 Difference]: Without dead ends: 4268 [2019-10-02 14:56:40,867 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 14:56:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-10-02 14:56:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 3116. [2019-10-02 14:56:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2019-10-02 14:56:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4340 transitions. [2019-10-02 14:56:41,397 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4340 transitions. Word has length 57 [2019-10-02 14:56:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:41,398 INFO L475 AbstractCegarLoop]: Abstraction has 3116 states and 4340 transitions. [2019-10-02 14:56:41,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:56:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4340 transitions. [2019-10-02 14:56:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:41,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:41,399 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 14:56:41,400 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:41,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:41,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1372855825, now seen corresponding path program 1 times [2019-10-02 14:56:41,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:41,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:41,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:41,933 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2019-10-02 14:56:41,951 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 14:56:41,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:41,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:56:41,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:56:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:56:41,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:56:41,953 INFO L87 Difference]: Start difference. First operand 3116 states and 4340 transitions. Second operand 8 states. [2019-10-02 14:56:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:43,954 INFO L93 Difference]: Finished difference Result 8302 states and 11738 transitions. [2019-10-02 14:56:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:43,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-02 14:56:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:43,961 INFO L225 Difference]: With dead ends: 8302 [2019-10-02 14:56:43,961 INFO L226 Difference]: Without dead ends: 5843 [2019-10-02 14:56:43,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:56:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5843 states. [2019-10-02 14:56:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5843 to 3116. [2019-10-02 14:56:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2019-10-02 14:56:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4335 transitions. [2019-10-02 14:56:44,531 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4335 transitions. Word has length 58 [2019-10-02 14:56:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:44,532 INFO L475 AbstractCegarLoop]: Abstraction has 3116 states and 4335 transitions. [2019-10-02 14:56:44,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:56:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4335 transitions. [2019-10-02 14:56:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:44,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:44,533 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 14:56:44,533 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2054142204, now seen corresponding path program 1 times [2019-10-02 14:56:44,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:44,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:44,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:44,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:44,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:44,680 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 14:56:44,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:44,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:44,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:44,684 INFO L87 Difference]: Start difference. First operand 3116 states and 4335 transitions. Second operand 9 states. [2019-10-02 14:56:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:48,822 INFO L93 Difference]: Finished difference Result 12163 states and 17386 transitions. [2019-10-02 14:56:48,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:56:48,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 14:56:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:48,831 INFO L225 Difference]: With dead ends: 12163 [2019-10-02 14:56:48,831 INFO L226 Difference]: Without dead ends: 9971 [2019-10-02 14:56:48,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:56:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9971 states. [2019-10-02 14:56:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9971 to 3082. [2019-10-02 14:56:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-10-02 14:56:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4289 transitions. [2019-10-02 14:56:49,445 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4289 transitions. Word has length 58 [2019-10-02 14:56:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:49,446 INFO L475 AbstractCegarLoop]: Abstraction has 3082 states and 4289 transitions. [2019-10-02 14:56:49,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4289 transitions. [2019-10-02 14:56:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:49,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:49,447 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 14:56:49,448 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1186764508, now seen corresponding path program 1 times [2019-10-02 14:56:49,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:49,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:49,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:49,600 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 14:56:49,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:49,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:49,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:49,602 INFO L87 Difference]: Start difference. First operand 3082 states and 4289 transitions. Second operand 9 states. [2019-10-02 14:56:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:52,370 INFO L93 Difference]: Finished difference Result 6849 states and 9733 transitions. [2019-10-02 14:56:52,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:56:52,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 14:56:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:52,377 INFO L225 Difference]: With dead ends: 6849 [2019-10-02 14:56:52,377 INFO L226 Difference]: Without dead ends: 6844 [2019-10-02 14:56:52,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:56:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6844 states. [2019-10-02 14:56:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6844 to 3082. [2019-10-02 14:56:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-10-02 14:56:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4287 transitions. [2019-10-02 14:56:52,977 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4287 transitions. Word has length 58 [2019-10-02 14:56:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:52,978 INFO L475 AbstractCegarLoop]: Abstraction has 3082 states and 4287 transitions. [2019-10-02 14:56:52,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4287 transitions. [2019-10-02 14:56:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:52,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:52,980 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 14:56:52,980 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1308864492, now seen corresponding path program 1 times [2019-10-02 14:56:52,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:52,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:52,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:53,043 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 14:56:53,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:53,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:53,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:53,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:53,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:53,045 INFO L87 Difference]: Start difference. First operand 3082 states and 4287 transitions. Second operand 3 states. [2019-10-02 14:56:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:53,809 INFO L93 Difference]: Finished difference Result 4216 states and 5859 transitions. [2019-10-02 14:56:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:53,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:53,814 INFO L225 Difference]: With dead ends: 4216 [2019-10-02 14:56:53,814 INFO L226 Difference]: Without dead ends: 2977 [2019-10-02 14:56:53,816 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 14:56:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2019-10-02 14:56:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2975. [2019-10-02 14:56:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-10-02 14:56:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4065 transitions. [2019-10-02 14:56:54,394 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4065 transitions. Word has length 59 [2019-10-02 14:56:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:54,394 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 4065 transitions. [2019-10-02 14:56:54,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4065 transitions. [2019-10-02 14:56:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:54,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:54,395 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 14:56:54,396 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:54,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1476766260, now seen corresponding path program 1 times [2019-10-02 14:56:54,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:54,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:54,446 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 14:56:54,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:54,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:54,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:54,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:54,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:54,448 INFO L87 Difference]: Start difference. First operand 2975 states and 4065 transitions. Second operand 3 states. [2019-10-02 14:56:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:55,120 INFO L93 Difference]: Finished difference Result 4274 states and 5871 transitions. [2019-10-02 14:56:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:55,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:55,123 INFO L225 Difference]: With dead ends: 4274 [2019-10-02 14:56:55,124 INFO L226 Difference]: Without dead ends: 2982 [2019-10-02 14:56:55,125 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 14:56:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2019-10-02 14:56:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2975. [2019-10-02 14:56:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-10-02 14:56:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4012 transitions. [2019-10-02 14:56:55,713 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4012 transitions. Word has length 59 [2019-10-02 14:56:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:55,713 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 4012 transitions. [2019-10-02 14:56:55,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4012 transitions. [2019-10-02 14:56:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:55,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:55,715 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 14:56:55,715 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:55,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1586522956, now seen corresponding path program 1 times [2019-10-02 14:56:55,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:55,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:55,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:55,764 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 14:56:55,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:55,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:55,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:55,766 INFO L87 Difference]: Start difference. First operand 2975 states and 4012 transitions. Second operand 3 states. [2019-10-02 14:56:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:56,382 INFO L93 Difference]: Finished difference Result 4327 states and 5861 transitions. [2019-10-02 14:56:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:56,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:56,386 INFO L225 Difference]: With dead ends: 4327 [2019-10-02 14:56:56,387 INFO L226 Difference]: Without dead ends: 2981 [2019-10-02 14:56:56,390 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 14:56:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-10-02 14:56:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2975. [2019-10-02 14:56:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-10-02 14:56:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3966 transitions. [2019-10-02 14:56:56,974 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3966 transitions. Word has length 59 [2019-10-02 14:56:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:56,975 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 3966 transitions. [2019-10-02 14:56:56,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3966 transitions. [2019-10-02 14:56:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:56:56,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:56,976 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 14:56:56,977 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash -265313719, now seen corresponding path program 1 times [2019-10-02 14:56:56,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:56,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:56,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:56,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:56,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:57,028 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 14:56:57,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:57,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:57,030 INFO L87 Difference]: Start difference. First operand 2975 states and 3966 transitions. Second operand 3 states. [2019-10-02 14:56:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:58,062 INFO L93 Difference]: Finished difference Result 5653 states and 7644 transitions. [2019-10-02 14:56:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:58,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-02 14:56:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:58,066 INFO L225 Difference]: With dead ends: 5653 [2019-10-02 14:56:58,066 INFO L226 Difference]: Without dead ends: 4054 [2019-10-02 14:56:58,068 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 14:56:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2019-10-02 14:56:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 2914. [2019-10-02 14:56:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2019-10-02 14:56:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3884 transitions. [2019-10-02 14:56:58,710 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3884 transitions. Word has length 61 [2019-10-02 14:56:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:58,711 INFO L475 AbstractCegarLoop]: Abstraction has 2914 states and 3884 transitions. [2019-10-02 14:56:58,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3884 transitions. [2019-10-02 14:56:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:56:58,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:58,712 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 14:56:58,713 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1719899601, now seen corresponding path program 1 times [2019-10-02 14:56:58,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:58,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:58,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:58,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:58,759 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 14:56:58,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:58,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:58,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:58,760 INFO L87 Difference]: Start difference. First operand 2914 states and 3884 transitions. Second operand 3 states. [2019-10-02 14:56:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:59,773 INFO L93 Difference]: Finished difference Result 5521 states and 7465 transitions. [2019-10-02 14:56:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:59,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-02 14:56:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:59,779 INFO L225 Difference]: With dead ends: 5521 [2019-10-02 14:56:59,779 INFO L226 Difference]: Without dead ends: 3969 [2019-10-02 14:56:59,781 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 14:56:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3969 states. [2019-10-02 14:57:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3969 to 2827. [2019-10-02 14:57:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2019-10-02 14:57:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3772 transitions. [2019-10-02 14:57:00,524 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3772 transitions. Word has length 61 [2019-10-02 14:57:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:00,524 INFO L475 AbstractCegarLoop]: Abstraction has 2827 states and 3772 transitions. [2019-10-02 14:57:00,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3772 transitions. [2019-10-02 14:57:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:57:00,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:00,525 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 14:57:00,526 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1413402124, now seen corresponding path program 1 times [2019-10-02 14:57:00,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:01,057 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 14:57:01,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:01,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:57:01,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:57:01,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:57:01,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:57:01,059 INFO L87 Difference]: Start difference. First operand 2827 states and 3772 transitions. Second operand 19 states. [2019-10-02 14:57:01,238 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-10-02 14:57:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:07,900 INFO L93 Difference]: Finished difference Result 7967 states and 10926 transitions. [2019-10-02 14:57:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:57:07,901 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-10-02 14:57:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:07,908 INFO L225 Difference]: With dead ends: 7967 [2019-10-02 14:57:07,908 INFO L226 Difference]: Without dead ends: 7963 [2019-10-02 14:57:07,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:57:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7963 states. [2019-10-02 14:57:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7963 to 2827. [2019-10-02 14:57:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2019-10-02 14:57:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3771 transitions. [2019-10-02 14:57:08,664 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3771 transitions. Word has length 61 [2019-10-02 14:57:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:08,664 INFO L475 AbstractCegarLoop]: Abstraction has 2827 states and 3771 transitions. [2019-10-02 14:57:08,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:57:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3771 transitions. [2019-10-02 14:57:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:57:08,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:08,665 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 14:57:08,666 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2105491488, now seen corresponding path program 1 times [2019-10-02 14:57:08,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:08,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:08,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:10,061 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 14:57:10,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-02 14:57:10,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:57:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:57:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:57:10,062 INFO L87 Difference]: Start difference. First operand 2827 states and 3771 transitions. Second operand 21 states. [2019-10-02 14:57:10,237 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-10-02 14:57:10,693 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-10-02 14:57:10,850 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-02 14:57:11,031 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-10-02 14:57:11,243 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-02 14:57:11,475 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-10-02 14:57:11,779 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-10-02 14:57:12,211 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-10-02 14:57:12,528 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-10-02 14:57:12,865 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-10-02 14:57:13,221 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-10-02 14:57:13,502 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-10-02 14:57:13,817 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-02 14:57:14,027 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-10-02 14:57:14,385 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-10-02 14:57:14,635 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-10-02 14:57:15,027 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-02 14:57:15,227 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-02 14:57:15,869 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-10-02 14:57:18,648 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-02 14:57:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:19,960 INFO L93 Difference]: Finished difference Result 7988 states and 10916 transitions. [2019-10-02 14:57:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 14:57:19,961 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2019-10-02 14:57:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:19,969 INFO L225 Difference]: With dead ends: 7988 [2019-10-02 14:57:19,969 INFO L226 Difference]: Without dead ends: 7801 [2019-10-02 14:57:19,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=433, Invalid=1459, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:57:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7801 states. [2019-10-02 14:57:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7801 to 2826. [2019-10-02 14:57:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-10-02 14:57:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3769 transitions. [2019-10-02 14:57:20,927 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3769 transitions. Word has length 61 [2019-10-02 14:57:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:20,927 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 3769 transitions. [2019-10-02 14:57:20,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:57:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3769 transitions. [2019-10-02 14:57:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:57:20,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:20,929 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 14:57:20,929 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1745115225, now seen corresponding path program 1 times [2019-10-02 14:57:20,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:20,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:20,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:20,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:20,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:21,523 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 14:57:21,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:21,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:57:21,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:57:21,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:57:21,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:57:21,524 INFO L87 Difference]: Start difference. First operand 2826 states and 3769 transitions. Second operand 19 states. [2019-10-02 14:57:21,756 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-02 14:57:22,514 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 14:57:22,736 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 14:57:23,003 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 14:57:23,184 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 14:57:23,569 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-02 14:57:24,240 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-02 14:57:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:28,073 INFO L93 Difference]: Finished difference Result 7150 states and 9774 transitions. [2019-10-02 14:57:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:57:28,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-10-02 14:57:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:28,078 INFO L225 Difference]: With dead ends: 7150 [2019-10-02 14:57:28,079 INFO L226 Difference]: Without dead ends: 7144 [2019-10-02 14:57:28,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:57:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7144 states. [2019-10-02 14:57:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7144 to 2826. [2019-10-02 14:57:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-10-02 14:57:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3768 transitions. [2019-10-02 14:57:28,957 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3768 transitions. Word has length 61 [2019-10-02 14:57:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:28,957 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 3768 transitions. [2019-10-02 14:57:28,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:57:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3768 transitions. [2019-10-02 14:57:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:57:28,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:28,960 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 14:57:28,960 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 275049524, now seen corresponding path program 1 times [2019-10-02 14:57:28,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:28,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:28,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:29,497 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 14:57:29,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:57:29,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:57:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:57:29,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:57:29,498 INFO L87 Difference]: Start difference. First operand 2826 states and 3768 transitions. Second operand 19 states. [2019-10-02 14:57:29,686 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-02 14:57:30,617 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-10-02 14:57:30,876 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 14:57:31,041 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 14:57:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:38,051 INFO L93 Difference]: Finished difference Result 9068 states and 12469 transitions. [2019-10-02 14:57:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:57:38,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-10-02 14:57:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:38,060 INFO L225 Difference]: With dead ends: 9068 [2019-10-02 14:57:38,060 INFO L226 Difference]: Without dead ends: 9064 [2019-10-02 14:57:38,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:57:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-10-02 14:57:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 2838. [2019-10-02 14:57:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2019-10-02 14:57:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3785 transitions. [2019-10-02 14:57:38,989 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3785 transitions. Word has length 61 [2019-10-02 14:57:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:38,989 INFO L475 AbstractCegarLoop]: Abstraction has 2838 states and 3785 transitions. [2019-10-02 14:57:38,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:57:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3785 transitions. [2019-10-02 14:57:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 14:57:38,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:38,991 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] [2019-10-02 14:57:38,991 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash -776287236, now seen corresponding path program 1 times [2019-10-02 14:57:38,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:38,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:38,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:38,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:38,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:39,465 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 14:57:39,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:39,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 14:57:39,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:57:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:57:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:57:39,467 INFO L87 Difference]: Start difference. First operand 2838 states and 3785 transitions. Second operand 14 states. [2019-10-02 14:57:40,168 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-10-02 14:57:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:45,030 INFO L93 Difference]: Finished difference Result 9336 states and 12765 transitions. [2019-10-02 14:57:45,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:57:45,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-10-02 14:57:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:45,041 INFO L225 Difference]: With dead ends: 9336 [2019-10-02 14:57:45,041 INFO L226 Difference]: Without dead ends: 8796 [2019-10-02 14:57:45,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:57:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8796 states. [2019-10-02 14:57:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8796 to 2796. [2019-10-02 14:57:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2019-10-02 14:57:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3733 transitions. [2019-10-02 14:57:46,054 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3733 transitions. Word has length 62 [2019-10-02 14:57:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:46,054 INFO L475 AbstractCegarLoop]: Abstraction has 2796 states and 3733 transitions. [2019-10-02 14:57:46,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:57:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3733 transitions. [2019-10-02 14:57:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 14:57:46,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:46,056 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] [2019-10-02 14:57:46,056 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:46,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1749575388, now seen corresponding path program 1 times [2019-10-02 14:57:46,056 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:46,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:46,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:46,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:46,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:46,400 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 14:57:46,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:46,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 14:57:46,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:57:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:57:46,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:57:46,403 INFO L87 Difference]: Start difference. First operand 2796 states and 3733 transitions. Second operand 12 states. [2019-10-02 14:57:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:50,629 INFO L93 Difference]: Finished difference Result 6318 states and 8601 transitions. [2019-10-02 14:57:50,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:57:50,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-10-02 14:57:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:50,636 INFO L225 Difference]: With dead ends: 6318 [2019-10-02 14:57:50,636 INFO L226 Difference]: Without dead ends: 6314 [2019-10-02 14:57:50,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:57:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-10-02 14:57:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 2792. [2019-10-02 14:57:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2019-10-02 14:57:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3729 transitions. [2019-10-02 14:57:51,613 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3729 transitions. Word has length 62 [2019-10-02 14:57:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:51,613 INFO L475 AbstractCegarLoop]: Abstraction has 2792 states and 3729 transitions. [2019-10-02 14:57:51,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:57:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3729 transitions. [2019-10-02 14:57:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 14:57:51,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:51,614 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] [2019-10-02 14:57:51,615 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash -680476714, now seen corresponding path program 1 times [2019-10-02 14:57:51,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:51,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:51,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:51,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:51,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:52,223 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 14:57:52,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:52,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 14:57:52,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:57:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:57:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:57:52,224 INFO L87 Difference]: Start difference. First operand 2792 states and 3729 transitions. Second operand 15 states. [2019-10-02 14:57:52,389 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-02 14:57:52,870 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-10-02 14:57:53,057 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-10-02 14:57:53,313 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-10-02 14:57:53,602 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-02 14:57:53,901 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-02 14:57:54,260 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-02 14:57:54,514 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 14:57:54,793 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-02 14:57:54,995 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-02 14:57:55,163 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 14:57:55,348 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-02 14:58:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:00,066 INFO L93 Difference]: Finished difference Result 9558 states and 13170 transitions. [2019-10-02 14:58:00,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:58:00,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-10-02 14:58:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:00,075 INFO L225 Difference]: With dead ends: 9558 [2019-10-02 14:58:00,075 INFO L226 Difference]: Without dead ends: 9547 [2019-10-02 14:58:00,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=250, Invalid=680, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:58:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2019-10-02 14:58:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 2781. [2019-10-02 14:58:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. [2019-10-02 14:58:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3718 transitions. [2019-10-02 14:58:01,174 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3718 transitions. Word has length 62 [2019-10-02 14:58:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:01,174 INFO L475 AbstractCegarLoop]: Abstraction has 2781 states and 3718 transitions. [2019-10-02 14:58:01,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:58:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3718 transitions. [2019-10-02 14:58:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 14:58:01,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:01,177 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 14:58:01,177 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:01,177 INFO L82 PathProgramCache]: Analyzing trace with hash -84431005, now seen corresponding path program 1 times [2019-10-02 14:58:01,177 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:01,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:01,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:01,258 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 14:58:01,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:01,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:58:01,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:58:01,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:58:01,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:58:01,259 INFO L87 Difference]: Start difference. First operand 2781 states and 3718 transitions. Second operand 6 states. [2019-10-02 14:58:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:05,334 INFO L93 Difference]: Finished difference Result 11380 states and 15640 transitions. [2019-10-02 14:58:05,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:58:05,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-02 14:58:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:05,343 INFO L225 Difference]: With dead ends: 11380 [2019-10-02 14:58:05,343 INFO L226 Difference]: Without dead ends: 9398 [2019-10-02 14:58:05,347 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 14:58:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9398 states. [2019-10-02 14:58:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9398 to 7230. [2019-10-02 14:58:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-10-02 14:58:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 9689 transitions. [2019-10-02 14:58:08,325 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 9689 transitions. Word has length 70 [2019-10-02 14:58:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:08,325 INFO L475 AbstractCegarLoop]: Abstraction has 7230 states and 9689 transitions. [2019-10-02 14:58:08,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:58:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 9689 transitions. [2019-10-02 14:58:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 14:58:08,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:08,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 14:58:08,330 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash -500118635, now seen corresponding path program 1 times [2019-10-02 14:58:08,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:08,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:08,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:08,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:08,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:08,422 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 14:58:08,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:08,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:08,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:08,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:08,423 INFO L87 Difference]: Start difference. First operand 7230 states and 9689 transitions. Second operand 5 states. [2019-10-02 14:58:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:11,968 INFO L93 Difference]: Finished difference Result 7236 states and 9692 transitions. [2019-10-02 14:58:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:58:11,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-02 14:58:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:11,975 INFO L225 Difference]: With dead ends: 7236 [2019-10-02 14:58:11,975 INFO L226 Difference]: Without dead ends: 6852 [2019-10-02 14:58:11,977 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2019-10-02 14:58:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6848. [2019-10-02 14:58:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6848 states. [2019-10-02 14:58:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 9198 transitions. [2019-10-02 14:58:14,804 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 9198 transitions. Word has length 71 [2019-10-02 14:58:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:14,804 INFO L475 AbstractCegarLoop]: Abstraction has 6848 states and 9198 transitions. [2019-10-02 14:58:14,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:58:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 9198 transitions. [2019-10-02 14:58:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 14:58:14,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:14,808 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 14:58:14,808 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash -49263162, now seen corresponding path program 1 times [2019-10-02 14:58:14,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:14,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:14,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:14,886 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 14:58:14,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:14,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:58:14,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:58:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:58:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:58:14,887 INFO L87 Difference]: Start difference. First operand 6848 states and 9198 transitions. Second operand 6 states. [2019-10-02 14:58:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:20,802 INFO L93 Difference]: Finished difference Result 12577 states and 16837 transitions. [2019-10-02 14:58:20,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:58:20,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-02 14:58:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:20,814 INFO L225 Difference]: With dead ends: 12577 [2019-10-02 14:58:20,814 INFO L226 Difference]: Without dead ends: 12575 [2019-10-02 14:58:20,817 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 14:58:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-10-02 14:58:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 7013. [2019-10-02 14:58:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7013 states. [2019-10-02 14:58:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7013 states to 7013 states and 9308 transitions. [2019-10-02 14:58:23,846 INFO L78 Accepts]: Start accepts. Automaton has 7013 states and 9308 transitions. Word has length 72 [2019-10-02 14:58:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:23,846 INFO L475 AbstractCegarLoop]: Abstraction has 7013 states and 9308 transitions. [2019-10-02 14:58:23,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:58:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 7013 states and 9308 transitions. [2019-10-02 14:58:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 14:58:23,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:23,850 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] [2019-10-02 14:58:23,850 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:23,851 INFO L82 PathProgramCache]: Analyzing trace with hash 426026635, now seen corresponding path program 1 times [2019-10-02 14:58:23,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:23,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:23,900 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 14:58:23,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:23,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:23,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:23,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:23,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:23,902 INFO L87 Difference]: Start difference. First operand 7013 states and 9308 transitions. Second operand 3 states. [2019-10-02 14:58:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:29,560 INFO L93 Difference]: Finished difference Result 18658 states and 24844 transitions. [2019-10-02 14:58:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:29,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 14:58:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:29,571 INFO L225 Difference]: With dead ends: 18658 [2019-10-02 14:58:29,571 INFO L226 Difference]: Without dead ends: 12565 [2019-10-02 14:58:29,578 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 14:58:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12565 states. [2019-10-02 14:58:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 11777. [2019-10-02 14:58:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11777 states. [2019-10-02 14:58:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11777 states to 11777 states and 15557 transitions. [2019-10-02 14:58:34,779 INFO L78 Accepts]: Start accepts. Automaton has 11777 states and 15557 transitions. Word has length 73 [2019-10-02 14:58:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:34,779 INFO L475 AbstractCegarLoop]: Abstraction has 11777 states and 15557 transitions. [2019-10-02 14:58:34,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11777 states and 15557 transitions. [2019-10-02 14:58:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 14:58:34,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:34,782 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] [2019-10-02 14:58:34,782 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash 876625665, now seen corresponding path program 1 times [2019-10-02 14:58:34,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:34,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:34,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:34,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:34,829 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 14:58:34,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:34,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:34,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:34,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:34,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:34,831 INFO L87 Difference]: Start difference. First operand 11777 states and 15557 transitions. Second operand 3 states. [2019-10-02 14:58:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:45,021 INFO L93 Difference]: Finished difference Result 32277 states and 42545 transitions. [2019-10-02 14:58:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:45,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-02 14:58:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:45,043 INFO L225 Difference]: With dead ends: 32277 [2019-10-02 14:58:45,043 INFO L226 Difference]: Without dead ends: 21194 [2019-10-02 14:58:45,055 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 14:58:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21194 states. [2019-10-02 14:58:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21194 to 19852. [2019-10-02 14:58:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19852 states. [2019-10-02 14:58:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19852 states to 19852 states and 25940 transitions. [2019-10-02 14:58:54,421 INFO L78 Accepts]: Start accepts. Automaton has 19852 states and 25940 transitions. Word has length 75 [2019-10-02 14:58:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:54,422 INFO L475 AbstractCegarLoop]: Abstraction has 19852 states and 25940 transitions. [2019-10-02 14:58:54,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 19852 states and 25940 transitions. [2019-10-02 14:58:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 14:58:54,425 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:54,425 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] [2019-10-02 14:58:54,425 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2001090544, now seen corresponding path program 1 times [2019-10-02 14:58:54,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:54,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:54,472 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 14:58:54,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:54,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:54,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:54,474 INFO L87 Difference]: Start difference. First operand 19852 states and 25940 transitions. Second operand 3 states. [2019-10-02 14:59:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:08,340 INFO L93 Difference]: Finished difference Result 47940 states and 62564 transitions. [2019-10-02 14:59:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:59:08,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-02 14:59:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:08,370 INFO L225 Difference]: With dead ends: 47940 [2019-10-02 14:59:08,370 INFO L226 Difference]: Without dead ends: 28818 [2019-10-02 14:59:08,390 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 14:59:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28818 states. [2019-10-02 14:59:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28818 to 28816. [2019-10-02 14:59:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28816 states. [2019-10-02 14:59:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28816 states to 28816 states and 37212 transitions. [2019-10-02 14:59:22,858 INFO L78 Accepts]: Start accepts. Automaton has 28816 states and 37212 transitions. Word has length 75 [2019-10-02 14:59:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:22,858 INFO L475 AbstractCegarLoop]: Abstraction has 28816 states and 37212 transitions. [2019-10-02 14:59:22,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:59:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 28816 states and 37212 transitions. [2019-10-02 14:59:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 14:59:22,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:22,861 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] [2019-10-02 14:59:22,862 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:22,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash -346957096, now seen corresponding path program 1 times [2019-10-02 14:59:22,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:22,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:22,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:22,920 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 14:59:22,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:22,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:59:22,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:59:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:59:22,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:59:22,921 INFO L87 Difference]: Start difference. First operand 28816 states and 37212 transitions. Second operand 5 states. [2019-10-02 14:59:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:49,514 INFO L93 Difference]: Finished difference Result 79018 states and 101171 transitions. [2019-10-02 14:59:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:59:49,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-02 14:59:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:49,568 INFO L225 Difference]: With dead ends: 79018 [2019-10-02 14:59:49,568 INFO L226 Difference]: Without dead ends: 50932 [2019-10-02 14:59:49,608 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 14:59:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50932 states. [2019-10-02 15:00:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50932 to 32108. [2019-10-02 15:00:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32108 states. [2019-10-02 15:00:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32108 states to 32108 states and 40978 transitions. [2019-10-02 15:00:04,833 INFO L78 Accepts]: Start accepts. Automaton has 32108 states and 40978 transitions. Word has length 83 [2019-10-02 15:00:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:04,834 INFO L475 AbstractCegarLoop]: Abstraction has 32108 states and 40978 transitions. [2019-10-02 15:00:04,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:00:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32108 states and 40978 transitions. [2019-10-02 15:00:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 15:00:04,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:04,841 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:04,841 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash -889111919, now seen corresponding path program 1 times [2019-10-02 15:00:04,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:04,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:04,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:04,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:04,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:00:04,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:04,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:04,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:04,902 INFO L87 Difference]: Start difference. First operand 32108 states and 40978 transitions. Second operand 3 states. [2019-10-02 15:00:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:34,311 INFO L93 Difference]: Finished difference Result 91206 states and 115972 transitions. [2019-10-02 15:00:34,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:34,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-02 15:00:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:34,377 INFO L225 Difference]: With dead ends: 91206 [2019-10-02 15:00:34,377 INFO L226 Difference]: Without dead ends: 59828 [2019-10-02 15:00:34,413 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:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59828 states. [2019-10-02 15:01:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59828 to 52086. [2019-10-02 15:01:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52086 states. [2019-10-02 15:01:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52086 states to 52086 states and 65434 transitions. [2019-10-02 15:01:00,766 INFO L78 Accepts]: Start accepts. Automaton has 52086 states and 65434 transitions. Word has length 94 [2019-10-02 15:01:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:00,766 INFO L475 AbstractCegarLoop]: Abstraction has 52086 states and 65434 transitions. [2019-10-02 15:01:00,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 52086 states and 65434 transitions. [2019-10-02 15:01:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 15:01:00,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:00,774 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:00,774 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1074943154, now seen corresponding path program 1 times [2019-10-02 15:01:00,774 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:00,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:00,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:00,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:01:00,874 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:01:00,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:01,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 15:01:01,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:01:01,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:01:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:01,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:01:01,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-10-02 15:01:01,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 15:01:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 15:01:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 15:01:01,576 INFO L87 Difference]: Start difference. First operand 52086 states and 65434 transitions. Second operand 13 states. [2019-10-02 15:02:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:04,675 INFO L93 Difference]: Finished difference Result 168502 states and 211656 transitions. [2019-10-02 15:02:04,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 15:02:04,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-10-02 15:02:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:05,029 INFO L225 Difference]: With dead ends: 168502 [2019-10-02 15:02:05,029 INFO L226 Difference]: Without dead ends: 117146 [2019-10-02 15:02:05,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1159, Invalid=4243, Unknown=0, NotChecked=0, Total=5402 [2019-10-02 15:02:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117146 states. [2019-10-02 15:02:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117146 to 98194. [2019-10-02 15:02:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98194 states. [2019-10-02 15:02:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98194 states to 98194 states and 123092 transitions. [2019-10-02 15:02:54,131 INFO L78 Accepts]: Start accepts. Automaton has 98194 states and 123092 transitions. Word has length 96 [2019-10-02 15:02:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:54,132 INFO L475 AbstractCegarLoop]: Abstraction has 98194 states and 123092 transitions. [2019-10-02 15:02:54,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 15:02:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98194 states and 123092 transitions. [2019-10-02 15:02:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 15:02:54,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:54,150 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, 1, 1, 1, 1, 1] [2019-10-02 15:02:54,150 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash -495075643, now seen corresponding path program 1 times [2019-10-02 15:02:54,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:54,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:54,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:54,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:54,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:54,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:02:54,231 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:02:54,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:54,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 15:02:54,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:02:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 15:02:54,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:02:54,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-10-02 15:02:54,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:02:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:02:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:02:54,606 INFO L87 Difference]: Start difference. First operand 98194 states and 123092 transitions. Second operand 10 states. [2019-10-02 15:03:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:51,937 INFO L93 Difference]: Finished difference Result 201789 states and 252490 transitions. [2019-10-02 15:03:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 15:03:51,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-10-02 15:03:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:52,100 INFO L225 Difference]: With dead ends: 201789 [2019-10-02 15:03:52,101 INFO L226 Difference]: Without dead ends: 104227 [2019-10-02 15:03:52,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-02 15:03:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104227 states. [2019-10-02 15:04:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104227 to 74943. [2019-10-02 15:04:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74943 states. [2019-10-02 15:04:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74943 states to 74943 states and 92254 transitions. [2019-10-02 15:04:33,564 INFO L78 Accepts]: Start accepts. Automaton has 74943 states and 92254 transitions. Word has length 98 [2019-10-02 15:04:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:33,565 INFO L475 AbstractCegarLoop]: Abstraction has 74943 states and 92254 transitions. [2019-10-02 15:04:33,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 15:04:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 74943 states and 92254 transitions. [2019-10-02 15:04:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 15:04:33,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:33,575 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, 1, 1, 1, 1, 1, 1] [2019-10-02 15:04:33,575 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1609353407, now seen corresponding path program 1 times [2019-10-02 15:04:33,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:33,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:33,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:04:33,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:33,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:04:33,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:04:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:04:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:04:33,660 INFO L87 Difference]: Start difference. First operand 74943 states and 92254 transitions. Second operand 5 states. [2019-10-02 15:05:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:27,037 INFO L93 Difference]: Finished difference Result 168967 states and 207452 transitions. [2019-10-02 15:05:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:05:27,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-02 15:05:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:27,160 INFO L225 Difference]: With dead ends: 168967 [2019-10-02 15:05:27,160 INFO L226 Difference]: Without dead ends: 94733 [2019-10-02 15:05:27,210 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:05:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94733 states. [2019-10-02 15:06:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94733 to 72649. [2019-10-02 15:06:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72649 states. [2019-10-02 15:06:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72649 states to 72649 states and 87955 transitions. [2019-10-02 15:06:05,385 INFO L78 Accepts]: Start accepts. Automaton has 72649 states and 87955 transitions. Word has length 99 [2019-10-02 15:06:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:05,386 INFO L475 AbstractCegarLoop]: Abstraction has 72649 states and 87955 transitions. [2019-10-02 15:06:05,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:06:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 72649 states and 87955 transitions. [2019-10-02 15:06:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 15:06:05,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:05,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:06:05,396 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 948248736, now seen corresponding path program 1 times [2019-10-02 15:06:05,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:05,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:05,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:05,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:05,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 15:06:05,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:05,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:06:05,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:06:05,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:06:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:06:05,484 INFO L87 Difference]: Start difference. First operand 72649 states and 87955 transitions. Second operand 5 states. [2019-10-02 15:07:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:07:16,343 INFO L93 Difference]: Finished difference Result 162986 states and 196028 transitions. [2019-10-02 15:07:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:07:16,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-02 15:07:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:07:16,486 INFO L225 Difference]: With dead ends: 162986 [2019-10-02 15:07:16,486 INFO L226 Difference]: Without dead ends: 129600 [2019-10-02 15:07:16,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:07:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129600 states. [2019-10-02 15:07:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129600 to 72513. [2019-10-02 15:07:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72513 states. [2019-10-02 15:07:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72513 states to 72513 states and 87805 transitions. [2019-10-02 15:07:55,434 INFO L78 Accepts]: Start accepts. Automaton has 72513 states and 87805 transitions. Word has length 103 [2019-10-02 15:07:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:55,434 INFO L475 AbstractCegarLoop]: Abstraction has 72513 states and 87805 transitions. [2019-10-02 15:07:55,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:07:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 72513 states and 87805 transitions. [2019-10-02 15:07:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 15:07:55,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:55,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:55,440 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:55,441 INFO L82 PathProgramCache]: Analyzing trace with hash 371429046, now seen corresponding path program 1 times [2019-10-02 15:07:55,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:55,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:55,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:55,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:55,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 15:07:55,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:07:55,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:07:55,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:07:55,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:07:55,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:07:55,518 INFO L87 Difference]: Start difference. First operand 72513 states and 87805 transitions. Second operand 5 states. [2019-10-02 15:08:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:55,664 INFO L93 Difference]: Finished difference Result 134340 states and 163008 transitions. [2019-10-02 15:08:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:08:55,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-02 15:08:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:55,784 INFO L225 Difference]: With dead ends: 134340 [2019-10-02 15:08:55,785 INFO L226 Difference]: Without dead ends: 110480 [2019-10-02 15:08:55,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:08:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110480 states.