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.6.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:31:38,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:31:38,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:31:38,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:31:38,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:31:38,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:31:38,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:31:38,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:31:38,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:31:38,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:31:38,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:31:38,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:31:38,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:31:38,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:31:38,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:31:38,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:31:38,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:31:38,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:31:38,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:31:38,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:31:38,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:31:38,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:31:38,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:31:38,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:31:38,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:31:38,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:31:38,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:31:38,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:31:38,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:31:38,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:31:38,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:31:38,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:31:38,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:31:38,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:31:38,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:31:38,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:31:38,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:31:38,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:31:38,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:31:38,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:31:38,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:31:38,049 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-09-08 12:31:38,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:31:38,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:31:38,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:31:38,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:31:38,066 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:31:38,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:31:38,066 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:31:38,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:31:38,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:31:38,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:31:38,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:31:38,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:31:38,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:31:38,067 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:31:38,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:31:38,068 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:31:38,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:31:38,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:31:38,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:31:38,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:31:38,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:31:38,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:31:38,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:31:38,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:31:38,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:31:38,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:31:38,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:31:38,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:31:38,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:31:38,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:31:38,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:31:38,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:31:38,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:31:38,123 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:31:38,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:31:38,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735c07131/65a0ea9c62624f188d987905fa5a292a/FLAG783b2a6ec [2019-09-08 12:31:38,738 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:31:38,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:31:38,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735c07131/65a0ea9c62624f188d987905fa5a292a/FLAG783b2a6ec [2019-09-08 12:31:39,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735c07131/65a0ea9c62624f188d987905fa5a292a [2019-09-08 12:31:39,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:31:39,047 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:31:39,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:31:39,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:31:39,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:31:39,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e70c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39, skipping insertion in model container [2019-09-08 12:31:39,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,062 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:31:39,107 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:31:39,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:31:39,582 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:31:39,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:31:39,750 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:31:39,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39 WrapperNode [2019-09-08 12:31:39,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:31:39,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:31:39,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:31:39,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:31:39,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (1/1) ... [2019-09-08 12:31:39,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:31:39,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:31:39,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:31:39,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:31:39,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (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-09-08 12:31:39,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:31:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:31:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:31:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:31:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:31:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:31:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:31:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:31:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:31:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:31:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:31:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:31:39,933 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:31:39,933 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:31:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:31:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:31:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:31:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:31:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:31:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:31:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:31:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:31:40,857 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:31:40,857 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:31:40,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:31:40 BoogieIcfgContainer [2019-09-08 12:31:40,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:31:40,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:31:40,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:31:40,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:31:40,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:31:39" (1/3) ... [2019-09-08 12:31:40,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b805f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:31:40, skipping insertion in model container [2019-09-08 12:31:40,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:31:39" (2/3) ... [2019-09-08 12:31:40,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b805f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:31:40, skipping insertion in model container [2019-09-08 12:31:40,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:31:40" (3/3) ... [2019-09-08 12:31:40,867 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:31:40,878 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:31:40,886 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:31:40,904 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:31:40,938 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:31:40,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:31:40,939 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:31:40,939 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:31:40,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:31:40,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:31:40,940 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:31:40,940 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:31:40,941 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:31:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states. [2019-09-08 12:31:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:31:40,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:40,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:40,980 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:40,986 INFO L82 PathProgramCache]: Analyzing trace with hash -911853224, now seen corresponding path program 1 times [2019-09-08 12:31:40,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:40,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:41,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:41,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:41,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:41,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:41,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:41,608 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 3 states. [2019-09-08 12:31:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:41,758 INFO L93 Difference]: Finished difference Result 354 states and 585 transitions. [2019-09-08 12:31:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:41,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 12:31:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:41,775 INFO L225 Difference]: With dead ends: 354 [2019-09-08 12:31:41,776 INFO L226 Difference]: Without dead ends: 271 [2019-09-08 12:31:41,783 INFO L628 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-09-08 12:31:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-08 12:31:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2019-09-08 12:31:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:31:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 388 transitions. [2019-09-08 12:31:41,858 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 388 transitions. Word has length 94 [2019-09-08 12:31:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:41,859 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 388 transitions. [2019-09-08 12:31:41,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 388 transitions. [2019-09-08 12:31:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:31:41,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:41,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:41,864 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1894560043, now seen corresponding path program 1 times [2019-09-08 12:31:41,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:41,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:41,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:41,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:41,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:42,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:42,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:42,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:42,089 INFO L87 Difference]: Start difference. First operand 269 states and 388 transitions. Second operand 5 states. [2019-09-08 12:31:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:42,413 INFO L93 Difference]: Finished difference Result 488 states and 725 transitions. [2019-09-08 12:31:42,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:42,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 12:31:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:42,417 INFO L225 Difference]: With dead ends: 488 [2019-09-08 12:31:42,417 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 12:31:42,420 INFO L628 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-09-08 12:31:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 12:31:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-08 12:31:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:31:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 385 transitions. [2019-09-08 12:31:42,452 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 385 transitions. Word has length 96 [2019-09-08 12:31:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:42,453 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 385 transitions. [2019-09-08 12:31:42,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 385 transitions. [2019-09-08 12:31:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:42,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:42,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:42,458 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:42,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash -787666345, now seen corresponding path program 1 times [2019-09-08 12:31:42,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:42,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:42,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:42,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:42,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:42,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:42,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:42,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:42,752 INFO L87 Difference]: Start difference. First operand 269 states and 385 transitions. Second operand 5 states. [2019-09-08 12:31:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:43,043 INFO L93 Difference]: Finished difference Result 484 states and 715 transitions. [2019-09-08 12:31:43,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:43,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:31:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:43,050 INFO L225 Difference]: With dead ends: 484 [2019-09-08 12:31:43,050 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 12:31:43,056 INFO L628 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-09-08 12:31:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 12:31:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-08 12:31:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:31:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 382 transitions. [2019-09-08 12:31:43,110 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 382 transitions. Word has length 97 [2019-09-08 12:31:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:43,113 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 382 transitions. [2019-09-08 12:31:43,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 382 transitions. [2019-09-08 12:31:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:31:43,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:43,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:43,126 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash 263026140, now seen corresponding path program 1 times [2019-09-08 12:31:43,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:43,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:43,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:43,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:43,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:43,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:43,322 INFO L87 Difference]: Start difference. First operand 269 states and 382 transitions. Second operand 5 states. [2019-09-08 12:31:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:43,530 INFO L93 Difference]: Finished difference Result 476 states and 700 transitions. [2019-09-08 12:31:43,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:43,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 12:31:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:43,533 INFO L225 Difference]: With dead ends: 476 [2019-09-08 12:31:43,533 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 12:31:43,534 INFO L628 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-09-08 12:31:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 12:31:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-08 12:31:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:31:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2019-09-08 12:31:43,558 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 98 [2019-09-08 12:31:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:43,560 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2019-09-08 12:31:43,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2019-09-08 12:31:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:43,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:43,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:43,563 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash 699898071, now seen corresponding path program 1 times [2019-09-08 12:31:43,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:43,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:43,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:43,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:43,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:43,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:43,756 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 5 states. [2019-09-08 12:31:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:43,960 INFO L93 Difference]: Finished difference Result 472 states and 690 transitions. [2019-09-08 12:31:43,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:43,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 12:31:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:43,963 INFO L225 Difference]: With dead ends: 472 [2019-09-08 12:31:43,963 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 12:31:43,964 INFO L628 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-09-08 12:31:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 12:31:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-08 12:31:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:31:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 376 transitions. [2019-09-08 12:31:43,984 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 376 transitions. Word has length 99 [2019-09-08 12:31:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:43,985 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 376 transitions. [2019-09-08 12:31:43,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 376 transitions. [2019-09-08 12:31:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:31:43,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:43,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:43,987 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1306674069, now seen corresponding path program 1 times [2019-09-08 12:31:43,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:43,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:43,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:43,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:43,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:44,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:44,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:44,090 INFO L87 Difference]: Start difference. First operand 269 states and 376 transitions. Second operand 5 states. [2019-09-08 12:31:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:44,286 INFO L93 Difference]: Finished difference Result 480 states and 693 transitions. [2019-09-08 12:31:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:44,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:31:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:44,288 INFO L225 Difference]: With dead ends: 480 [2019-09-08 12:31:44,288 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 12:31:44,289 INFO L628 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-09-08 12:31:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 12:31:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-08 12:31:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:31:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 373 transitions. [2019-09-08 12:31:44,309 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 373 transitions. Word has length 100 [2019-09-08 12:31:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:44,310 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 373 transitions. [2019-09-08 12:31:44,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 373 transitions. [2019-09-08 12:31:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:31:44,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:44,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:44,312 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2126638581, now seen corresponding path program 1 times [2019-09-08 12:31:44,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:44,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:44,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:44,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:44,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:44,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:44,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:44,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:44,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:44,408 INFO L87 Difference]: Start difference. First operand 269 states and 373 transitions. Second operand 5 states. [2019-09-08 12:31:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:44,609 INFO L93 Difference]: Finished difference Result 468 states and 675 transitions. [2019-09-08 12:31:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:44,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 12:31:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:44,612 INFO L225 Difference]: With dead ends: 468 [2019-09-08 12:31:44,613 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 12:31:44,614 INFO L628 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-09-08 12:31:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 12:31:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-08 12:31:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:31:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 370 transitions. [2019-09-08 12:31:44,634 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 370 transitions. Word has length 101 [2019-09-08 12:31:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:44,635 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 370 transitions. [2019-09-08 12:31:44,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 370 transitions. [2019-09-08 12:31:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:44,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:44,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:44,637 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1373809086, now seen corresponding path program 1 times [2019-09-08 12:31:44,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:44,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:44,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:44,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:44,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:44,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:31:44,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:31:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:31:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:31:44,854 INFO L87 Difference]: Start difference. First operand 269 states and 370 transitions. Second operand 8 states. [2019-09-08 12:31:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:45,204 INFO L93 Difference]: Finished difference Result 1189 states and 1751 transitions. [2019-09-08 12:31:45,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:31:45,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 12:31:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:45,212 INFO L225 Difference]: With dead ends: 1189 [2019-09-08 12:31:45,212 INFO L226 Difference]: Without dead ends: 1053 [2019-09-08 12:31:45,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:31:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-08 12:31:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 338. [2019-09-08 12:31:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 12:31:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 475 transitions. [2019-09-08 12:31:45,260 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 475 transitions. Word has length 102 [2019-09-08 12:31:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:45,260 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 475 transitions. [2019-09-08 12:31:45,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:31:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 475 transitions. [2019-09-08 12:31:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:45,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:45,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:45,263 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:45,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2021773123, now seen corresponding path program 1 times [2019-09-08 12:31:45,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:45,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:45,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:45,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:45,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:45,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:45,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:31:45,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:31:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:31:45,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:31:45,486 INFO L87 Difference]: Start difference. First operand 338 states and 475 transitions. Second operand 8 states. [2019-09-08 12:31:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:45,873 INFO L93 Difference]: Finished difference Result 1264 states and 1866 transitions. [2019-09-08 12:31:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:31:45,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 12:31:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:45,880 INFO L225 Difference]: With dead ends: 1264 [2019-09-08 12:31:45,880 INFO L226 Difference]: Without dead ends: 1128 [2019-09-08 12:31:45,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:31:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-09-08 12:31:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 513. [2019-09-08 12:31:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-08 12:31:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 743 transitions. [2019-09-08 12:31:45,958 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 743 transitions. Word has length 102 [2019-09-08 12:31:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:45,958 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 743 transitions. [2019-09-08 12:31:45,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:31:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 743 transitions. [2019-09-08 12:31:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:45,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:45,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:45,960 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash -323435815, now seen corresponding path program 1 times [2019-09-08 12:31:45,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:45,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:45,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:46,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:46,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:46,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:46,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:46,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:46,102 INFO L87 Difference]: Start difference. First operand 513 states and 743 transitions. Second operand 5 states. [2019-09-08 12:31:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:46,292 INFO L93 Difference]: Finished difference Result 948 states and 1397 transitions. [2019-09-08 12:31:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:46,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 12:31:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:46,298 INFO L225 Difference]: With dead ends: 948 [2019-09-08 12:31:46,298 INFO L226 Difference]: Without dead ends: 812 [2019-09-08 12:31:46,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:31:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-09-08 12:31:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 726. [2019-09-08 12:31:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-08 12:31:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1067 transitions. [2019-09-08 12:31:46,409 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1067 transitions. Word has length 102 [2019-09-08 12:31:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:46,410 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1067 transitions. [2019-09-08 12:31:46,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1067 transitions. [2019-09-08 12:31:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:46,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:46,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:46,412 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash 602278735, now seen corresponding path program 1 times [2019-09-08 12:31:46,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:46,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:46,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:46,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:46,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:46,502 INFO L87 Difference]: Start difference. First operand 726 states and 1067 transitions. Second operand 3 states. [2019-09-08 12:31:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:46,634 INFO L93 Difference]: Finished difference Result 1347 states and 2007 transitions. [2019-09-08 12:31:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:46,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 12:31:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:46,640 INFO L225 Difference]: With dead ends: 1347 [2019-09-08 12:31:46,640 INFO L226 Difference]: Without dead ends: 797 [2019-09-08 12:31:46,643 INFO L628 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-09-08 12:31:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-08 12:31:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 795. [2019-09-08 12:31:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-08 12:31:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1164 transitions. [2019-09-08 12:31:46,727 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1164 transitions. Word has length 102 [2019-09-08 12:31:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:46,728 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1164 transitions. [2019-09-08 12:31:46,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1164 transitions. [2019-09-08 12:31:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:46,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:46,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:46,730 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash 359154384, now seen corresponding path program 1 times [2019-09-08 12:31:46,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:46,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:46,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:46,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:46,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:46,806 INFO L87 Difference]: Start difference. First operand 795 states and 1164 transitions. Second operand 3 states. [2019-09-08 12:31:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:47,087 INFO L93 Difference]: Finished difference Result 1977 states and 2931 transitions. [2019-09-08 12:31:47,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:47,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 12:31:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:47,097 INFO L225 Difference]: With dead ends: 1977 [2019-09-08 12:31:47,097 INFO L226 Difference]: Without dead ends: 1358 [2019-09-08 12:31:47,100 INFO L628 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-09-08 12:31:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-09-08 12:31:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1338. [2019-09-08 12:31:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-09-08 12:31:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1956 transitions. [2019-09-08 12:31:47,389 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1956 transitions. Word has length 102 [2019-09-08 12:31:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:47,389 INFO L475 AbstractCegarLoop]: Abstraction has 1338 states and 1956 transitions. [2019-09-08 12:31:47,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1956 transitions. [2019-09-08 12:31:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:47,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:47,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:47,391 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1507490450, now seen corresponding path program 1 times [2019-09-08 12:31:47,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:47,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:47,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:47,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:47,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:47,531 INFO L87 Difference]: Start difference. First operand 1338 states and 1956 transitions. Second operand 5 states. [2019-09-08 12:31:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:47,824 INFO L93 Difference]: Finished difference Result 2122 states and 3114 transitions. [2019-09-08 12:31:47,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:47,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 12:31:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:47,833 INFO L225 Difference]: With dead ends: 2122 [2019-09-08 12:31:47,833 INFO L226 Difference]: Without dead ends: 1608 [2019-09-08 12:31:47,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:31:47,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-09-08 12:31:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1468. [2019-09-08 12:31:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2019-09-08 12:31:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2149 transitions. [2019-09-08 12:31:48,003 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2149 transitions. Word has length 102 [2019-09-08 12:31:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:48,003 INFO L475 AbstractCegarLoop]: Abstraction has 1468 states and 2149 transitions. [2019-09-08 12:31:48,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2149 transitions. [2019-09-08 12:31:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:48,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:48,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:48,005 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1474006360, now seen corresponding path program 1 times [2019-09-08 12:31:48,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:48,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:48,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:48,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:48,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:48,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:48,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:48,156 INFO L87 Difference]: Start difference. First operand 1468 states and 2149 transitions. Second operand 5 states. [2019-09-08 12:31:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:48,435 INFO L93 Difference]: Finished difference Result 2431 states and 3575 transitions. [2019-09-08 12:31:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:48,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 12:31:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:48,445 INFO L225 Difference]: With dead ends: 2431 [2019-09-08 12:31:48,445 INFO L226 Difference]: Without dead ends: 1788 [2019-09-08 12:31:48,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:31:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-09-08 12:31:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1608. [2019-09-08 12:31:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-09-08 12:31:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2358 transitions. [2019-09-08 12:31:48,626 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2358 transitions. Word has length 102 [2019-09-08 12:31:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:48,626 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2358 transitions. [2019-09-08 12:31:48,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2358 transitions. [2019-09-08 12:31:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:31:48,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:48,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:48,628 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1383468205, now seen corresponding path program 1 times [2019-09-08 12:31:48,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:48,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:48,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:48,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:31:48,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:31:48,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:31:48,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:31:48,831 INFO L87 Difference]: Start difference. First operand 1608 states and 2358 transitions. Second operand 8 states. [2019-09-08 12:31:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:49,760 INFO L93 Difference]: Finished difference Result 5452 states and 8067 transitions. [2019-09-08 12:31:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:31:49,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 12:31:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:49,791 INFO L225 Difference]: With dead ends: 5452 [2019-09-08 12:31:49,791 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 12:31:49,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:31:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 12:31:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 1888. [2019-09-08 12:31:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1888 states. [2019-09-08 12:31:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2775 transitions. [2019-09-08 12:31:50,104 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2775 transitions. Word has length 102 [2019-09-08 12:31:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:50,104 INFO L475 AbstractCegarLoop]: Abstraction has 1888 states and 2775 transitions. [2019-09-08 12:31:50,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:31:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2775 transitions. [2019-09-08 12:31:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:31:50,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:50,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:50,107 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1488862363, now seen corresponding path program 1 times [2019-09-08 12:31:50,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:50,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:50,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:50,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:50,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:50,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:50,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:50,252 INFO L87 Difference]: Start difference. First operand 1888 states and 2775 transitions. Second operand 5 states. [2019-09-08 12:31:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:50,718 INFO L93 Difference]: Finished difference Result 3188 states and 4696 transitions. [2019-09-08 12:31:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:31:50,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 12:31:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:50,734 INFO L225 Difference]: With dead ends: 3188 [2019-09-08 12:31:50,735 INFO L226 Difference]: Without dead ends: 3186 [2019-09-08 12:31:50,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:31:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2019-09-08 12:31:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 1902. [2019-09-08 12:31:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-08 12:31:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2784 transitions. [2019-09-08 12:31:51,141 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2784 transitions. Word has length 103 [2019-09-08 12:31:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:51,141 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2784 transitions. [2019-09-08 12:31:51,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2784 transitions. [2019-09-08 12:31:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:31:51,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:51,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:51,145 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1518421097, now seen corresponding path program 1 times [2019-09-08 12:31:51,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:51,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:51,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:51,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:51,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:51,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:51,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:51,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:51,477 INFO L87 Difference]: Start difference. First operand 1902 states and 2784 transitions. Second operand 9 states. [2019-09-08 12:31:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:52,648 INFO L93 Difference]: Finished difference Result 5392 states and 7942 transitions. [2019-09-08 12:31:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:31:52,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:31:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:52,665 INFO L225 Difference]: With dead ends: 5392 [2019-09-08 12:31:52,665 INFO L226 Difference]: Without dead ends: 3602 [2019-09-08 12:31:52,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:31:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2019-09-08 12:31:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 1902. [2019-09-08 12:31:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-08 12:31:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2783 transitions. [2019-09-08 12:31:53,002 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2783 transitions. Word has length 103 [2019-09-08 12:31:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:53,003 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2783 transitions. [2019-09-08 12:31:53,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2783 transitions. [2019-09-08 12:31:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:53,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:53,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:53,005 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155735, now seen corresponding path program 1 times [2019-09-08 12:31:53,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:53,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:53,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:53,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:31:53,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:31:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:31:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:31:53,255 INFO L87 Difference]: Start difference. First operand 1902 states and 2783 transitions. Second operand 10 states. [2019-09-08 12:31:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:54,640 INFO L93 Difference]: Finished difference Result 5529 states and 8129 transitions. [2019-09-08 12:31:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:31:54,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 12:31:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:54,657 INFO L225 Difference]: With dead ends: 5529 [2019-09-08 12:31:54,657 INFO L226 Difference]: Without dead ends: 3744 [2019-09-08 12:31:54,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:31:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2019-09-08 12:31:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 1902. [2019-09-08 12:31:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-08 12:31:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2781 transitions. [2019-09-08 12:31:54,922 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2781 transitions. Word has length 104 [2019-09-08 12:31:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:54,923 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2781 transitions. [2019-09-08 12:31:54,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:31:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2781 transitions. [2019-09-08 12:31:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:54,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:54,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:54,925 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:54,925 INFO L82 PathProgramCache]: Analyzing trace with hash 85263168, now seen corresponding path program 1 times [2019-09-08 12:31:54,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:54,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:54,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:54,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:54,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:55,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:55,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:31:55,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:31:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:31:55,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:31:55,131 INFO L87 Difference]: Start difference. First operand 1902 states and 2781 transitions. Second operand 10 states. [2019-09-08 12:31:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:56,467 INFO L93 Difference]: Finished difference Result 5514 states and 8103 transitions. [2019-09-08 12:31:56,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:31:56,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 12:31:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:56,492 INFO L225 Difference]: With dead ends: 5514 [2019-09-08 12:31:56,492 INFO L226 Difference]: Without dead ends: 3739 [2019-09-08 12:31:56,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:31:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2019-09-08 12:31:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 1902. [2019-09-08 12:31:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-08 12:31:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2777 transitions. [2019-09-08 12:31:56,766 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2777 transitions. Word has length 104 [2019-09-08 12:31:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:56,766 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2777 transitions. [2019-09-08 12:31:56,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:31:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2777 transitions. [2019-09-08 12:31:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:31:56,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:56,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:56,768 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash 37876548, now seen corresponding path program 1 times [2019-09-08 12:31:56,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:56,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:56,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:56,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:57,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:31:57,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:31:57,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:31:57,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:31:57,001 INFO L87 Difference]: Start difference. First operand 1902 states and 2777 transitions. Second operand 10 states. [2019-09-08 12:31:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:58,298 INFO L93 Difference]: Finished difference Result 5384 states and 7891 transitions. [2019-09-08 12:31:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:31:58,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 12:31:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:58,306 INFO L225 Difference]: With dead ends: 5384 [2019-09-08 12:31:58,307 INFO L226 Difference]: Without dead ends: 3684 [2019-09-08 12:31:58,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:31:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2019-09-08 12:31:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 1902. [2019-09-08 12:31:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-08 12:31:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2770 transitions. [2019-09-08 12:31:58,653 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2770 transitions. Word has length 105 [2019-09-08 12:31:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:58,653 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2770 transitions. [2019-09-08 12:31:58,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:31:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2770 transitions. [2019-09-08 12:31:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:58,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:58,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:58,655 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash -6182625, now seen corresponding path program 1 times [2019-09-08 12:31:58,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:58,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:58,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:58,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:58,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:58,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:58,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:31:58,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:31:58,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:31:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:31:58,866 INFO L87 Difference]: Start difference. First operand 1902 states and 2770 transitions. Second operand 10 states. [2019-09-08 12:32:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:00,228 INFO L93 Difference]: Finished difference Result 5484 states and 8032 transitions. [2019-09-08 12:32:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:32:00,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-09-08 12:32:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:00,236 INFO L225 Difference]: With dead ends: 5484 [2019-09-08 12:32:00,236 INFO L226 Difference]: Without dead ends: 3729 [2019-09-08 12:32:00,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:32:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2019-09-08 12:32:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 1902. [2019-09-08 12:32:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-08 12:32:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2765 transitions. [2019-09-08 12:32:00,581 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2765 transitions. Word has length 106 [2019-09-08 12:32:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:00,582 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2765 transitions. [2019-09-08 12:32:00,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:32:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2765 transitions. [2019-09-08 12:32:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:32:00,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:00,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:00,583 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash -361867127, now seen corresponding path program 1 times [2019-09-08 12:32:00,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:00,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:00,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:00,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:00,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:00,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:00,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:32:00,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:32:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:32:00,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:32:00,814 INFO L87 Difference]: Start difference. First operand 1902 states and 2765 transitions. Second operand 10 states. [2019-09-08 12:32:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:02,321 INFO L93 Difference]: Finished difference Result 5439 states and 7955 transitions. [2019-09-08 12:32:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:32:02,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-09-08 12:32:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:02,330 INFO L225 Difference]: With dead ends: 5439 [2019-09-08 12:32:02,330 INFO L226 Difference]: Without dead ends: 3709 [2019-09-08 12:32:02,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:32:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2019-09-08 12:32:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 1902. [2019-09-08 12:32:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-08 12:32:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2759 transitions. [2019-09-08 12:32:02,758 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2759 transitions. Word has length 107 [2019-09-08 12:32:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:02,759 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2759 transitions. [2019-09-08 12:32:02,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:32:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2759 transitions. [2019-09-08 12:32:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:02,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:02,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:02,760 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1928807370, now seen corresponding path program 1 times [2019-09-08 12:32:02,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:02,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:02,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:03,538 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-08 12:32:03,824 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:32:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:04,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:04,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:32:04,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:32:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:32:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:32:04,840 INFO L87 Difference]: Start difference. First operand 1902 states and 2759 transitions. Second operand 25 states. [2019-09-08 12:32:05,944 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-08 12:32:06,200 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-08 12:32:06,561 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-08 12:32:06,966 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-08 12:32:07,518 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 120 [2019-09-08 12:32:08,137 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 135 [2019-09-08 12:32:08,413 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:32:08,634 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-08 12:32:09,081 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 12:32:09,518 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-08 12:32:09,778 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-08 12:32:10,135 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-08 12:32:10,597 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-08 12:32:11,051 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-08 12:32:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:14,637 INFO L93 Difference]: Finished difference Result 9202 states and 13517 transitions. [2019-09-08 12:32:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:32:14,638 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 108 [2019-09-08 12:32:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:14,649 INFO L225 Difference]: With dead ends: 9202 [2019-09-08 12:32:14,650 INFO L226 Difference]: Without dead ends: 8139 [2019-09-08 12:32:14,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:32:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8139 states. [2019-09-08 12:32:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8139 to 1912. [2019-09-08 12:32:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-08 12:32:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2769 transitions. [2019-09-08 12:32:15,293 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2769 transitions. Word has length 108 [2019-09-08 12:32:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:15,293 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 2769 transitions. [2019-09-08 12:32:15,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:32:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2769 transitions. [2019-09-08 12:32:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:15,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:15,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:15,295 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2012504660, now seen corresponding path program 1 times [2019-09-08 12:32:15,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:15,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:16,384 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 12:32:16,566 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-08 12:32:16,734 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:32:16,935 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 12:32:17,108 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 12:32:17,321 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-08 12:32:17,494 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 12:32:17,667 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 12:32:17,838 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:32:18,033 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:32:18,356 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:32:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:19,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:19,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:32:19,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:32:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:32:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:32:19,621 INFO L87 Difference]: Start difference. First operand 1912 states and 2769 transitions. Second operand 36 states. [2019-09-08 12:32:19,864 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-09-08 12:32:20,743 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 24 [2019-09-08 12:32:21,327 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-09-08 12:32:21,545 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-09-08 12:32:22,236 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2019-09-08 12:32:22,611 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2019-09-08 12:32:22,976 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2019-09-08 12:32:23,461 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 80 [2019-09-08 12:32:23,977 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 89 [2019-09-08 12:32:24,639 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 106 [2019-09-08 12:32:25,324 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 117 [2019-09-08 12:32:26,197 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 140 [2019-09-08 12:32:27,158 WARN L188 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 159 [2019-09-08 12:32:28,329 WARN L188 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 184 [2019-09-08 12:32:28,854 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 86 [2019-09-08 12:32:29,318 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 86 [2019-09-08 12:32:29,710 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-09-08 12:32:33,487 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2019-09-08 12:32:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:43,313 INFO L93 Difference]: Finished difference Result 10378 states and 15242 transitions. [2019-09-08 12:32:43,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 12:32:43,313 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 108 [2019-09-08 12:32:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:43,322 INFO L225 Difference]: With dead ends: 10378 [2019-09-08 12:32:43,322 INFO L226 Difference]: Without dead ends: 9596 [2019-09-08 12:32:43,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=699, Invalid=3723, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 12:32:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9596 states. [2019-09-08 12:32:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9596 to 1955. [2019-09-08 12:32:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2019-09-08 12:32:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2824 transitions. [2019-09-08 12:32:43,919 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2824 transitions. Word has length 108 [2019-09-08 12:32:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:43,919 INFO L475 AbstractCegarLoop]: Abstraction has 1955 states and 2824 transitions. [2019-09-08 12:32:43,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:32:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2824 transitions. [2019-09-08 12:32:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:43,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:43,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:43,921 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash -409687476, now seen corresponding path program 1 times [2019-09-08 12:32:43,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:43,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:47,245 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:32:47,513 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-08 12:32:50,954 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:32:53,152 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-08 12:32:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:54,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:54,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:32:54,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:32:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:32:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1166, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:32:54,475 INFO L87 Difference]: Start difference. First operand 1955 states and 2824 transitions. Second operand 36 states. [2019-09-08 12:32:54,667 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-08 12:32:55,904 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-08 12:32:56,431 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:32:56,747 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:32:57,082 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-09-08 12:32:57,533 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2019-09-08 12:33:00,089 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2019-09-08 12:33:00,741 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 135 [2019-09-08 12:33:06,164 WARN L188 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 176 DAG size of output: 157 [2019-09-08 12:33:46,485 WARN L188 SmtUtils]: Spent 38.05 s on a formula simplification. DAG size of input: 199 DAG size of output: 180 [2019-09-08 12:35:13,939 WARN L188 SmtUtils]: Spent 1.46 m on a formula simplification. DAG size of input: 229 DAG size of output: 208 [2019-09-08 12:36:24,275 WARN L188 SmtUtils]: Spent 1.17 m on a formula simplification. DAG size of input: 245 DAG size of output: 224 [2019-09-08 12:36:24,585 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 12:36:24,879 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 12:36:25,095 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-08 12:36:25,426 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 12:36:25,618 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-08 12:36:25,961 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 12:36:29,951 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:36:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:51,120 INFO L93 Difference]: Finished difference Result 13965 states and 20502 transitions. [2019-09-08 12:36:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 12:36:51,120 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 108 [2019-09-08 12:36:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:51,136 INFO L225 Difference]: With dead ends: 13965 [2019-09-08 12:36:51,136 INFO L226 Difference]: Without dead ends: 13183 [2019-09-08 12:36:51,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 216.8s TimeCoverageRelationStatistics Valid=938, Invalid=5224, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 12:36:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13183 states. [2019-09-08 12:36:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13183 to 1996. [2019-09-08 12:36:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-09-08 12:36:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2880 transitions. [2019-09-08 12:36:51,704 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2880 transitions. Word has length 108 [2019-09-08 12:36:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:51,704 INFO L475 AbstractCegarLoop]: Abstraction has 1996 states and 2880 transitions. [2019-09-08 12:36:51,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:36:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2880 transitions. [2019-09-08 12:36:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:36:51,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:51,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:51,706 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash 952239658, now seen corresponding path program 1 times [2019-09-08 12:36:51,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:51,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:51,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:51,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:52,647 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:36:52,930 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-08 12:36:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:53,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:53,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:36:53,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:36:53,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:36:53,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:36:53,600 INFO L87 Difference]: Start difference. First operand 1996 states and 2880 transitions. Second operand 25 states. [2019-09-08 12:36:54,672 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:36:54,935 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:36:55,296 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-08 12:36:55,711 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-09-08 12:36:56,261 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 120 [2019-09-08 12:36:56,872 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 133 [2019-09-08 12:36:57,106 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-08 12:36:57,285 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-08 12:36:57,598 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-08 12:36:57,973 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 12:36:58,251 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 12:36:58,568 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 12:36:59,108 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:36:59,455 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:37:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:04,172 INFO L93 Difference]: Finished difference Result 9276 states and 13604 transitions. [2019-09-08 12:37:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:37:04,173 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 108 [2019-09-08 12:37:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:04,181 INFO L225 Difference]: With dead ends: 9276 [2019-09-08 12:37:04,181 INFO L226 Difference]: Without dead ends: 8218 [2019-09-08 12:37:04,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:37:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2019-09-08 12:37:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 2011. [2019-09-08 12:37:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-09-08 12:37:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2897 transitions. [2019-09-08 12:37:04,803 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2897 transitions. Word has length 108 [2019-09-08 12:37:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:04,804 INFO L475 AbstractCegarLoop]: Abstraction has 2011 states and 2897 transitions. [2019-09-08 12:37:04,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:37:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2897 transitions. [2019-09-08 12:37:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:37:04,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:04,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:04,806 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash -771731288, now seen corresponding path program 1 times [2019-09-08 12:37:04,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:04,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:04,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:05,775 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 12:37:06,108 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 12:37:06,445 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:37:06,780 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:37:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:08,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:08,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-08 12:37:08,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 12:37:08,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 12:37:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1112, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:37:08,172 INFO L87 Difference]: Start difference. First operand 2011 states and 2897 transitions. Second operand 35 states. [2019-09-08 12:37:08,398 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:37:09,309 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-08 12:37:09,638 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:37:09,843 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 12:37:10,194 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-08 12:37:10,809 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 12:37:11,189 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-09-08 12:37:11,693 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 98 [2019-09-08 12:37:12,228 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 108 [2019-09-08 12:37:13,009 WARN L188 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 125 [2019-09-08 12:37:13,760 WARN L188 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 134 [2019-09-08 12:37:14,675 WARN L188 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 150 [2019-09-08 12:37:15,659 WARN L188 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 159 [2019-09-08 12:37:16,875 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 212 DAG size of output: 174 [2019-09-08 12:37:17,293 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-09-08 12:37:17,702 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-09-08 12:37:18,275 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-09-08 12:37:18,672 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-09-08 12:37:19,098 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-09-08 12:37:19,838 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-08 12:37:20,344 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-08 12:37:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:30,955 INFO L93 Difference]: Finished difference Result 9412 states and 13788 transitions. [2019-09-08 12:37:30,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 12:37:30,955 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2019-09-08 12:37:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:30,964 INFO L225 Difference]: With dead ends: 9412 [2019-09-08 12:37:30,964 INFO L226 Difference]: Without dead ends: 8359 [2019-09-08 12:37:30,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=795, Invalid=3365, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:37:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8359 states. [2019-09-08 12:37:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8359 to 2016. [2019-09-08 12:37:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-09-08 12:37:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2902 transitions. [2019-09-08 12:37:31,712 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2902 transitions. Word has length 108 [2019-09-08 12:37:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:31,713 INFO L475 AbstractCegarLoop]: Abstraction has 2016 states and 2902 transitions. [2019-09-08 12:37:31,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 12:37:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2902 transitions. [2019-09-08 12:37:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:37:31,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:31,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:31,714 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:31,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:31,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1756188310, now seen corresponding path program 1 times [2019-09-08 12:37:31,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:31,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:31,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:31,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:31,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:32,472 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:37:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:33,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:33,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 12:37:33,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 12:37:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 12:37:33,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:37:33,144 INFO L87 Difference]: Start difference. First operand 2016 states and 2902 transitions. Second operand 23 states. [2019-09-08 12:37:34,282 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 12:37:34,509 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-08 12:37:34,848 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-08 12:37:35,237 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2019-09-08 12:37:35,773 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 106 [2019-09-08 12:37:36,021 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 12:37:36,272 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 12:37:36,617 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 12:37:36,833 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 12:37:37,090 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 12:37:37,501 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 12:37:37,793 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 12:37:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:44,811 INFO L93 Difference]: Finished difference Result 11775 states and 17275 transitions. [2019-09-08 12:37:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:37:44,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 108 [2019-09-08 12:37:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:44,824 INFO L225 Difference]: With dead ends: 11775 [2019-09-08 12:37:44,824 INFO L226 Difference]: Without dead ends: 10677 [2019-09-08 12:37:44,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=440, Invalid=1540, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:37:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10677 states. [2019-09-08 12:37:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10677 to 1991. [2019-09-08 12:37:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-09-08 12:37:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2865 transitions. [2019-09-08 12:37:45,641 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2865 transitions. Word has length 108 [2019-09-08 12:37:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:45,641 INFO L475 AbstractCegarLoop]: Abstraction has 1991 states and 2865 transitions. [2019-09-08 12:37:45,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 12:37:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2865 transitions. [2019-09-08 12:37:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:37:45,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:45,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:37:45,643 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:45,643 INFO L82 PathProgramCache]: Analyzing trace with hash -12864555, now seen corresponding path program 1 times [2019-09-08 12:37:45,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:45,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:45,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:45,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:45,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:46,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-09-08 12:37:46,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:46,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:37:46,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:37:46,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:37:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:37:46,499 INFO L87 Difference]: Start difference. First operand 1991 states and 2865 transitions. Second operand 19 states. [2019-09-08 12:37:47,075 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 12:37:47,284 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-08 12:37:47,581 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-08 12:37:47,916 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-09-08 12:37:48,111 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 12:37:48,468 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 12:37:48,755 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-08 12:37:48,934 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 12:37:49,181 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 12:37:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:53,248 INFO L93 Difference]: Finished difference Result 9770 states and 14327 transitions. [2019-09-08 12:37:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:37:53,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-09-08 12:37:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:53,255 INFO L225 Difference]: With dead ends: 9770 [2019-09-08 12:37:53,255 INFO L226 Difference]: Without dead ends: 8697 [2019-09-08 12:37:53,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:37:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8697 states. [2019-09-08 12:37:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8697 to 1981. [2019-09-08 12:37:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2019-09-08 12:37:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2853 transitions. [2019-09-08 12:37:54,045 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2853 transitions. Word has length 109 [2019-09-08 12:37:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:54,046 INFO L475 AbstractCegarLoop]: Abstraction has 1981 states and 2853 transitions. [2019-09-08 12:37:54,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:37:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2853 transitions. [2019-09-08 12:37:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:37:54,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:54,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:37:54,047 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 624948564, now seen corresponding path program 1 times [2019-09-08 12:37:54,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:55,043 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:37:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:55,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:55,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:37:55,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:37:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:37:55,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:37:55,688 INFO L87 Difference]: Start difference. First operand 1981 states and 2853 transitions. Second operand 24 states. [2019-09-08 12:37:56,840 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:37:57,088 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-08 12:37:57,432 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-08 12:37:58,556 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-09-08 12:37:59,163 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2019-09-08 12:37:59,412 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:37:59,697 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:37:59,984 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-08 12:38:00,287 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-09-08 12:38:00,516 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 12:38:00,707 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:38:03,042 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-08 12:38:03,270 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:38:03,737 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:38:03,987 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:38:04,388 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:38:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:10,409 INFO L93 Difference]: Finished difference Result 11203 states and 16431 transitions. [2019-09-08 12:38:10,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:38:10,409 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 109 [2019-09-08 12:38:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:10,420 INFO L225 Difference]: With dead ends: 11203 [2019-09-08 12:38:10,420 INFO L226 Difference]: Without dead ends: 10421 [2019-09-08 12:38:10,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=540, Invalid=2216, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 12:38:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2019-09-08 12:38:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 2016. [2019-09-08 12:38:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-09-08 12:38:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2900 transitions. [2019-09-08 12:38:11,261 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2900 transitions. Word has length 109 [2019-09-08 12:38:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:11,262 INFO L475 AbstractCegarLoop]: Abstraction has 2016 states and 2900 transitions. [2019-09-08 12:38:11,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:38:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2900 transitions. [2019-09-08 12:38:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:38:11,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:11,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:38:11,263 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1552482483, now seen corresponding path program 1 times [2019-09-08 12:38:11,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:11,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:12,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:12,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:38:12,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:38:12,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:38:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:38:12,292 INFO L87 Difference]: Start difference. First operand 2016 states and 2900 transitions. Second operand 18 states. [2019-09-08 12:38:13,053 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-08 12:38:13,259 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 12:38:13,578 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-08 12:38:13,776 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:38:13,969 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:38:14,199 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 12:38:14,429 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:38:14,634 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:38:14,782 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-08 12:38:15,002 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 12:38:15,167 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 12:38:15,443 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-08 12:38:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:21,987 INFO L93 Difference]: Finished difference Result 13746 states and 20197 transitions. [2019-09-08 12:38:21,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:38:21,988 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 109 [2019-09-08 12:38:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:21,999 INFO L225 Difference]: With dead ends: 13746 [2019-09-08 12:38:21,999 INFO L226 Difference]: Without dead ends: 12964 [2019-09-08 12:38:22,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=298, Invalid=1108, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:38:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12964 states. [2019-09-08 12:38:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12964 to 2021. [2019-09-08 12:38:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-09-08 12:38:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2900 transitions. [2019-09-08 12:38:22,907 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2900 transitions. Word has length 109 [2019-09-08 12:38:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:22,907 INFO L475 AbstractCegarLoop]: Abstraction has 2021 states and 2900 transitions. [2019-09-08 12:38:22,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:38:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2900 transitions. [2019-09-08 12:38:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:38:22,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:22,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:38:22,909 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 568025461, now seen corresponding path program 1 times [2019-09-08 12:38:22,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:22,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:22,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:23,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:23,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:38:23,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:38:23,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:38:23,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:38:23,561 INFO L87 Difference]: Start difference. First operand 2021 states and 2900 transitions. Second operand 14 states. [2019-09-08 12:38:24,088 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:38:24,269 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:38:24,468 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:38:24,855 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:38:25,150 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:38:25,312 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:38:27,461 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:38:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:31,059 INFO L93 Difference]: Finished difference Result 11502 states and 16852 transitions. [2019-09-08 12:38:31,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:38:31,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2019-09-08 12:38:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:31,068 INFO L225 Difference]: With dead ends: 11502 [2019-09-08 12:38:31,069 INFO L226 Difference]: Without dead ends: 10666 [2019-09-08 12:38:31,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:38:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-09-08 12:38:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 1989. [2019-09-08 12:38:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-09-08 12:38:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2850 transitions. [2019-09-08 12:38:32,026 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2850 transitions. Word has length 109 [2019-09-08 12:38:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:32,026 INFO L475 AbstractCegarLoop]: Abstraction has 1989 states and 2850 transitions. [2019-09-08 12:38:32,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:38:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2850 transitions. [2019-09-08 12:38:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:38:32,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:32,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:38:32,028 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:32,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:32,028 INFO L82 PathProgramCache]: Analyzing trace with hash -528155211, now seen corresponding path program 1 times [2019-09-08 12:38:32,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:32,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:32,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:38:32,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:38:32,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:38:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:38:32,135 INFO L87 Difference]: Start difference. First operand 1989 states and 2850 transitions. Second operand 4 states. [2019-09-08 12:38:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:33,592 INFO L93 Difference]: Finished difference Result 4506 states and 6570 transitions. [2019-09-08 12:38:33,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:33,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-08 12:38:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:33,595 INFO L225 Difference]: With dead ends: 4506 [2019-09-08 12:38:33,595 INFO L226 Difference]: Without dead ends: 2813 [2019-09-08 12:38:33,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-09-08 12:38:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2798. [2019-09-08 12:38:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2798 states. [2019-09-08 12:38:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4026 transitions. [2019-09-08 12:38:34,911 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4026 transitions. Word has length 109 [2019-09-08 12:38:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:34,911 INFO L475 AbstractCegarLoop]: Abstraction has 2798 states and 4026 transitions. [2019-09-08 12:38:34,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:38:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4026 transitions. [2019-09-08 12:38:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:38:34,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:34,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:38:34,913 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash -9510182, now seen corresponding path program 1 times [2019-09-08 12:38:34,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:34,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:34,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:35,685 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:38:35,927 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 12:38:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:36,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:38:36,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:38:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:38:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:36,456 INFO L87 Difference]: Start difference. First operand 2798 states and 4026 transitions. Second operand 21 states. [2019-09-08 12:38:36,605 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-08 12:38:37,057 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-08 12:38:37,193 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-08 12:38:37,461 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-08 12:38:37,751 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-08 12:38:38,086 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-08 12:38:38,474 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2019-09-08 12:38:38,895 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-09-08 12:38:39,239 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-08 12:38:39,520 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-08 12:38:39,755 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-08 12:38:40,074 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 12:38:40,278 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-08 12:38:40,661 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-08 12:38:40,961 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-09-08 12:38:41,434 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 100 [2019-09-08 12:38:41,720 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:38:41,884 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-08 12:38:42,273 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-08 12:38:42,536 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 12:38:42,942 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-08 12:38:43,098 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-08 12:38:43,324 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 12:38:43,650 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-08 12:38:43,838 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 12:38:44,226 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-08 12:38:44,410 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 12:38:49,532 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 12:38:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:57,798 INFO L93 Difference]: Finished difference Result 23334 states and 34210 transitions. [2019-09-08 12:38:57,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 12:38:57,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2019-09-08 12:38:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:57,818 INFO L225 Difference]: With dead ends: 23334 [2019-09-08 12:38:57,818 INFO L226 Difference]: Without dead ends: 22182 [2019-09-08 12:38:57,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=545, Invalid=2317, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 12:38:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22182 states. [2019-09-08 12:38:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22182 to 2792. [2019-09-08 12:38:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2019-09-08 12:38:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4017 transitions. [2019-09-08 12:38:59,338 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4017 transitions. Word has length 109 [2019-09-08 12:38:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:59,338 INFO L475 AbstractCegarLoop]: Abstraction has 2792 states and 4017 transitions. [2019-09-08 12:38:59,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:38:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4017 transitions. [2019-09-08 12:38:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:38:59,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:59,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:38:59,339 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:59,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1506480954, now seen corresponding path program 1 times [2019-09-08 12:38:59,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:59,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:59,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:59,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:59,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:59,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:38:59,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:38:59,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:38:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:38:59,822 INFO L87 Difference]: Start difference. First operand 2792 states and 4017 transitions. Second operand 11 states. [2019-09-08 12:39:00,242 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-09-08 12:39:00,391 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-08 12:39:00,548 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:39:00,690 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-08 12:39:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:06,567 INFO L93 Difference]: Finished difference Result 11360 states and 16610 transitions. [2019-09-08 12:39:06,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:39:06,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 109 [2019-09-08 12:39:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:06,576 INFO L225 Difference]: With dead ends: 11360 [2019-09-08 12:39:06,576 INFO L226 Difference]: Without dead ends: 9758 [2019-09-08 12:39:06,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9758 states. [2019-09-08 12:39:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9758 to 2612. [2019-09-08 12:39:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2612 states. [2019-09-08 12:39:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3768 transitions. [2019-09-08 12:39:08,057 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3768 transitions. Word has length 109 [2019-09-08 12:39:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:08,057 INFO L475 AbstractCegarLoop]: Abstraction has 2612 states and 3768 transitions. [2019-09-08 12:39:08,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:39:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3768 transitions. [2019-09-08 12:39:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:39:08,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:08,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:39:08,058 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash -584523345, now seen corresponding path program 1 times [2019-09-08 12:39:08,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:08,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:08,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:08,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:39:08,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:39:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:39:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:39:08,617 INFO L87 Difference]: Start difference. First operand 2612 states and 3768 transitions. Second operand 13 states. [2019-09-08 12:39:09,073 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:39:09,230 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:39:09,530 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:39:09,744 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:39:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:15,829 INFO L93 Difference]: Finished difference Result 11405 states and 16666 transitions. [2019-09-08 12:39:15,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:15,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-09-08 12:39:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:15,838 INFO L225 Difference]: With dead ends: 11405 [2019-09-08 12:39:15,838 INFO L226 Difference]: Without dead ends: 9817 [2019-09-08 12:39:15,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:39:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2019-09-08 12:39:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 2571. [2019-09-08 12:39:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-09-08 12:39:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3716 transitions. [2019-09-08 12:39:17,448 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3716 transitions. Word has length 110 [2019-09-08 12:39:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:17,448 INFO L475 AbstractCegarLoop]: Abstraction has 2571 states and 3716 transitions. [2019-09-08 12:39:17,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:39:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3716 transitions. [2019-09-08 12:39:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:39:17,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:17,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:39:17,449 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 639012882, now seen corresponding path program 1 times [2019-09-08 12:39:17,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:17,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:17,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:17,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:39:17,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:39:17,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:39:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:39:17,937 INFO L87 Difference]: Start difference. First operand 2571 states and 3716 transitions. Second operand 13 states. [2019-09-08 12:39:18,458 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:39:18,671 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:39:18,912 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:39:19,292 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:39:19,561 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:39:19,707 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:39:21,796 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:39:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:27,537 INFO L93 Difference]: Finished difference Result 13301 states and 19483 transitions. [2019-09-08 12:39:27,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:39:27,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-09-08 12:39:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:27,548 INFO L225 Difference]: With dead ends: 13301 [2019-09-08 12:39:27,548 INFO L226 Difference]: Without dead ends: 12130 [2019-09-08 12:39:27,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:39:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12130 states. [2019-09-08 12:39:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12130 to 2550. [2019-09-08 12:39:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2550 states. [2019-09-08 12:39:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3689 transitions. [2019-09-08 12:39:29,208 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3689 transitions. Word has length 110 [2019-09-08 12:39:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:29,208 INFO L475 AbstractCegarLoop]: Abstraction has 2550 states and 3689 transitions. [2019-09-08 12:39:29,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:39:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3689 transitions. [2019-09-08 12:39:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:39:29,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:29,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:39:29,210 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1373745039, now seen corresponding path program 1 times [2019-09-08 12:39:29,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:29,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:29,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:29,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:29,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:30,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:30,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:39:30,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:39:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:39:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:39:30,160 INFO L87 Difference]: Start difference. First operand 2550 states and 3689 transitions. Second operand 19 states. [2019-09-08 12:39:30,934 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:39:31,219 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-08 12:39:31,555 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-08 12:39:31,741 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-08 12:39:32,101 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:39:32,356 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 12:39:32,553 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:39:32,773 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:39:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:41,434 INFO L93 Difference]: Finished difference Result 13572 states and 19879 transitions. [2019-09-08 12:39:41,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:39:41,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2019-09-08 12:39:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:41,444 INFO L225 Difference]: With dead ends: 13572 [2019-09-08 12:39:41,445 INFO L226 Difference]: Without dead ends: 12013 [2019-09-08 12:39:41,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:39:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12013 states. [2019-09-08 12:39:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12013 to 2542. [2019-09-08 12:39:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-09-08 12:39:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3679 transitions. [2019-09-08 12:39:43,109 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3679 transitions. Word has length 110 [2019-09-08 12:39:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:43,109 INFO L475 AbstractCegarLoop]: Abstraction has 2542 states and 3679 transitions. [2019-09-08 12:39:43,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:39:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3679 transitions. [2019-09-08 12:39:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:39:43,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:43,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:39:43,112 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:43,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1243814062, now seen corresponding path program 1 times [2019-09-08 12:39:43,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:43,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:43,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:43,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:43,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:39:43,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:39:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:39:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:39:43,893 INFO L87 Difference]: Start difference. First operand 2542 states and 3679 transitions. Second operand 14 states. [2019-09-08 12:39:44,354 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-09-08 12:39:44,505 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 12:39:44,663 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 12:39:44,813 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:39:45,027 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:39:45,238 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 12:39:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:51,963 INFO L93 Difference]: Finished difference Result 11316 states and 16558 transitions. [2019-09-08 12:39:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:39:51,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-09-08 12:39:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:51,972 INFO L225 Difference]: With dead ends: 11316 [2019-09-08 12:39:51,972 INFO L226 Difference]: Without dead ends: 9747 [2019-09-08 12:39:51,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:39:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9747 states. [2019-09-08 12:39:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9747 to 2510. [2019-09-08 12:39:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2019-09-08 12:39:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3640 transitions. [2019-09-08 12:39:53,666 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3640 transitions. Word has length 110 [2019-09-08 12:39:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:53,666 INFO L475 AbstractCegarLoop]: Abstraction has 2510 states and 3640 transitions. [2019-09-08 12:39:53,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:39:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3640 transitions. [2019-09-08 12:39:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:39:53,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:53,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:39:53,667 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:53,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1636111030, now seen corresponding path program 1 times [2019-09-08 12:39:53,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:53,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:53,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:54,527 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 12:39:54,660 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 12:39:54,809 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 12:39:55,269 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 12:39:55,521 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 12:39:56,111 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 12:39:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:57,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:57,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-09-08 12:39:57,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 12:39:57,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 12:39:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1310, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:39:57,884 INFO L87 Difference]: Start difference. First operand 2510 states and 3640 transitions. Second operand 38 states. [2019-09-08 12:39:58,221 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-08 12:39:59,057 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-08 12:39:59,263 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-08 12:39:59,511 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:39:59,759 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-08 12:40:00,102 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:40:00,451 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 12:40:01,132 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-08 12:40:01,488 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 60 [2019-09-08 12:40:01,824 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2019-09-08 12:40:02,192 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2019-09-08 12:40:02,603 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-08 12:40:03,061 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 98 [2019-09-08 12:40:03,610 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 109 [2019-09-08 12:40:04,173 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 118 [2019-09-08 12:40:04,904 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 139 [2019-09-08 12:40:05,714 WARN L188 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 155 [2019-09-08 12:40:06,642 WARN L188 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 165 [2019-09-08 12:40:06,995 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-09-08 12:40:07,339 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-09-08 12:40:07,685 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-09-08 12:40:08,075 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2019-09-08 12:40:08,357 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-09-08 12:40:08,695 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81 [2019-09-08 12:40:09,075 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:40:09,308 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 12:40:10,712 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-09-08 12:40:11,641 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-08 12:40:12,173 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-08 12:40:13,521 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-08 12:40:14,219 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:40:14,504 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-08 12:40:14,886 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-08 12:40:15,332 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:40:15,735 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-09-08 12:40:18,812 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2019-09-08 12:40:20,637 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-09-08 12:40:47,607 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-09-08 12:41:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:08,218 INFO L93 Difference]: Finished difference Result 46760 states and 68783 transitions. [2019-09-08 12:41:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 12:41:08,219 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 110 [2019-09-08 12:41:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:08,261 INFO L225 Difference]: With dead ends: 46760 [2019-09-08 12:41:08,261 INFO L226 Difference]: Without dead ends: 45608 [2019-09-08 12:41:08,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1296, Invalid=6894, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 12:41:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45608 states. [2019-09-08 12:41:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45608 to 2522. [2019-09-08 12:41:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2019-09-08 12:41:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 3655 transitions. [2019-09-08 12:41:10,309 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 3655 transitions. Word has length 110 [2019-09-08 12:41:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:10,309 INFO L475 AbstractCegarLoop]: Abstraction has 2522 states and 3655 transitions. [2019-09-08 12:41:10,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 12:41:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3655 transitions. [2019-09-08 12:41:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:41:10,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:10,310 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:41:10,310 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:10,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1800056775, now seen corresponding path program 1 times [2019-09-08 12:41:10,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:10,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:10,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:10,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:10,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:10,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:41:10,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:41:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:41:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:41:10,879 INFO L87 Difference]: Start difference. First operand 2522 states and 3655 transitions. Second operand 14 states. [2019-09-08 12:41:11,003 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-09-08 12:41:11,447 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-08 12:41:11,691 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:41:11,965 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:41:12,246 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:41:12,693 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:41:12,924 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:41:13,171 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:41:14,837 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:41:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:22,986 INFO L93 Difference]: Finished difference Result 13194 states and 19348 transitions. [2019-09-08 12:41:22,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:41:22,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 111 [2019-09-08 12:41:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:22,996 INFO L225 Difference]: With dead ends: 13194 [2019-09-08 12:41:22,996 INFO L226 Difference]: Without dead ends: 12042 [2019-09-08 12:41:23,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:41:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12042 states. [2019-09-08 12:41:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12042 to 2484. [2019-09-08 12:41:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2484 states. [2019-09-08 12:41:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3608 transitions. [2019-09-08 12:41:25,006 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3608 transitions. Word has length 111 [2019-09-08 12:41:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:25,006 INFO L475 AbstractCegarLoop]: Abstraction has 2484 states and 3608 transitions. [2019-09-08 12:41:25,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:41:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3608 transitions. [2019-09-08 12:41:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:41:25,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:25,009 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:25,009 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:25,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash 105892615, now seen corresponding path program 1 times [2019-09-08 12:41:25,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:25,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:25,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:25,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:25,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:25,065 INFO L87 Difference]: Start difference. First operand 2484 states and 3608 transitions. Second operand 3 states. [2019-09-08 12:41:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:28,844 INFO L93 Difference]: Finished difference Result 7090 states and 10339 transitions. [2019-09-08 12:41:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:28,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:41:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:28,848 INFO L225 Difference]: With dead ends: 7090 [2019-09-08 12:41:28,849 INFO L226 Difference]: Without dead ends: 4713 [2019-09-08 12:41:28,851 INFO L628 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-09-08 12:41:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2019-09-08 12:41:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4563. [2019-09-08 12:41:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-09-08 12:41:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6621 transitions. [2019-09-08 12:41:32,448 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6621 transitions. Word has length 141 [2019-09-08 12:41:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:32,448 INFO L475 AbstractCegarLoop]: Abstraction has 4563 states and 6621 transitions. [2019-09-08 12:41:32,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6621 transitions. [2019-09-08 12:41:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:41:32,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:32,450 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:32,451 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash -509787595, now seen corresponding path program 1 times [2019-09-08 12:41:32,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:32,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:32,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:32,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:32,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:32,530 INFO L87 Difference]: Start difference. First operand 4563 states and 6621 transitions. Second operand 3 states. [2019-09-08 12:41:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:39,877 INFO L93 Difference]: Finished difference Result 13179 states and 19119 transitions. [2019-09-08 12:41:39,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:39,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:41:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:39,885 INFO L225 Difference]: With dead ends: 13179 [2019-09-08 12:41:39,885 INFO L226 Difference]: Without dead ends: 8723 [2019-09-08 12:41:39,890 INFO L628 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-09-08 12:41:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2019-09-08 12:41:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 8425. [2019-09-08 12:41:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8425 states. [2019-09-08 12:41:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8425 states to 8425 states and 12166 transitions. [2019-09-08 12:41:46,635 INFO L78 Accepts]: Start accepts. Automaton has 8425 states and 12166 transitions. Word has length 142 [2019-09-08 12:41:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:46,635 INFO L475 AbstractCegarLoop]: Abstraction has 8425 states and 12166 transitions. [2019-09-08 12:41:46,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8425 states and 12166 transitions. [2019-09-08 12:41:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 12:41:46,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:46,637 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:46,637 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1396297160, now seen corresponding path program 1 times [2019-09-08 12:41:46,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:46,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:46,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:46,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:46,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:46,695 INFO L87 Difference]: Start difference. First operand 8425 states and 12166 transitions. Second operand 3 states. [2019-09-08 12:41:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:59,781 INFO L93 Difference]: Finished difference Result 24469 states and 35236 transitions. [2019-09-08 12:41:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:59,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 12:41:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:59,798 INFO L225 Difference]: With dead ends: 24469 [2019-09-08 12:41:59,799 INFO L226 Difference]: Without dead ends: 16151 [2019-09-08 12:41:59,809 INFO L628 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-09-08 12:41:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2019-09-08 12:42:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 15557. [2019-09-08 12:42:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15557 states. [2019-09-08 12:42:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15557 states to 15557 states and 22294 transitions. [2019-09-08 12:42:12,443 INFO L78 Accepts]: Start accepts. Automaton has 15557 states and 22294 transitions. Word has length 143 [2019-09-08 12:42:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:12,443 INFO L475 AbstractCegarLoop]: Abstraction has 15557 states and 22294 transitions. [2019-09-08 12:42:12,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:42:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 15557 states and 22294 transitions. [2019-09-08 12:42:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:42:12,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:12,445 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:12,445 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:12,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash -523481560, now seen corresponding path program 1 times [2019-09-08 12:42:12,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:12,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:12,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:12,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:12,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:12,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:12,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:42:12,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:42:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:42:12,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:42:12,509 INFO L87 Difference]: Start difference. First operand 15557 states and 22294 transitions. Second operand 3 states. [2019-09-08 12:42:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:37,177 INFO L93 Difference]: Finished difference Result 45273 states and 64584 transitions. [2019-09-08 12:42:37,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:42:37,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:42:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:37,210 INFO L225 Difference]: With dead ends: 45273 [2019-09-08 12:42:37,210 INFO L226 Difference]: Without dead ends: 29823 [2019-09-08 12:42:37,237 INFO L628 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-09-08 12:42:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29823 states. [2019-09-08 12:43:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29823 to 28637. [2019-09-08 12:43:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28637 states. [2019-09-08 12:43:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28637 states to 28637 states and 40626 transitions. [2019-09-08 12:43:01,743 INFO L78 Accepts]: Start accepts. Automaton has 28637 states and 40626 transitions. Word has length 144 [2019-09-08 12:43:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:01,743 INFO L475 AbstractCegarLoop]: Abstraction has 28637 states and 40626 transitions. [2019-09-08 12:43:01,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:43:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 28637 states and 40626 transitions. [2019-09-08 12:43:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 12:43:01,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:01,744 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:01,744 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:01,744 INFO L82 PathProgramCache]: Analyzing trace with hash 814685857, now seen corresponding path program 1 times [2019-09-08 12:43:01,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:01,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:01,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:43:01,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:43:01,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:43:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:43:01,804 INFO L87 Difference]: Start difference. First operand 28637 states and 40626 transitions. Second operand 3 states. [2019-09-08 12:43:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:34,528 INFO L93 Difference]: Finished difference Result 60414 states and 85923 transitions. [2019-09-08 12:43:34,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:43:34,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-08 12:43:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:34,567 INFO L225 Difference]: With dead ends: 60414 [2019-09-08 12:43:34,567 INFO L226 Difference]: Without dead ends: 40011 [2019-09-08 12:43:34,585 INFO L628 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-09-08 12:43:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40011 states. [2019-09-08 12:44:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40011 to 38405. [2019-09-08 12:44:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38405 states. [2019-09-08 12:44:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38405 states to 38405 states and 54346 transitions. [2019-09-08 12:44:06,843 INFO L78 Accepts]: Start accepts. Automaton has 38405 states and 54346 transitions. Word has length 145 [2019-09-08 12:44:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:06,844 INFO L475 AbstractCegarLoop]: Abstraction has 38405 states and 54346 transitions. [2019-09-08 12:44:06,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 38405 states and 54346 transitions. [2019-09-08 12:44:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 12:44:06,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:06,845 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:06,845 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:06,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1733689799, now seen corresponding path program 1 times [2019-09-08 12:44:06,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:06,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:06,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:06,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:06,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:06,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:44:06,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:44:06,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:44:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:44:06,948 INFO L87 Difference]: Start difference. First operand 38405 states and 54346 transitions. Second operand 7 states. [2019-09-08 12:45:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:31,342 INFO L93 Difference]: Finished difference Result 135802 states and 190417 transitions. [2019-09-08 12:45:31,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:45:31,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-08 12:45:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:31,444 INFO L225 Difference]: With dead ends: 135802 [2019-09-08 12:45:31,445 INFO L226 Difference]: Without dead ends: 97512 [2019-09-08 12:45:31,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:45:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97512 states.