java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:02:07,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:02:07,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:02:07,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:02:07,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:02:07,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:02:07,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:02:07,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:02:07,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:02:07,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:02:07,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:02:07,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:02:07,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:02:07,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:02:07,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:02:07,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:02:07,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:02:07,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:02:07,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:02:07,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:02:07,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:02:07,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:02:07,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:02:08,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:02:08,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:02:08,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:02:08,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:02:08,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:02:08,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:02:08,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:02:08,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:02:08,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:02:08,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:02:08,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:02:08,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:02:08,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:02:08,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:02:08,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:02:08,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:02:08,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:02:08,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:02:08,020 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 11:02:08,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:02:08,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:02:08,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:02:08,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:02:08,035 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:02:08,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:02:08,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:02:08,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:02:08,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:02:08,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:02:08,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:02:08,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:02:08,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:02:08,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:02:08,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:02:08,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:02:08,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:02:08,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:02:08,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:02:08,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:02:08,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:02:08,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:02:08,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:02:08,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:02:08,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:02:08,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:02:08,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:02:08,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:02:08,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:02:08,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:02:08,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:02:08,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:02:08,092 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:02:08,093 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:02:08,093 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:02:08,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58be17490/7e784a0ede944795b83bb3d3d2171c7c/FLAGda1278e25 [2019-09-08 11:02:09,036 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:02:09,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:02:09,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58be17490/7e784a0ede944795b83bb3d3d2171c7c/FLAGda1278e25 [2019-09-08 11:02:09,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58be17490/7e784a0ede944795b83bb3d3d2171c7c [2019-09-08 11:02:09,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:02:09,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:02:09,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:02:09,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:02:09,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:02:09,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:02:09" (1/1) ... [2019-09-08 11:02:09,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b55efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:09, skipping insertion in model container [2019-09-08 11:02:09,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:02:09" (1/1) ... [2019-09-08 11:02:09,507 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:02:09,847 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:02:12,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:02:12,080 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:02:13,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:02:13,393 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:02:13,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13 WrapperNode [2019-09-08 11:02:13,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:02:13,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:02:13,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:02:13,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:02:13,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... [2019-09-08 11:02:13,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... [2019-09-08 11:02:13,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... [2019-09-08 11:02:13,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... [2019-09-08 11:02:13,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... [2019-09-08 11:02:13,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... [2019-09-08 11:02:13,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... [2019-09-08 11:02:13,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:02:13,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:02:13,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:02:13,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:02:13,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:02:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:02:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:02:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:02:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:02:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:02:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:02:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:02:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:02:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:02:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:02:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:02:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:02:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:02:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:02:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:02:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:02:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:02:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:02:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:02:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:02:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:02:24,226 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:02:24,227 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:02:24,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:02:24 BoogieIcfgContainer [2019-09-08 11:02:24,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:02:24,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:02:24,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:02:24,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:02:24,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:02:09" (1/3) ... [2019-09-08 11:02:24,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424575f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:02:24, skipping insertion in model container [2019-09-08 11:02:24,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:13" (2/3) ... [2019-09-08 11:02:24,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424575f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:02:24, skipping insertion in model container [2019-09-08 11:02:24,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:02:24" (3/3) ... [2019-09-08 11:02:24,246 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:02:24,257 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:02:24,267 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:02:24,284 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:02:24,329 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:02:24,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:02:24,329 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:02:24,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:02:24,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:02:24,330 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:02:24,330 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:02:24,330 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:02:24,330 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:02:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states. [2019-09-08 11:02:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:02:24,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:24,423 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] [2019-09-08 11:02:24,425 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1674437233, now seen corresponding path program 1 times [2019-09-08 11:02:24,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:24,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:24,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:25,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:25,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:25,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:25,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:25,497 INFO L87 Difference]: Start difference. First operand 2873 states. Second operand 5 states. [2019-09-08 11:02:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:28,407 INFO L93 Difference]: Finished difference Result 4279 states and 8049 transitions. [2019-09-08 11:02:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:28,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 11:02:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:28,462 INFO L225 Difference]: With dead ends: 4279 [2019-09-08 11:02:28,463 INFO L226 Difference]: Without dead ends: 2269 [2019-09-08 11:02:28,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2019-09-08 11:02:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2267. [2019-09-08 11:02:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-09-08 11:02:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 2958 transitions. [2019-09-08 11:02:28,689 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 2958 transitions. Word has length 82 [2019-09-08 11:02:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:28,690 INFO L475 AbstractCegarLoop]: Abstraction has 2267 states and 2958 transitions. [2019-09-08 11:02:28,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 2958 transitions. [2019-09-08 11:02:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:02:28,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:28,701 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] [2019-09-08 11:02:28,702 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash -239959712, now seen corresponding path program 1 times [2019-09-08 11:02:28,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:28,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:28,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:28,997 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 11:02:28,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:28,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:29,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:29,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:29,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:29,001 INFO L87 Difference]: Start difference. First operand 2267 states and 2958 transitions. Second operand 3 states. [2019-09-08 11:02:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:29,134 INFO L93 Difference]: Finished difference Result 4089 states and 5498 transitions. [2019-09-08 11:02:29,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:29,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 11:02:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:29,156 INFO L225 Difference]: With dead ends: 4089 [2019-09-08 11:02:29,157 INFO L226 Difference]: Without dead ends: 3531 [2019-09-08 11:02:29,160 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 11:02:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2019-09-08 11:02:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3528. [2019-09-08 11:02:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3528 states. [2019-09-08 11:02:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 4638 transitions. [2019-09-08 11:02:29,281 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 4638 transitions. Word has length 83 [2019-09-08 11:02:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:29,282 INFO L475 AbstractCegarLoop]: Abstraction has 3528 states and 4638 transitions. [2019-09-08 11:02:29,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 4638 transitions. [2019-09-08 11:02:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:02:29,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:29,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] [2019-09-08 11:02:29,295 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1850342947, now seen corresponding path program 1 times [2019-09-08 11:02:29,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:29,676 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 11:02:29,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:29,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:02:29,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:02:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:02:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:02:29,678 INFO L87 Difference]: Start difference. First operand 3528 states and 4638 transitions. Second operand 6 states. [2019-09-08 11:02:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:31,499 INFO L93 Difference]: Finished difference Result 6702 states and 9222 transitions. [2019-09-08 11:02:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:31,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 11:02:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:31,520 INFO L225 Difference]: With dead ends: 6702 [2019-09-08 11:02:31,521 INFO L226 Difference]: Without dead ends: 4066 [2019-09-08 11:02:31,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:02:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2019-09-08 11:02:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 4062. [2019-09-08 11:02:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-09-08 11:02:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5666 transitions. [2019-09-08 11:02:31,670 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5666 transitions. Word has length 83 [2019-09-08 11:02:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:31,671 INFO L475 AbstractCegarLoop]: Abstraction has 4062 states and 5666 transitions. [2019-09-08 11:02:31,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:02:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5666 transitions. [2019-09-08 11:02:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:02:31,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:31,680 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] [2019-09-08 11:02:31,680 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2021095196, now seen corresponding path program 1 times [2019-09-08 11:02:31,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:31,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:31,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:31,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:31,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:31,916 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 11:02:31,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:31,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:31,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:31,918 INFO L87 Difference]: Start difference. First operand 4062 states and 5666 transitions. Second operand 3 states. [2019-09-08 11:02:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:32,155 INFO L93 Difference]: Finished difference Result 7872 states and 11251 transitions. [2019-09-08 11:02:32,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:32,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:02:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:32,188 INFO L225 Difference]: With dead ends: 7872 [2019-09-08 11:02:32,188 INFO L226 Difference]: Without dead ends: 5872 [2019-09-08 11:02:32,196 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 11:02:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5872 states. [2019-09-08 11:02:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5872 to 5862. [2019-09-08 11:02:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5862 states. [2019-09-08 11:02:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 8156 transitions. [2019-09-08 11:02:32,728 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 8156 transitions. Word has length 84 [2019-09-08 11:02:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:32,729 INFO L475 AbstractCegarLoop]: Abstraction has 5862 states and 8156 transitions. [2019-09-08 11:02:32,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 8156 transitions. [2019-09-08 11:02:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:02:32,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:32,752 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] [2019-09-08 11:02:32,753 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:32,754 INFO L82 PathProgramCache]: Analyzing trace with hash 226289808, now seen corresponding path program 1 times [2019-09-08 11:02:32,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:32,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:32,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:32,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:32,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:33,104 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 11:02:33,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:33,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:33,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:33,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:33,107 INFO L87 Difference]: Start difference. First operand 5862 states and 8156 transitions. Second operand 3 states. [2019-09-08 11:02:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:33,640 INFO L93 Difference]: Finished difference Result 11291 states and 16334 transitions. [2019-09-08 11:02:33,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:33,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:02:33,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:33,697 INFO L225 Difference]: With dead ends: 11291 [2019-09-08 11:02:33,698 INFO L226 Difference]: Without dead ends: 8396 [2019-09-08 11:02:33,713 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 11:02:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8396 states. [2019-09-08 11:02:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8396 to 8394. [2019-09-08 11:02:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8394 states. [2019-09-08 11:02:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8394 states to 8394 states and 11873 transitions. [2019-09-08 11:02:34,262 INFO L78 Accepts]: Start accepts. Automaton has 8394 states and 11873 transitions. Word has length 84 [2019-09-08 11:02:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:34,263 INFO L475 AbstractCegarLoop]: Abstraction has 8394 states and 11873 transitions. [2019-09-08 11:02:34,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 8394 states and 11873 transitions. [2019-09-08 11:02:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:02:34,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:34,279 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] [2019-09-08 11:02:34,279 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1845113359, now seen corresponding path program 1 times [2019-09-08 11:02:34,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:34,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:34,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:34,563 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 11:02:34,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:34,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:34,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:34,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:34,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:34,566 INFO L87 Difference]: Start difference. First operand 8394 states and 11873 transitions. Second operand 5 states. [2019-09-08 11:02:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:36,937 INFO L93 Difference]: Finished difference Result 18387 states and 26540 transitions. [2019-09-08 11:02:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:36,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 11:02:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:36,990 INFO L225 Difference]: With dead ends: 18387 [2019-09-08 11:02:36,990 INFO L226 Difference]: Without dead ends: 11773 [2019-09-08 11:02:37,008 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 11:02:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11773 states. [2019-09-08 11:02:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11773 to 11771. [2019-09-08 11:02:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11771 states. [2019-09-08 11:02:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 16734 transitions. [2019-09-08 11:02:37,584 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 16734 transitions. Word has length 84 [2019-09-08 11:02:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:37,584 INFO L475 AbstractCegarLoop]: Abstraction has 11771 states and 16734 transitions. [2019-09-08 11:02:37,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 16734 transitions. [2019-09-08 11:02:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:02:37,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:37,600 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] [2019-09-08 11:02:37,600 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1476634066, now seen corresponding path program 1 times [2019-09-08 11:02:37,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:37,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:37,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:37,880 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 11:02:37,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:37,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:37,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:37,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:37,883 INFO L87 Difference]: Start difference. First operand 11771 states and 16734 transitions. Second operand 3 states. [2019-09-08 11:02:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:38,758 INFO L93 Difference]: Finished difference Result 23863 states and 34760 transitions. [2019-09-08 11:02:38,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:38,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:02:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:38,800 INFO L225 Difference]: With dead ends: 23863 [2019-09-08 11:02:38,800 INFO L226 Difference]: Without dead ends: 16342 [2019-09-08 11:02:38,820 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 11:02:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16342 states. [2019-09-08 11:02:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16342 to 16300. [2019-09-08 11:02:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16300 states. [2019-09-08 11:02:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16300 states to 16300 states and 23112 transitions. [2019-09-08 11:02:39,535 INFO L78 Accepts]: Start accepts. Automaton has 16300 states and 23112 transitions. Word has length 84 [2019-09-08 11:02:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:39,536 INFO L475 AbstractCegarLoop]: Abstraction has 16300 states and 23112 transitions. [2019-09-08 11:02:39,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16300 states and 23112 transitions. [2019-09-08 11:02:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:02:39,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:39,556 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] [2019-09-08 11:02:39,556 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1323398100, now seen corresponding path program 1 times [2019-09-08 11:02:39,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:39,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:39,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:39,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:39,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:39,832 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 11:02:39,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:39,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:39,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:39,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:39,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:39,835 INFO L87 Difference]: Start difference. First operand 16300 states and 23112 transitions. Second operand 5 states. [2019-09-08 11:02:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:41,740 INFO L93 Difference]: Finished difference Result 42311 states and 60959 transitions. [2019-09-08 11:02:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:41,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 11:02:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:41,810 INFO L225 Difference]: With dead ends: 42311 [2019-09-08 11:02:41,810 INFO L226 Difference]: Without dead ends: 26846 [2019-09-08 11:02:41,854 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 11:02:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26846 states. [2019-09-08 11:02:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26846 to 26844. [2019-09-08 11:02:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26844 states. [2019-09-08 11:02:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26844 states to 26844 states and 38575 transitions. [2019-09-08 11:02:43,072 INFO L78 Accepts]: Start accepts. Automaton has 26844 states and 38575 transitions. Word has length 84 [2019-09-08 11:02:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:43,072 INFO L475 AbstractCegarLoop]: Abstraction has 26844 states and 38575 transitions. [2019-09-08 11:02:43,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 26844 states and 38575 transitions. [2019-09-08 11:02:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:02:43,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:43,096 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] [2019-09-08 11:02:43,097 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1115536880, now seen corresponding path program 1 times [2019-09-08 11:02:43,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:43,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:43,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:43,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:43,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 11:02:43,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:43,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:43,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:43,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:43,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:43,292 INFO L87 Difference]: Start difference. First operand 26844 states and 38575 transitions. Second operand 3 states. [2019-09-08 11:02:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:45,089 INFO L93 Difference]: Finished difference Result 59761 states and 86428 transitions. [2019-09-08 11:02:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:45,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-08 11:02:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:45,189 INFO L225 Difference]: With dead ends: 59761 [2019-09-08 11:02:45,190 INFO L226 Difference]: Without dead ends: 37451 [2019-09-08 11:02:45,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 11:02:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37451 states. [2019-09-08 11:02:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37451 to 37329. [2019-09-08 11:02:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37329 states. [2019-09-08 11:02:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37329 states to 37329 states and 52893 transitions. [2019-09-08 11:02:46,736 INFO L78 Accepts]: Start accepts. Automaton has 37329 states and 52893 transitions. Word has length 85 [2019-09-08 11:02:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:46,736 INFO L475 AbstractCegarLoop]: Abstraction has 37329 states and 52893 transitions. [2019-09-08 11:02:46,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 37329 states and 52893 transitions. [2019-09-08 11:02:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:02:46,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:46,773 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] [2019-09-08 11:02:46,773 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398392, now seen corresponding path program 1 times [2019-09-08 11:02:46,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:46,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:46,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:46,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:47,004 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 11:02:47,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:47,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:47,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:47,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:47,006 INFO L87 Difference]: Start difference. First operand 37329 states and 52893 transitions. Second operand 5 states. [2019-09-08 11:02:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:49,642 INFO L93 Difference]: Finished difference Result 87581 states and 124612 transitions. [2019-09-08 11:02:49,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:49,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:02:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:49,758 INFO L225 Difference]: With dead ends: 87581 [2019-09-08 11:02:49,758 INFO L226 Difference]: Without dead ends: 51528 [2019-09-08 11:02:49,811 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 11:02:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51528 states. [2019-09-08 11:02:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51528 to 51346. [2019-09-08 11:02:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51346 states. [2019-09-08 11:02:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51346 states to 51346 states and 72642 transitions. [2019-09-08 11:02:53,905 INFO L78 Accepts]: Start accepts. Automaton has 51346 states and 72642 transitions. Word has length 86 [2019-09-08 11:02:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:53,905 INFO L475 AbstractCegarLoop]: Abstraction has 51346 states and 72642 transitions. [2019-09-08 11:02:53,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51346 states and 72642 transitions. [2019-09-08 11:02:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:02:53,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:53,932 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] [2019-09-08 11:02:53,933 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1541878014, now seen corresponding path program 1 times [2019-09-08 11:02:53,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:53,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:53,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:53,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:54,179 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 11:02:54,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:54,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:54,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:54,181 INFO L87 Difference]: Start difference. First operand 51346 states and 72642 transitions. Second operand 7 states. [2019-09-08 11:03:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:06,788 INFO L93 Difference]: Finished difference Result 281486 states and 404957 transitions. [2019-09-08 11:03:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:06,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 11:03:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:07,188 INFO L225 Difference]: With dead ends: 281486 [2019-09-08 11:03:07,189 INFO L226 Difference]: Without dead ends: 261383 [2019-09-08 11:03:07,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:03:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261383 states. [2019-09-08 11:03:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261383 to 51482. [2019-09-08 11:03:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51482 states. [2019-09-08 11:03:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51482 states to 51482 states and 72818 transitions. [2019-09-08 11:03:11,322 INFO L78 Accepts]: Start accepts. Automaton has 51482 states and 72818 transitions. Word has length 87 [2019-09-08 11:03:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:11,322 INFO L475 AbstractCegarLoop]: Abstraction has 51482 states and 72818 transitions. [2019-09-08 11:03:11,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:03:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 51482 states and 72818 transitions. [2019-09-08 11:03:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:03:11,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:11,337 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] [2019-09-08 11:03:11,338 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash -623000750, now seen corresponding path program 1 times [2019-09-08 11:03:11,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:11,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:11,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:11,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:11,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:11,568 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 11:03:11,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:11,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:03:11,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:03:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:03:11,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:03:11,570 INFO L87 Difference]: Start difference. First operand 51482 states and 72818 transitions. Second operand 7 states. [2019-09-08 11:03:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:27,038 INFO L93 Difference]: Finished difference Result 241054 states and 346338 transitions. [2019-09-08 11:03:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:27,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 11:03:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:27,390 INFO L225 Difference]: With dead ends: 241054 [2019-09-08 11:03:27,391 INFO L226 Difference]: Without dead ends: 217523 [2019-09-08 11:03:27,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:03:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217523 states. [2019-09-08 11:03:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217523 to 51794. [2019-09-08 11:03:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51794 states. [2019-09-08 11:03:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51794 states to 51794 states and 73230 transitions. [2019-09-08 11:03:31,737 INFO L78 Accepts]: Start accepts. Automaton has 51794 states and 73230 transitions. Word has length 87 [2019-09-08 11:03:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:31,737 INFO L475 AbstractCegarLoop]: Abstraction has 51794 states and 73230 transitions. [2019-09-08 11:03:31,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:03:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 51794 states and 73230 transitions. [2019-09-08 11:03:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:03:31,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:31,753 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] [2019-09-08 11:03:31,754 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1810714729, now seen corresponding path program 1 times [2019-09-08 11:03:31,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:31,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:31,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:32,037 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 11:03:32,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:32,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:03:32,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:03:32,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:03:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:03:32,039 INFO L87 Difference]: Start difference. First operand 51794 states and 73230 transitions. Second operand 7 states. [2019-09-08 11:03:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:50,521 INFO L93 Difference]: Finished difference Result 239201 states and 343713 transitions. [2019-09-08 11:03:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:50,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 11:03:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:50,811 INFO L225 Difference]: With dead ends: 239201 [2019-09-08 11:03:50,811 INFO L226 Difference]: Without dead ends: 213281 [2019-09-08 11:03:50,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:03:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213281 states. [2019-09-08 11:03:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213281 to 52492. [2019-09-08 11:03:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52492 states. [2019-09-08 11:03:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52492 states to 52492 states and 74158 transitions. [2019-09-08 11:03:55,810 INFO L78 Accepts]: Start accepts. Automaton has 52492 states and 74158 transitions. Word has length 87 [2019-09-08 11:03:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:55,810 INFO L475 AbstractCegarLoop]: Abstraction has 52492 states and 74158 transitions. [2019-09-08 11:03:55,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:03:55,810 INFO L276 IsEmpty]: Start isEmpty. Operand 52492 states and 74158 transitions. [2019-09-08 11:03:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:03:55,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:55,834 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] [2019-09-08 11:03:55,834 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -691120451, now seen corresponding path program 1 times [2019-09-08 11:03:55,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:55,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:55,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:56,060 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 11:03:56,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:56,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:03:56,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:03:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:03:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:03:56,062 INFO L87 Difference]: Start difference. First operand 52492 states and 74158 transitions. Second operand 7 states. [2019-09-08 11:04:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:13,660 INFO L93 Difference]: Finished difference Result 194104 states and 278115 transitions. [2019-09-08 11:04:13,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:04:13,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 11:04:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:13,877 INFO L225 Difference]: With dead ends: 194104 [2019-09-08 11:04:13,877 INFO L226 Difference]: Without dead ends: 167324 [2019-09-08 11:04:13,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:04:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167324 states. [2019-09-08 11:04:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167324 to 52576. [2019-09-08 11:04:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52576 states. [2019-09-08 11:04:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52576 states to 52576 states and 74266 transitions. [2019-09-08 11:04:19,178 INFO L78 Accepts]: Start accepts. Automaton has 52576 states and 74266 transitions. Word has length 87 [2019-09-08 11:04:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:19,178 INFO L475 AbstractCegarLoop]: Abstraction has 52576 states and 74266 transitions. [2019-09-08 11:04:19,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:04:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 52576 states and 74266 transitions. [2019-09-08 11:04:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:04:19,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:19,205 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] [2019-09-08 11:04:19,205 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2084664816, now seen corresponding path program 1 times [2019-09-08 11:04:19,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:19,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:19,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:19,495 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 11:04:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:04:19,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:04:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:04:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:04:19,497 INFO L87 Difference]: Start difference. First operand 52576 states and 74266 transitions. Second operand 7 states. [2019-09-08 11:04:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:42,918 INFO L93 Difference]: Finished difference Result 211978 states and 304714 transitions. [2019-09-08 11:04:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:04:42,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 11:04:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:43,150 INFO L225 Difference]: With dead ends: 211978 [2019-09-08 11:04:43,150 INFO L226 Difference]: Without dead ends: 187514 [2019-09-08 11:04:43,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:04:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187514 states. [2019-09-08 11:04:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187514 to 52867. [2019-09-08 11:04:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52867 states. [2019-09-08 11:04:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52867 states to 52867 states and 74667 transitions. [2019-09-08 11:04:49,134 INFO L78 Accepts]: Start accepts. Automaton has 52867 states and 74667 transitions. Word has length 87 [2019-09-08 11:04:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:49,134 INFO L475 AbstractCegarLoop]: Abstraction has 52867 states and 74667 transitions. [2019-09-08 11:04:49,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:04:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 52867 states and 74667 transitions. [2019-09-08 11:04:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:04:49,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:49,151 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] [2019-09-08 11:04:49,151 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 577704581, now seen corresponding path program 1 times [2019-09-08 11:04:49,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:49,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:49,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:49,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:04:49,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:04:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:04:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:04:49,394 INFO L87 Difference]: Start difference. First operand 52867 states and 74667 transitions. Second operand 7 states. [2019-09-08 11:05:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:15,135 INFO L93 Difference]: Finished difference Result 212258 states and 305082 transitions. [2019-09-08 11:05:15,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:05:15,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:05:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:15,367 INFO L225 Difference]: With dead ends: 212258 [2019-09-08 11:05:15,367 INFO L226 Difference]: Without dead ends: 187746 [2019-09-08 11:05:15,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:05:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187746 states. [2019-09-08 11:05:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187746 to 53282. [2019-09-08 11:05:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53282 states. [2019-09-08 11:05:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53282 states to 53282 states and 75253 transitions. [2019-09-08 11:05:21,953 INFO L78 Accepts]: Start accepts. Automaton has 53282 states and 75253 transitions. Word has length 88 [2019-09-08 11:05:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:21,953 INFO L475 AbstractCegarLoop]: Abstraction has 53282 states and 75253 transitions. [2019-09-08 11:05:21,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:05:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53282 states and 75253 transitions. [2019-09-08 11:05:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:05:21,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:21,970 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] [2019-09-08 11:05:21,970 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1288112849, now seen corresponding path program 1 times [2019-09-08 11:05:21,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:21,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:21,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:21,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:21,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:22,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 11:05:22,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:05:22,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:05:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:05:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:05:22,321 INFO L87 Difference]: Start difference. First operand 53282 states and 75253 transitions. Second operand 9 states. [2019-09-08 11:05:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:51,706 INFO L93 Difference]: Finished difference Result 230718 states and 333349 transitions. [2019-09-08 11:05:51,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:05:51,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 11:05:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:51,966 INFO L225 Difference]: With dead ends: 230718 [2019-09-08 11:05:51,966 INFO L226 Difference]: Without dead ends: 193905 [2019-09-08 11:05:52,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:05:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193905 states. [2019-09-08 11:05:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193905 to 53250. [2019-09-08 11:05:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53250 states. [2019-09-08 11:05:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53250 states to 53250 states and 75189 transitions. [2019-09-08 11:05:59,253 INFO L78 Accepts]: Start accepts. Automaton has 53250 states and 75189 transitions. Word has length 88 [2019-09-08 11:05:59,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:59,253 INFO L475 AbstractCegarLoop]: Abstraction has 53250 states and 75189 transitions. [2019-09-08 11:05:59,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:05:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 53250 states and 75189 transitions. [2019-09-08 11:05:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:05:59,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:59,271 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] [2019-09-08 11:05:59,271 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 54769048, now seen corresponding path program 1 times [2019-09-08 11:05:59,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:59,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:59,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:59,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:05:59,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:05:59,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:05:59,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:05:59,556 INFO L87 Difference]: Start difference. First operand 53250 states and 75189 transitions. Second operand 8 states. [2019-09-08 11:06:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:25,786 INFO L93 Difference]: Finished difference Result 204803 states and 295619 transitions. [2019-09-08 11:06:25,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:06:25,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-09-08 11:06:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:25,993 INFO L225 Difference]: With dead ends: 204803 [2019-09-08 11:06:25,993 INFO L226 Difference]: Without dead ends: 164334 [2019-09-08 11:06:26,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:06:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164334 states. [2019-09-08 11:06:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164334 to 51669. [2019-09-08 11:06:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51669 states. [2019-09-08 11:06:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51669 states to 51669 states and 72997 transitions. [2019-09-08 11:06:33,342 INFO L78 Accepts]: Start accepts. Automaton has 51669 states and 72997 transitions. Word has length 88 [2019-09-08 11:06:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:33,343 INFO L475 AbstractCegarLoop]: Abstraction has 51669 states and 72997 transitions. [2019-09-08 11:06:33,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:06:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 51669 states and 72997 transitions. [2019-09-08 11:06:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:06:33,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:33,358 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] [2019-09-08 11:06:33,359 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 222147475, now seen corresponding path program 1 times [2019-09-08 11:06:33,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:33,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:33,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:33,568 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 11:06:33,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:33,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:06:33,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:06:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:06:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:06:33,569 INFO L87 Difference]: Start difference. First operand 51669 states and 72997 transitions. Second operand 7 states. [2019-09-08 11:07:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:09,684 INFO L93 Difference]: Finished difference Result 237405 states and 341695 transitions. [2019-09-08 11:07:09,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:07:09,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:07:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:10,129 INFO L225 Difference]: With dead ends: 237405 [2019-09-08 11:07:10,129 INFO L226 Difference]: Without dead ends: 215304 [2019-09-08 11:07:10,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:07:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215304 states. [2019-09-08 11:07:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215304 to 51744. [2019-09-08 11:07:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51744 states. [2019-09-08 11:07:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51744 states to 51744 states and 73097 transitions. [2019-09-08 11:07:18,511 INFO L78 Accepts]: Start accepts. Automaton has 51744 states and 73097 transitions. Word has length 88 [2019-09-08 11:07:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:18,511 INFO L475 AbstractCegarLoop]: Abstraction has 51744 states and 73097 transitions. [2019-09-08 11:07:18,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:07:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 51744 states and 73097 transitions. [2019-09-08 11:07:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:07:18,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:18,528 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] [2019-09-08 11:07:18,528 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash -249843814, now seen corresponding path program 1 times [2019-09-08 11:07:18,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:18,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:18,736 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 11:07:18,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:18,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:07:18,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:07:18,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:07:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:07:18,739 INFO L87 Difference]: Start difference. First operand 51744 states and 73097 transitions. Second operand 7 states. [2019-09-08 11:07:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:57,185 INFO L93 Difference]: Finished difference Result 235571 states and 339143 transitions. [2019-09-08 11:07:57,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:07:57,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:07:57,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:57,486 INFO L225 Difference]: With dead ends: 235571 [2019-09-08 11:07:57,486 INFO L226 Difference]: Without dead ends: 210923 [2019-09-08 11:07:57,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:07:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210923 states. [2019-09-08 11:08:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210923 to 51892. [2019-09-08 11:08:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51892 states. [2019-09-08 11:08:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51892 states to 51892 states and 73295 transitions. [2019-09-08 11:08:05,794 INFO L78 Accepts]: Start accepts. Automaton has 51892 states and 73295 transitions. Word has length 88 [2019-09-08 11:08:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:05,794 INFO L475 AbstractCegarLoop]: Abstraction has 51892 states and 73295 transitions. [2019-09-08 11:08:05,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:08:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 51892 states and 73295 transitions. [2019-09-08 11:08:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:08:05,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:05,810 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] [2019-09-08 11:08:05,810 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1973720315, now seen corresponding path program 1 times [2019-09-08 11:08:05,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:05,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:05,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:05,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:05,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:06,114 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 11:08:06,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:06,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:08:06,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:08:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:08:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:08:06,116 INFO L87 Difference]: Start difference. First operand 51892 states and 73295 transitions. Second operand 9 states. [2019-09-08 11:08:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:41,044 INFO L93 Difference]: Finished difference Result 215858 states and 311948 transitions. [2019-09-08 11:08:41,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:08:41,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 11:08:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:41,268 INFO L225 Difference]: With dead ends: 215858 [2019-09-08 11:08:41,269 INFO L226 Difference]: Without dead ends: 177997 [2019-09-08 11:08:41,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:08:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177997 states. [2019-09-08 11:08:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177997 to 51321. [2019-09-08 11:08:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51321 states. [2019-09-08 11:08:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51321 states to 51321 states and 72515 transitions. [2019-09-08 11:08:50,294 INFO L78 Accepts]: Start accepts. Automaton has 51321 states and 72515 transitions. Word has length 88 [2019-09-08 11:08:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:50,295 INFO L475 AbstractCegarLoop]: Abstraction has 51321 states and 72515 transitions. [2019-09-08 11:08:50,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:08:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 51321 states and 72515 transitions. [2019-09-08 11:08:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:08:50,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:50,313 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] [2019-09-08 11:08:50,313 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1702801037, now seen corresponding path program 1 times [2019-09-08 11:08:50,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:50,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:50,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:50,582 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 11:08:50,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:50,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:08:50,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:08:50,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:08:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:08:50,583 INFO L87 Difference]: Start difference. First operand 51321 states and 72515 transitions. Second operand 9 states. [2019-09-08 11:09:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:30,493 INFO L93 Difference]: Finished difference Result 229030 states and 331156 transitions. [2019-09-08 11:09:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:09:30,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 11:09:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:30,751 INFO L225 Difference]: With dead ends: 229030 [2019-09-08 11:09:30,751 INFO L226 Difference]: Without dead ends: 192163 [2019-09-08 11:09:30,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:09:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192163 states. [2019-09-08 11:09:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192163 to 51262. [2019-09-08 11:09:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51262 states. [2019-09-08 11:09:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51262 states to 51262 states and 72426 transitions. [2019-09-08 11:09:40,430 INFO L78 Accepts]: Start accepts. Automaton has 51262 states and 72426 transitions. Word has length 88 [2019-09-08 11:09:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:40,431 INFO L475 AbstractCegarLoop]: Abstraction has 51262 states and 72426 transitions. [2019-09-08 11:09:40,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:09:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 51262 states and 72426 transitions. [2019-09-08 11:09:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:09:40,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:40,447 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] [2019-09-08 11:09:40,447 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash -958979885, now seen corresponding path program 1 times [2019-09-08 11:09:40,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:40,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:40,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:40,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:40,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:40,745 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 11:09:40,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:40,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:09:40,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:09:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:09:40,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:09:40,748 INFO L87 Difference]: Start difference. First operand 51262 states and 72426 transitions. Second operand 9 states. [2019-09-08 11:10:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:23,906 INFO L93 Difference]: Finished difference Result 229876 states and 334492 transitions. [2019-09-08 11:10:23,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:10:23,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 11:10:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:24,157 INFO L225 Difference]: With dead ends: 229876 [2019-09-08 11:10:24,157 INFO L226 Difference]: Without dead ends: 192961 [2019-09-08 11:10:24,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:10:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192961 states. [2019-09-08 11:10:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192961 to 51179. [2019-09-08 11:10:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51179 states. [2019-09-08 11:10:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51179 states to 51179 states and 72305 transitions. [2019-09-08 11:10:34,247 INFO L78 Accepts]: Start accepts. Automaton has 51179 states and 72305 transitions. Word has length 88 [2019-09-08 11:10:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:34,247 INFO L475 AbstractCegarLoop]: Abstraction has 51179 states and 72305 transitions. [2019-09-08 11:10:34,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:10:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 51179 states and 72305 transitions. [2019-09-08 11:10:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:10:34,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:34,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] [2019-09-08 11:10:34,262 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash -121832170, now seen corresponding path program 1 times [2019-09-08 11:10:34,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:34,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:34,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:34,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:34,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:10:34,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:10:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:10:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:10:34,467 INFO L87 Difference]: Start difference. First operand 51179 states and 72305 transitions. Second operand 7 states. [2019-09-08 11:11:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:23,972 INFO L93 Difference]: Finished difference Result 234710 states and 337954 transitions. [2019-09-08 11:11:23,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:11:23,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:11:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:24,250 INFO L225 Difference]: With dead ends: 234710 [2019-09-08 11:11:24,250 INFO L226 Difference]: Without dead ends: 210104 [2019-09-08 11:11:24,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:11:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210104 states. [2019-09-08 11:11:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210104 to 51284. [2019-09-08 11:11:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51284 states. [2019-09-08 11:11:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51284 states to 51284 states and 72445 transitions. [2019-09-08 11:11:34,625 INFO L78 Accepts]: Start accepts. Automaton has 51284 states and 72445 transitions. Word has length 88 [2019-09-08 11:11:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:34,625 INFO L475 AbstractCegarLoop]: Abstraction has 51284 states and 72445 transitions. [2019-09-08 11:11:34,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:11:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 51284 states and 72445 transitions. [2019-09-08 11:11:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:11:34,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:34,641 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] [2019-09-08 11:11:34,641 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash 946074357, now seen corresponding path program 1 times [2019-09-08 11:11:34,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:34,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:34,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:34,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:35,349 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 11:11:35,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:35,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:11:35,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:11:35,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:11:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:11:35,350 INFO L87 Difference]: Start difference. First operand 51284 states and 72445 transitions. Second operand 12 states. [2019-09-08 11:12:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:40,924 INFO L93 Difference]: Finished difference Result 298130 states and 432843 transitions. [2019-09-08 11:12:40,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:12:40,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-08 11:12:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:41,279 INFO L225 Difference]: With dead ends: 298130 [2019-09-08 11:12:41,280 INFO L226 Difference]: Without dead ends: 259765 [2019-09-08 11:12:41,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:12:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259765 states. [2019-09-08 11:12:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259765 to 49507. [2019-09-08 11:12:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49507 states. [2019-09-08 11:12:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49507 states to 49507 states and 70119 transitions. [2019-09-08 11:12:53,081 INFO L78 Accepts]: Start accepts. Automaton has 49507 states and 70119 transitions. Word has length 89 [2019-09-08 11:12:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:53,081 INFO L475 AbstractCegarLoop]: Abstraction has 49507 states and 70119 transitions. [2019-09-08 11:12:53,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:12:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 49507 states and 70119 transitions. [2019-09-08 11:12:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:12:53,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:53,096 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] [2019-09-08 11:12:53,096 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash -196813656, now seen corresponding path program 1 times [2019-09-08 11:12:53,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:53,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:53,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:53,943 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 11:12:53,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:53,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:12:53,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:12:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:12:53,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:12:53,944 INFO L87 Difference]: Start difference. First operand 49507 states and 70119 transitions. Second operand 15 states. [2019-09-08 11:14:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:55,132 INFO L93 Difference]: Finished difference Result 459638 states and 669203 transitions. [2019-09-08 11:14:55,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 11:14:55,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-09-08 11:14:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:55,784 INFO L225 Difference]: With dead ends: 459638 [2019-09-08 11:14:55,785 INFO L226 Difference]: Without dead ends: 422853 [2019-09-08 11:14:56,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:14:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422853 states.