java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:34:32,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:34:32,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:34:32,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:34:32,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:34:32,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:34:32,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:34:32,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:34:32,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:34:32,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:34:32,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:34:32,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:34:32,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:34:32,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:34:32,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:34:32,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:34:32,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:34:32,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:34:32,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:34:32,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:34:32,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:34:32,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:34:32,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:34:32,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:34:32,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:34:32,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:34:32,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:34:32,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:34:32,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:34:32,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:34:32,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:34:32,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:34:32,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:34:32,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:34:32,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:34:32,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:34:32,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:34:32,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:34:32,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:34:32,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:34:32,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:34:32,918 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 10:34:32,934 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:34:32,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:34:32,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:34:32,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:34:32,936 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:34:32,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:34:32,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:34:32,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:34:32,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:34:32,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:34:32,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:34:32,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:34:32,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:34:32,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:34:32,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:34:32,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:34:32,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:34:32,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:34:32,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:34:32,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:34:32,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:34:32,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:34:32,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:34:32,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:34:32,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:34:32,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:34:32,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:34:32,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:34:32,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:34:32,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:34:32,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:34:32,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:34:32,993 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:34:32,993 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:34:32,994 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:34:33,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73771313/2e4e1298fd684332862455ab7c3e435e/FLAGcc8f896f9 [2019-09-08 10:34:33,592 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:34:33,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:34:33,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73771313/2e4e1298fd684332862455ab7c3e435e/FLAGcc8f896f9 [2019-09-08 10:34:33,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73771313/2e4e1298fd684332862455ab7c3e435e [2019-09-08 10:34:33,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:34:33,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:34:33,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:34:33,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:34:33,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:34:33,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:34:33" (1/1) ... [2019-09-08 10:34:33,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cf39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:33, skipping insertion in model container [2019-09-08 10:34:33,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:34:33" (1/1) ... [2019-09-08 10:34:33,934 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:34:33,994 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:34:34,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:34:34,445 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:34:34,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:34:34,558 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:34:34,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34 WrapperNode [2019-09-08 10:34:34,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:34:34,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:34:34,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:34:34,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:34:34,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (1/1) ... [2019-09-08 10:34:34,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (1/1) ... [2019-09-08 10:34:34,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (1/1) ... [2019-09-08 10:34:34,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (1/1) ... [2019-09-08 10:34:34,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (1/1) ... [2019-09-08 10:34:34,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (1/1) ... [2019-09-08 10:34:34,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (1/1) ... [2019-09-08 10:34:34,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:34:34,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:34:34,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:34:34,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:34:34,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (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 10:34:34,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:34:34,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:34:34,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:34:34,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:34:34,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:34:34,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:34:34,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:34:34,694 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:34:34,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:34:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:34:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:34:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:34:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:34:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:34:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:34:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:34:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:34:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:34:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:34:35,447 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:34:35,448 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:34:35,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:34:35 BoogieIcfgContainer [2019-09-08 10:34:35,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:34:35,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:34:35,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:34:35,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:34:35,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:34:33" (1/3) ... [2019-09-08 10:34:35,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd79dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:34:35, skipping insertion in model container [2019-09-08 10:34:35,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:34" (2/3) ... [2019-09-08 10:34:35,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd79dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:34:35, skipping insertion in model container [2019-09-08 10:34:35,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:34:35" (3/3) ... [2019-09-08 10:34:35,458 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:34:35,468 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:34:35,477 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:34:35,496 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:34:35,531 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:34:35,532 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:34:35,532 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:34:35,532 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:34:35,533 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:34:35,533 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:34:35,533 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:34:35,533 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:34:35,533 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:34:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-09-08 10:34:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:34:35,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:35,570 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] [2019-09-08 10:34:35,573 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash -418135505, now seen corresponding path program 1 times [2019-09-08 10:34:35,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:35,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:35,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:35,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:35,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:36,075 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 10:34:36,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:36,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:34:36,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:34:36,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:34:36,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:34:36,101 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 6 states. [2019-09-08 10:34:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:36,528 INFO L93 Difference]: Finished difference Result 790 states and 1253 transitions. [2019-09-08 10:34:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:34:36,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-09-08 10:34:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:36,563 INFO L225 Difference]: With dead ends: 790 [2019-09-08 10:34:36,563 INFO L226 Difference]: Without dead ends: 694 [2019-09-08 10:34:36,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:34:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-08 10:34:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 467. [2019-09-08 10:34:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-08 10:34:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 717 transitions. [2019-09-08 10:34:36,724 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 717 transitions. Word has length 53 [2019-09-08 10:34:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:36,726 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 717 transitions. [2019-09-08 10:34:36,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:34:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 717 transitions. [2019-09-08 10:34:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:34:36,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:36,731 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] [2019-09-08 10:34:36,731 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 914126686, now seen corresponding path program 1 times [2019-09-08 10:34:36,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:36,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:36,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:36,848 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 10:34:36,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:36,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:36,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:36,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:36,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:36,852 INFO L87 Difference]: Start difference. First operand 467 states and 717 transitions. Second operand 3 states. [2019-09-08 10:34:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:36,925 INFO L93 Difference]: Finished difference Result 1228 states and 1911 transitions. [2019-09-08 10:34:36,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:36,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:34:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:36,931 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 10:34:36,931 INFO L226 Difference]: Without dead ends: 832 [2019-09-08 10:34:36,938 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 10:34:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-09-08 10:34:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2019-09-08 10:34:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-09-08 10:34:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1272 transitions. [2019-09-08 10:34:36,992 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1272 transitions. Word has length 56 [2019-09-08 10:34:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:36,993 INFO L475 AbstractCegarLoop]: Abstraction has 830 states and 1272 transitions. [2019-09-08 10:34:36,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1272 transitions. [2019-09-08 10:34:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:34:37,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:37,004 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] [2019-09-08 10:34:37,004 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1604405792, now seen corresponding path program 1 times [2019-09-08 10:34:37,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:37,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:37,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:34:37,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:37,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:37,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:37,135 INFO L87 Difference]: Start difference. First operand 830 states and 1272 transitions. Second operand 3 states. [2019-09-08 10:34:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:37,279 INFO L93 Difference]: Finished difference Result 2170 states and 3341 transitions. [2019-09-08 10:34:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:37,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:34:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:37,287 INFO L225 Difference]: With dead ends: 2170 [2019-09-08 10:34:37,287 INFO L226 Difference]: Without dead ends: 1419 [2019-09-08 10:34:37,289 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 10:34:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-09-08 10:34:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2019-09-08 10:34:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2019-09-08 10:34:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2019-09-08 10:34:37,355 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 56 [2019-09-08 10:34:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:37,356 INFO L475 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2019-09-08 10:34:37,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2019-09-08 10:34:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:34:37,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:37,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] [2019-09-08 10:34:37,358 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1855390903, now seen corresponding path program 1 times [2019-09-08 10:34:37,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:37,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:37,436 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 10:34:37,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:37,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:37,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:37,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:37,438 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 transitions. Second operand 5 states. [2019-09-08 10:34:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:37,836 INFO L93 Difference]: Finished difference Result 3419 states and 5157 transitions. [2019-09-08 10:34:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:37,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-08 10:34:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:37,848 INFO L225 Difference]: With dead ends: 3419 [2019-09-08 10:34:37,848 INFO L226 Difference]: Without dead ends: 2033 [2019-09-08 10:34:37,852 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 10:34:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-09-08 10:34:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2016. [2019-09-08 10:34:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-09-08 10:34:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3007 transitions. [2019-09-08 10:34:38,024 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3007 transitions. Word has length 57 [2019-09-08 10:34:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:38,025 INFO L475 AbstractCegarLoop]: Abstraction has 2016 states and 3007 transitions. [2019-09-08 10:34:38,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3007 transitions. [2019-09-08 10:34:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:34:38,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:38,027 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] [2019-09-08 10:34:38,027 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1758328390, now seen corresponding path program 1 times [2019-09-08 10:34:38,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:38,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:38,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:38,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:38,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:38,128 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 10:34:38,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:38,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:34:38,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:34:38,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:34:38,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:34:38,129 INFO L87 Difference]: Start difference. First operand 2016 states and 3007 transitions. Second operand 6 states. [2019-09-08 10:34:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:38,763 INFO L93 Difference]: Finished difference Result 6448 states and 9646 transitions. [2019-09-08 10:34:38,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:38,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:34:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:38,796 INFO L225 Difference]: With dead ends: 6448 [2019-09-08 10:34:38,796 INFO L226 Difference]: Without dead ends: 4481 [2019-09-08 10:34:38,806 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 10:34:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2019-09-08 10:34:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4447. [2019-09-08 10:34:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4447 states. [2019-09-08 10:34:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6632 transitions. [2019-09-08 10:34:39,172 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6632 transitions. Word has length 57 [2019-09-08 10:34:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:39,172 INFO L475 AbstractCegarLoop]: Abstraction has 4447 states and 6632 transitions. [2019-09-08 10:34:39,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:34:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6632 transitions. [2019-09-08 10:34:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:34:39,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:39,175 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] [2019-09-08 10:34:39,176 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1592153131, now seen corresponding path program 1 times [2019-09-08 10:34:39,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:39,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:39,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:39,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 10:34:39,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:39,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:34:39,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:34:39,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:34:39,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:39,322 INFO L87 Difference]: Start difference. First operand 4447 states and 6632 transitions. Second operand 7 states. [2019-09-08 10:34:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:40,821 INFO L93 Difference]: Finished difference Result 19936 states and 29609 transitions. [2019-09-08 10:34:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:34:40,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:34:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:40,926 INFO L225 Difference]: With dead ends: 19936 [2019-09-08 10:34:40,926 INFO L226 Difference]: Without dead ends: 15932 [2019-09-08 10:34:40,943 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 10:34:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15932 states. [2019-09-08 10:34:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15932 to 4467. [2019-09-08 10:34:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2019-09-08 10:34:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 6656 transitions. [2019-09-08 10:34:41,472 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 6656 transitions. Word has length 58 [2019-09-08 10:34:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:41,473 INFO L475 AbstractCegarLoop]: Abstraction has 4467 states and 6656 transitions. [2019-09-08 10:34:41,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:34:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 6656 transitions. [2019-09-08 10:34:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:34:41,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:41,476 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] [2019-09-08 10:34:41,477 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash -908950199, now seen corresponding path program 1 times [2019-09-08 10:34:41,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:41,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:41,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:41,624 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 10:34:41,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:41,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:34:41,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:34:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:34:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:41,627 INFO L87 Difference]: Start difference. First operand 4467 states and 6656 transitions. Second operand 7 states. [2019-09-08 10:34:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:43,519 INFO L93 Difference]: Finished difference Result 26216 states and 39469 transitions. [2019-09-08 10:34:43,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:34:43,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:34:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:43,582 INFO L225 Difference]: With dead ends: 26216 [2019-09-08 10:34:43,582 INFO L226 Difference]: Without dead ends: 23696 [2019-09-08 10:34:43,595 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 10:34:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23696 states. [2019-09-08 10:34:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23696 to 4503. [2019-09-08 10:34:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-09-08 10:34:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6702 transitions. [2019-09-08 10:34:44,185 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6702 transitions. Word has length 58 [2019-09-08 10:34:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:44,186 INFO L475 AbstractCegarLoop]: Abstraction has 4503 states and 6702 transitions. [2019-09-08 10:34:44,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:34:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6702 transitions. [2019-09-08 10:34:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:34:44,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:44,189 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] [2019-09-08 10:34:44,190 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash -201532434, now seen corresponding path program 1 times [2019-09-08 10:34:44,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:44,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:44,299 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 10:34:44,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:44,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:34:44,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:34:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:34:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:34:44,301 INFO L87 Difference]: Start difference. First operand 4503 states and 6702 transitions. Second operand 6 states. [2019-09-08 10:34:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:45,333 INFO L93 Difference]: Finished difference Result 16294 states and 24256 transitions. [2019-09-08 10:34:45,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:45,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-08 10:34:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:45,375 INFO L225 Difference]: With dead ends: 16294 [2019-09-08 10:34:45,376 INFO L226 Difference]: Without dead ends: 11910 [2019-09-08 10:34:45,388 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 10:34:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11910 states. [2019-09-08 10:34:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11910 to 11906. [2019-09-08 10:34:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11906 states. [2019-09-08 10:34:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11906 states to 11906 states and 17542 transitions. [2019-09-08 10:34:46,284 INFO L78 Accepts]: Start accepts. Automaton has 11906 states and 17542 transitions. Word has length 59 [2019-09-08 10:34:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:46,284 INFO L475 AbstractCegarLoop]: Abstraction has 11906 states and 17542 transitions. [2019-09-08 10:34:46,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:34:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11906 states and 17542 transitions. [2019-09-08 10:34:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:34:46,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:46,288 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] [2019-09-08 10:34:46,288 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1864848650, now seen corresponding path program 1 times [2019-09-08 10:34:46,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:46,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:46,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:46,362 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 10:34:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:46,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:46,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:46,363 INFO L87 Difference]: Start difference. First operand 11906 states and 17542 transitions. Second operand 5 states. [2019-09-08 10:34:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:48,351 INFO L93 Difference]: Finished difference Result 31183 states and 46161 transitions. [2019-09-08 10:34:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:48,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-08 10:34:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:48,421 INFO L225 Difference]: With dead ends: 31183 [2019-09-08 10:34:48,421 INFO L226 Difference]: Without dead ends: 24998 [2019-09-08 10:34:48,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-09-08 10:34:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 14150. [2019-09-08 10:34:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-09-08 10:34:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 20912 transitions. [2019-09-08 10:34:49,584 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 20912 transitions. Word has length 60 [2019-09-08 10:34:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:49,584 INFO L475 AbstractCegarLoop]: Abstraction has 14150 states and 20912 transitions. [2019-09-08 10:34:49,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 20912 transitions. [2019-09-08 10:34:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:34:49,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:49,588 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] [2019-09-08 10:34:49,588 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 82558164, now seen corresponding path program 1 times [2019-09-08 10:34:49,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:49,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:49,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:34:49,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:49,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:49,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:49,660 INFO L87 Difference]: Start difference. First operand 14150 states and 20912 transitions. Second operand 5 states. [2019-09-08 10:34:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:51,391 INFO L93 Difference]: Finished difference Result 32553 states and 48234 transitions. [2019-09-08 10:34:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:51,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-08 10:34:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:51,473 INFO L225 Difference]: With dead ends: 32553 [2019-09-08 10:34:51,474 INFO L226 Difference]: Without dead ends: 26368 [2019-09-08 10:34:51,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26368 states. [2019-09-08 10:34:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26368 to 16563. [2019-09-08 10:34:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16563 states. [2019-09-08 10:34:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16563 states to 16563 states and 24524 transitions. [2019-09-08 10:34:53,033 INFO L78 Accepts]: Start accepts. Automaton has 16563 states and 24524 transitions. Word has length 60 [2019-09-08 10:34:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:53,033 INFO L475 AbstractCegarLoop]: Abstraction has 16563 states and 24524 transitions. [2019-09-08 10:34:53,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 16563 states and 24524 transitions. [2019-09-08 10:34:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:34:53,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:53,038 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] [2019-09-08 10:34:53,038 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1576740999, now seen corresponding path program 1 times [2019-09-08 10:34:53,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:53,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:53,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:53,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:53,110 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 10:34:53,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:53,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:34:53,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:34:53,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:34:53,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:53,112 INFO L87 Difference]: Start difference. First operand 16563 states and 24524 transitions. Second operand 7 states. [2019-09-08 10:34:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:59,055 INFO L93 Difference]: Finished difference Result 78567 states and 115387 transitions. [2019-09-08 10:34:59,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:34:59,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-08 10:34:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:59,142 INFO L225 Difference]: With dead ends: 78567 [2019-09-08 10:34:59,142 INFO L226 Difference]: Without dead ends: 70942 [2019-09-08 10:34:59,171 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 10:34:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70942 states. [2019-09-08 10:35:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70942 to 16675. [2019-09-08 10:35:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16675 states. [2019-09-08 10:35:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16675 states to 16675 states and 24667 transitions. [2019-09-08 10:35:00,725 INFO L78 Accepts]: Start accepts. Automaton has 16675 states and 24667 transitions. Word has length 63 [2019-09-08 10:35:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:00,725 INFO L475 AbstractCegarLoop]: Abstraction has 16675 states and 24667 transitions. [2019-09-08 10:35:00,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:35:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 16675 states and 24667 transitions. [2019-09-08 10:35:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:35:00,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:00,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:35:00,729 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1496387803, now seen corresponding path program 1 times [2019-09-08 10:35:00,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:00,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:00,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:00,803 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 10:35:00,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:00,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:00,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:00,805 INFO L87 Difference]: Start difference. First operand 16675 states and 24667 transitions. Second operand 3 states. [2019-09-08 10:35:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:02,753 INFO L93 Difference]: Finished difference Result 40697 states and 60199 transitions. [2019-09-08 10:35:02,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:35:02,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 10:35:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:02,783 INFO L225 Difference]: With dead ends: 40697 [2019-09-08 10:35:02,783 INFO L226 Difference]: Without dead ends: 24797 [2019-09-08 10:35:02,818 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 10:35:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2019-09-08 10:35:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 19994. [2019-09-08 10:35:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19994 states. [2019-09-08 10:35:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19994 states to 19994 states and 29142 transitions. [2019-09-08 10:35:05,122 INFO L78 Accepts]: Start accepts. Automaton has 19994 states and 29142 transitions. Word has length 63 [2019-09-08 10:35:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:05,122 INFO L475 AbstractCegarLoop]: Abstraction has 19994 states and 29142 transitions. [2019-09-08 10:35:05,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:35:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 19994 states and 29142 transitions. [2019-09-08 10:35:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:35:05,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:05,129 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] [2019-09-08 10:35:05,129 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -572139280, now seen corresponding path program 1 times [2019-09-08 10:35:05,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:05,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:05,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:05,377 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 10:35:05,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:05,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:35:05,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:35:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:35:05,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:35:05,379 INFO L87 Difference]: Start difference. First operand 19994 states and 29142 transitions. Second operand 10 states. [2019-09-08 10:35:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:12,308 INFO L93 Difference]: Finished difference Result 70025 states and 101432 transitions. [2019-09-08 10:35:12,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:35:12,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:35:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:12,372 INFO L225 Difference]: With dead ends: 70025 [2019-09-08 10:35:12,372 INFO L226 Difference]: Without dead ends: 51573 [2019-09-08 10:35:12,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:35:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51573 states. [2019-09-08 10:35:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51573 to 19782. [2019-09-08 10:35:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19782 states. [2019-09-08 10:35:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19782 states to 19782 states and 28845 transitions. [2019-09-08 10:35:14,726 INFO L78 Accepts]: Start accepts. Automaton has 19782 states and 28845 transitions. Word has length 65 [2019-09-08 10:35:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:14,727 INFO L475 AbstractCegarLoop]: Abstraction has 19782 states and 28845 transitions. [2019-09-08 10:35:14,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:35:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 19782 states and 28845 transitions. [2019-09-08 10:35:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:35:14,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:14,733 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] [2019-09-08 10:35:14,733 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2066882796, now seen corresponding path program 1 times [2019-09-08 10:35:14,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:14,913 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 10:35:14,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:14,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:35:14,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:35:14,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:35:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:35:14,915 INFO L87 Difference]: Start difference. First operand 19782 states and 28845 transitions. Second operand 10 states. [2019-09-08 10:35:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:27,199 INFO L93 Difference]: Finished difference Result 103765 states and 150697 transitions. [2019-09-08 10:35:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 10:35:27,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:35:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:27,329 INFO L225 Difference]: With dead ends: 103765 [2019-09-08 10:35:27,330 INFO L226 Difference]: Without dead ends: 85613 [2019-09-08 10:35:27,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:35:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85613 states. [2019-09-08 10:35:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85613 to 19581. [2019-09-08 10:35:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19581 states. [2019-09-08 10:35:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19581 states to 19581 states and 28537 transitions. [2019-09-08 10:35:30,084 INFO L78 Accepts]: Start accepts. Automaton has 19581 states and 28537 transitions. Word has length 65 [2019-09-08 10:35:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:30,084 INFO L475 AbstractCegarLoop]: Abstraction has 19581 states and 28537 transitions. [2019-09-08 10:35:30,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:35:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 19581 states and 28537 transitions. [2019-09-08 10:35:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:35:30,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:30,089 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] [2019-09-08 10:35:30,089 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1389497554, now seen corresponding path program 1 times [2019-09-08 10:35:30,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:30,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:30,323 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 10:35:30,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:30,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:35:30,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:35:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:35:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:35:30,325 INFO L87 Difference]: Start difference. First operand 19581 states and 28537 transitions. Second operand 10 states. [2019-09-08 10:35:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:44,897 INFO L93 Difference]: Finished difference Result 105605 states and 152479 transitions. [2019-09-08 10:35:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:35:44,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:35:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:45,009 INFO L225 Difference]: With dead ends: 105605 [2019-09-08 10:35:45,009 INFO L226 Difference]: Without dead ends: 87349 [2019-09-08 10:35:45,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:35:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87349 states. [2019-09-08 10:35:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87349 to 19340. [2019-09-08 10:35:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19340 states. [2019-09-08 10:35:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19340 states to 19340 states and 28177 transitions. [2019-09-08 10:35:47,975 INFO L78 Accepts]: Start accepts. Automaton has 19340 states and 28177 transitions. Word has length 65 [2019-09-08 10:35:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:47,975 INFO L475 AbstractCegarLoop]: Abstraction has 19340 states and 28177 transitions. [2019-09-08 10:35:47,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:35:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 19340 states and 28177 transitions. [2019-09-08 10:35:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:35:47,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:47,979 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] [2019-09-08 10:35:47,979 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash -376949161, now seen corresponding path program 1 times [2019-09-08 10:35:47,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:47,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:48,019 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 10:35:48,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:48,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:48,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:48,020 INFO L87 Difference]: Start difference. First operand 19340 states and 28177 transitions. Second operand 3 states. [2019-09-08 10:35:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:50,726 INFO L93 Difference]: Finished difference Result 28019 states and 40710 transitions. [2019-09-08 10:35:50,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:35:50,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:35:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:50,757 INFO L225 Difference]: With dead ends: 28019 [2019-09-08 10:35:50,758 INFO L226 Difference]: Without dead ends: 19321 [2019-09-08 10:35:50,774 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 10:35:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19321 states. [2019-09-08 10:35:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19321 to 19319. [2019-09-08 10:35:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19319 states. [2019-09-08 10:35:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19319 states to 19319 states and 27722 transitions. [2019-09-08 10:35:54,023 INFO L78 Accepts]: Start accepts. Automaton has 19319 states and 27722 transitions. Word has length 66 [2019-09-08 10:35:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:54,024 INFO L475 AbstractCegarLoop]: Abstraction has 19319 states and 27722 transitions. [2019-09-08 10:35:54,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:35:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19319 states and 27722 transitions. [2019-09-08 10:35:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:35:54,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:54,027 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] [2019-09-08 10:35:54,027 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1749705359, now seen corresponding path program 1 times [2019-09-08 10:35:54,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:54,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:54,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:54,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:54,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:54,071 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 10:35:54,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:54,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:54,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:54,073 INFO L87 Difference]: Start difference. First operand 19319 states and 27722 transitions. Second operand 3 states. [2019-09-08 10:35:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:56,352 INFO L93 Difference]: Finished difference Result 26259 states and 37550 transitions. [2019-09-08 10:35:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:35:56,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:35:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:56,376 INFO L225 Difference]: With dead ends: 26259 [2019-09-08 10:35:56,376 INFO L226 Difference]: Without dead ends: 17587 [2019-09-08 10:35:56,390 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 10:35:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17587 states. [2019-09-08 10:35:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17587 to 17585. [2019-09-08 10:35:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17585 states. [2019-09-08 10:35:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17585 states to 17585 states and 24803 transitions. [2019-09-08 10:35:59,395 INFO L78 Accepts]: Start accepts. Automaton has 17585 states and 24803 transitions. Word has length 66 [2019-09-08 10:35:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:59,395 INFO L475 AbstractCegarLoop]: Abstraction has 17585 states and 24803 transitions. [2019-09-08 10:35:59,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:35:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 17585 states and 24803 transitions. [2019-09-08 10:35:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:35:59,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:59,398 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] [2019-09-08 10:35:59,398 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1710265917, now seen corresponding path program 1 times [2019-09-08 10:35:59,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:59,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:59,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:59,443 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 10:35:59,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:59,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:59,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:59,445 INFO L87 Difference]: Start difference. First operand 17585 states and 24803 transitions. Second operand 3 states. [2019-09-08 10:36:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:01,514 INFO L93 Difference]: Finished difference Result 23506 states and 33061 transitions. [2019-09-08 10:36:01,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:01,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:36:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:01,530 INFO L225 Difference]: With dead ends: 23506 [2019-09-08 10:36:01,530 INFO L226 Difference]: Without dead ends: 13798 [2019-09-08 10:36:01,540 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 10:36:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13798 states. [2019-09-08 10:36:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13798 to 13796. [2019-09-08 10:36:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-09-08 10:36:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 19122 transitions. [2019-09-08 10:36:03,213 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 19122 transitions. Word has length 66 [2019-09-08 10:36:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:03,213 INFO L475 AbstractCegarLoop]: Abstraction has 13796 states and 19122 transitions. [2019-09-08 10:36:03,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 19122 transitions. [2019-09-08 10:36:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:36:03,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:03,216 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] [2019-09-08 10:36:03,216 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash -980051313, now seen corresponding path program 1 times [2019-09-08 10:36:03,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:03,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:03,257 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 10:36:03,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:03,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:03,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:03,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:03,259 INFO L87 Difference]: Start difference. First operand 13796 states and 19122 transitions. Second operand 3 states. [2019-09-08 10:36:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:06,008 INFO L93 Difference]: Finished difference Result 25341 states and 35223 transitions. [2019-09-08 10:36:06,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:06,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:36:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:06,032 INFO L225 Difference]: With dead ends: 25341 [2019-09-08 10:36:06,032 INFO L226 Difference]: Without dead ends: 20285 [2019-09-08 10:36:06,042 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 10:36:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20285 states. [2019-09-08 10:36:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20285 to 13579. [2019-09-08 10:36:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13579 states. [2019-09-08 10:36:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13579 states to 13579 states and 18801 transitions. [2019-09-08 10:36:08,039 INFO L78 Accepts]: Start accepts. Automaton has 13579 states and 18801 transitions. Word has length 67 [2019-09-08 10:36:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:08,039 INFO L475 AbstractCegarLoop]: Abstraction has 13579 states and 18801 transitions. [2019-09-08 10:36:08,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 13579 states and 18801 transitions. [2019-09-08 10:36:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:36:08,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:08,042 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] [2019-09-08 10:36:08,042 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 732122448, now seen corresponding path program 1 times [2019-09-08 10:36:08,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:08,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:08,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:08,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:08,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:08,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:08,090 INFO L87 Difference]: Start difference. First operand 13579 states and 18801 transitions. Second operand 3 states. [2019-09-08 10:36:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:11,103 INFO L93 Difference]: Finished difference Result 25220 states and 34986 transitions. [2019-09-08 10:36:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:11,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:36:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:11,123 INFO L225 Difference]: With dead ends: 25220 [2019-09-08 10:36:11,123 INFO L226 Difference]: Without dead ends: 20138 [2019-09-08 10:36:11,129 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 10:36:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20138 states. [2019-09-08 10:36:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20138 to 13432. [2019-09-08 10:36:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13432 states. [2019-09-08 10:36:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13432 states to 13432 states and 18573 transitions. [2019-09-08 10:36:13,160 INFO L78 Accepts]: Start accepts. Automaton has 13432 states and 18573 transitions. Word has length 67 [2019-09-08 10:36:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:13,161 INFO L475 AbstractCegarLoop]: Abstraction has 13432 states and 18573 transitions. [2019-09-08 10:36:13,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 13432 states and 18573 transitions. [2019-09-08 10:36:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:36:13,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:13,163 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] [2019-09-08 10:36:13,163 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash -261204545, now seen corresponding path program 1 times [2019-09-08 10:36:13,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:13,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:13,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:13,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:13,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:13,971 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 10:36:13,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:13,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:36:13,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:36:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:36:13,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:36:13,973 INFO L87 Difference]: Start difference. First operand 13432 states and 18573 transitions. Second operand 17 states. [2019-09-08 10:36:14,518 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 10:36:14,848 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 10:36:15,017 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:36:15,294 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 10:36:15,440 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:36:15,746 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:36:15,996 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 10:36:16,225 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:36:16,482 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:36:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:23,787 INFO L93 Difference]: Finished difference Result 31630 states and 43776 transitions. [2019-09-08 10:36:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 10:36:23,788 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-08 10:36:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:23,825 INFO L225 Difference]: With dead ends: 31630 [2019-09-08 10:36:23,825 INFO L226 Difference]: Without dead ends: 30611 [2019-09-08 10:36:23,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:36:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30611 states. [2019-09-08 10:36:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30611 to 13350. [2019-09-08 10:36:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-09-08 10:36:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 18459 transitions. [2019-09-08 10:36:26,212 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 18459 transitions. Word has length 67 [2019-09-08 10:36:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:26,213 INFO L475 AbstractCegarLoop]: Abstraction has 13350 states and 18459 transitions. [2019-09-08 10:36:26,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:36:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 18459 transitions. [2019-09-08 10:36:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:36:26,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:26,215 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] [2019-09-08 10:36:26,215 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1834151963, now seen corresponding path program 1 times [2019-09-08 10:36:26,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:26,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:27,447 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 10:36:27,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:27,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 10:36:27,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 10:36:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 10:36:27,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:36:27,449 INFO L87 Difference]: Start difference. First operand 13350 states and 18459 transitions. Second operand 19 states. [2019-09-08 10:36:28,051 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-08 10:36:28,445 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 10:36:28,687 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-08 10:36:29,099 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-08 10:36:29,463 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-09-08 10:36:29,683 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 10:36:29,929 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 10:36:30,291 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 10:36:30,458 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 10:36:30,685 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 10:36:30,855 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 10:36:31,037 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 10:36:31,374 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 10:36:31,534 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 10:36:31,764 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 10:36:32,061 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:36:38,025 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 10:36:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:44,985 INFO L93 Difference]: Finished difference Result 53805 states and 74895 transitions. [2019-09-08 10:36:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 10:36:44,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-08 10:36:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:45,043 INFO L225 Difference]: With dead ends: 53805 [2019-09-08 10:36:45,043 INFO L226 Difference]: Without dead ends: 52835 [2019-09-08 10:36:45,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 10:36:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52835 states. [2019-09-08 10:36:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52835 to 13374. [2019-09-08 10:36:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13374 states. [2019-09-08 10:36:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13374 states to 13374 states and 18487 transitions. [2019-09-08 10:36:48,747 INFO L78 Accepts]: Start accepts. Automaton has 13374 states and 18487 transitions. Word has length 67 [2019-09-08 10:36:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:48,747 INFO L475 AbstractCegarLoop]: Abstraction has 13374 states and 18487 transitions. [2019-09-08 10:36:48,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 10:36:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 13374 states and 18487 transitions. [2019-09-08 10:36:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:36:48,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:48,750 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] [2019-09-08 10:36:48,750 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1363022706, now seen corresponding path program 1 times [2019-09-08 10:36:48,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:48,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:48,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:48,796 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 10:36:48,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:48,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:48,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:48,798 INFO L87 Difference]: Start difference. First operand 13374 states and 18487 transitions. Second operand 3 states. [2019-09-08 10:36:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:52,658 INFO L93 Difference]: Finished difference Result 25861 states and 35839 transitions. [2019-09-08 10:36:52,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:52,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:36:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:52,681 INFO L225 Difference]: With dead ends: 25861 [2019-09-08 10:36:52,681 INFO L226 Difference]: Without dead ends: 19743 [2019-09-08 10:36:52,690 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 10:36:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19743 states. [2019-09-08 10:36:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19743 to 12842. [2019-09-08 10:36:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12842 states. [2019-09-08 10:36:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12842 states to 12842 states and 17739 transitions. [2019-09-08 10:36:55,270 INFO L78 Accepts]: Start accepts. Automaton has 12842 states and 17739 transitions. Word has length 67 [2019-09-08 10:36:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:55,270 INFO L475 AbstractCegarLoop]: Abstraction has 12842 states and 17739 transitions. [2019-09-08 10:36:55,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12842 states and 17739 transitions. [2019-09-08 10:36:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:36:55,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:55,273 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] [2019-09-08 10:36:55,273 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1412507135, now seen corresponding path program 1 times [2019-09-08 10:36:55,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:55,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:56,130 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 10:36:56,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:56,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 10:36:56,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 10:36:56,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 10:36:56,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:36:56,131 INFO L87 Difference]: Start difference. First operand 12842 states and 17739 transitions. Second operand 18 states. [2019-09-08 10:36:56,666 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 10:36:56,862 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 10:36:57,156 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-08 10:36:57,381 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-08 10:36:57,581 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 10:36:57,797 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 10:36:58,060 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-08 10:36:58,481 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 10:36:58,851 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 10:37:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:07,143 INFO L93 Difference]: Finished difference Result 31606 states and 43839 transitions. [2019-09-08 10:37:07,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:37:07,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-09-08 10:37:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:07,175 INFO L225 Difference]: With dead ends: 31606 [2019-09-08 10:37:07,176 INFO L226 Difference]: Without dead ends: 30630 [2019-09-08 10:37:07,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 10:37:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30630 states. [2019-09-08 10:37:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30630 to 12818. [2019-09-08 10:37:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12818 states. [2019-09-08 10:37:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12818 states to 12818 states and 17705 transitions. [2019-09-08 10:37:09,953 INFO L78 Accepts]: Start accepts. Automaton has 12818 states and 17705 transitions. Word has length 68 [2019-09-08 10:37:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:09,954 INFO L475 AbstractCegarLoop]: Abstraction has 12818 states and 17705 transitions. [2019-09-08 10:37:09,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 10:37:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12818 states and 17705 transitions. [2019-09-08 10:37:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:37:09,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:09,956 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] [2019-09-08 10:37:09,956 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -370961391, now seen corresponding path program 1 times [2019-09-08 10:37:09,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:09,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:10,015 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 10:37:10,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:10,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:37:10,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:37:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:37:10,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:10,016 INFO L87 Difference]: Start difference. First operand 12818 states and 17705 transitions. Second operand 5 states. [2019-09-08 10:37:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:12,531 INFO L93 Difference]: Finished difference Result 12824 states and 17708 transitions. [2019-09-08 10:37:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:12,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:37:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:12,542 INFO L225 Difference]: With dead ends: 12824 [2019-09-08 10:37:12,543 INFO L226 Difference]: Without dead ends: 12010 [2019-09-08 10:37:12,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12010 states. [2019-09-08 10:37:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12010 to 12006. [2019-09-08 10:37:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12006 states. [2019-09-08 10:37:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12006 states to 12006 states and 16612 transitions. [2019-09-08 10:37:14,973 INFO L78 Accepts]: Start accepts. Automaton has 12006 states and 16612 transitions. Word has length 71 [2019-09-08 10:37:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:14,974 INFO L475 AbstractCegarLoop]: Abstraction has 12006 states and 16612 transitions. [2019-09-08 10:37:14,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:37:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12006 states and 16612 transitions. [2019-09-08 10:37:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:37:14,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:14,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:14,977 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:14,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:14,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1227529657, now seen corresponding path program 1 times [2019-09-08 10:37:14,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:14,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:14,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:14,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:14,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:15,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:15,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:15,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:15,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:15,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:15,044 INFO L87 Difference]: Start difference. First operand 12006 states and 16612 transitions. Second operand 6 states. [2019-09-08 10:37:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:20,219 INFO L93 Difference]: Finished difference Result 22712 states and 31000 transitions. [2019-09-08 10:37:20,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:37:20,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-08 10:37:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:20,243 INFO L225 Difference]: With dead ends: 22712 [2019-09-08 10:37:20,243 INFO L226 Difference]: Without dead ends: 22710 [2019-09-08 10:37:20,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:37:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22710 states. [2019-09-08 10:37:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22710 to 12405. [2019-09-08 10:37:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12405 states. [2019-09-08 10:37:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12405 states to 12405 states and 16902 transitions. [2019-09-08 10:37:22,959 INFO L78 Accepts]: Start accepts. Automaton has 12405 states and 16902 transitions. Word has length 74 [2019-09-08 10:37:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:22,959 INFO L475 AbstractCegarLoop]: Abstraction has 12405 states and 16902 transitions. [2019-09-08 10:37:22,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 12405 states and 16902 transitions. [2019-09-08 10:37:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:37:22,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:22,963 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] [2019-09-08 10:37:22,963 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1119890230, now seen corresponding path program 1 times [2019-09-08 10:37:22,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:22,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:22,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:22,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:22,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:23,008 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 10:37:23,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:23,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:23,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:23,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:23,009 INFO L87 Difference]: Start difference. First operand 12405 states and 16902 transitions. Second operand 3 states. [2019-09-08 10:37:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:27,977 INFO L93 Difference]: Finished difference Result 33828 states and 46205 transitions. [2019-09-08 10:37:27,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:27,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:37:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:28,001 INFO L225 Difference]: With dead ends: 33828 [2019-09-08 10:37:28,001 INFO L226 Difference]: Without dead ends: 22002 [2019-09-08 10:37:28,010 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 10:37:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22002 states. [2019-09-08 10:37:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22002 to 21734. [2019-09-08 10:37:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-09-08 10:37:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 29203 transitions. [2019-09-08 10:37:32,720 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 29203 transitions. Word has length 75 [2019-09-08 10:37:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:32,720 INFO L475 AbstractCegarLoop]: Abstraction has 21734 states and 29203 transitions. [2019-09-08 10:37:32,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 29203 transitions. [2019-09-08 10:37:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:37:32,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:32,726 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] [2019-09-08 10:37:32,726 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash 22683295, now seen corresponding path program 1 times [2019-09-08 10:37:32,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:32,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:32,785 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 10:37:32,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:32,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:32,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:32,786 INFO L87 Difference]: Start difference. First operand 21734 states and 29203 transitions. Second operand 3 states. [2019-09-08 10:37:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:40,559 INFO L93 Difference]: Finished difference Result 54772 states and 73571 transitions. [2019-09-08 10:37:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:40,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:37:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:40,598 INFO L225 Difference]: With dead ends: 54772 [2019-09-08 10:37:40,598 INFO L226 Difference]: Without dead ends: 33593 [2019-09-08 10:37:40,614 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 10:37:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33593 states. [2019-09-08 10:37:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33593 to 30759. [2019-09-08 10:37:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30759 states. [2019-09-08 10:37:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30759 states to 30759 states and 41038 transitions. [2019-09-08 10:37:47,628 INFO L78 Accepts]: Start accepts. Automaton has 30759 states and 41038 transitions. Word has length 76 [2019-09-08 10:37:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:47,628 INFO L475 AbstractCegarLoop]: Abstraction has 30759 states and 41038 transitions. [2019-09-08 10:37:47,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30759 states and 41038 transitions. [2019-09-08 10:37:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:37:47,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:47,632 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] [2019-09-08 10:37:47,632 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1396060808, now seen corresponding path program 1 times [2019-09-08 10:37:47,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:47,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:47,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:47,682 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 10:37:47,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:47,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:37:47,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:37:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:37:47,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:47,684 INFO L87 Difference]: Start difference. First operand 30759 states and 41038 transitions. Second operand 5 states. [2019-09-08 10:38:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:04,667 INFO L93 Difference]: Finished difference Result 95404 states and 126745 transitions. [2019-09-08 10:38:04,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:38:04,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 10:38:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:04,753 INFO L225 Difference]: With dead ends: 95404 [2019-09-08 10:38:04,754 INFO L226 Difference]: Without dead ends: 65131 [2019-09-08 10:38:04,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:38:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65131 states. [2019-09-08 10:38:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65131 to 34442. [2019-09-08 10:38:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34442 states. [2019-09-08 10:38:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34442 states to 34442 states and 44918 transitions. [2019-09-08 10:38:12,569 INFO L78 Accepts]: Start accepts. Automaton has 34442 states and 44918 transitions. Word has length 81 [2019-09-08 10:38:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:12,569 INFO L475 AbstractCegarLoop]: Abstraction has 34442 states and 44918 transitions. [2019-09-08 10:38:12,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:38:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34442 states and 44918 transitions. [2019-09-08 10:38:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:38:12,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:12,573 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 10:38:12,573 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1228531457, now seen corresponding path program 1 times [2019-09-08 10:38:12,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:12,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:12,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:12,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:12,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:12,638 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 10:38:12,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:12,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:38:12,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:38:12,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:38:12,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:38:12,640 INFO L87 Difference]: Start difference. First operand 34442 states and 44918 transitions. Second operand 5 states. [2019-09-08 10:38:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:42,437 INFO L93 Difference]: Finished difference Result 151336 states and 196512 transitions. [2019-09-08 10:38:42,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:38:42,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 10:38:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:42,619 INFO L225 Difference]: With dead ends: 151336 [2019-09-08 10:38:42,619 INFO L226 Difference]: Without dead ends: 117432 [2019-09-08 10:38:42,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:38:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117432 states. [2019-09-08 10:38:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117432 to 68760. [2019-09-08 10:38:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68760 states. [2019-09-08 10:38:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68760 states to 68760 states and 89484 transitions. [2019-09-08 10:38:58,634 INFO L78 Accepts]: Start accepts. Automaton has 68760 states and 89484 transitions. Word has length 83 [2019-09-08 10:38:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:58,635 INFO L475 AbstractCegarLoop]: Abstraction has 68760 states and 89484 transitions. [2019-09-08 10:38:58,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:38:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 68760 states and 89484 transitions. [2019-09-08 10:38:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 10:38:58,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:58,645 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:38:58,645 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash -505184882, now seen corresponding path program 1 times [2019-09-08 10:38:58,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:58,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 10:38:58,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:58,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:38:58,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:38:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:38:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:38:58,696 INFO L87 Difference]: Start difference. First operand 68760 states and 89484 transitions. Second operand 3 states. [2019-09-08 10:39:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:15,806 INFO L93 Difference]: Finished difference Result 134850 states and 174660 transitions. [2019-09-08 10:39:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:39:15,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 10:39:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:15,886 INFO L225 Difference]: With dead ends: 134850 [2019-09-08 10:39:15,886 INFO L226 Difference]: Without dead ends: 66628 [2019-09-08 10:39:15,931 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 10:39:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66628 states. [2019-09-08 10:39:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66628 to 62780. [2019-09-08 10:39:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62780 states. [2019-09-08 10:39:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62780 states to 62780 states and 80334 transitions. [2019-09-08 10:39:30,578 INFO L78 Accepts]: Start accepts. Automaton has 62780 states and 80334 transitions. Word has length 94 [2019-09-08 10:39:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:30,578 INFO L475 AbstractCegarLoop]: Abstraction has 62780 states and 80334 transitions. [2019-09-08 10:39:30,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:39:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 62780 states and 80334 transitions. [2019-09-08 10:39:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 10:39:30,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:30,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:39:30,586 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1041325055, now seen corresponding path program 1 times [2019-09-08 10:39:30,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:30,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:30,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:30,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:30,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:30,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:30,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:39:30,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:39:30,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:39:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:39:30,634 INFO L87 Difference]: Start difference. First operand 62780 states and 80334 transitions. Second operand 3 states. [2019-09-08 10:40:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:00,423 INFO L93 Difference]: Finished difference Result 180062 states and 229152 transitions. [2019-09-08 10:40:00,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:40:00,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 10:40:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:00,569 INFO L225 Difference]: With dead ends: 180062 [2019-09-08 10:40:00,569 INFO L226 Difference]: Without dead ends: 117820 [2019-09-08 10:40:00,624 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 10:40:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117820 states. [2019-09-08 10:40:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117820 to 103380. [2019-09-08 10:40:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103380 states. [2019-09-08 10:40:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103380 states to 103380 states and 130176 transitions. [2019-09-08 10:40:25,065 INFO L78 Accepts]: Start accepts. Automaton has 103380 states and 130176 transitions. Word has length 95 [2019-09-08 10:40:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:25,066 INFO L475 AbstractCegarLoop]: Abstraction has 103380 states and 130176 transitions. [2019-09-08 10:40:25,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:40:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 103380 states and 130176 transitions. [2019-09-08 10:40:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:40:25,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:25,074 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:25,074 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2081371009, now seen corresponding path program 1 times [2019-09-08 10:40:25,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:25,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:25,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:25,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:40:25,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:40:25,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:25,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:40:25,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:40:25,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:40:25,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:40:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:26,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:40:26,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-09-08 10:40:26,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 10:40:26,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 10:40:26,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:40:26,625 INFO L87 Difference]: Start difference. First operand 103380 states and 130176 transitions. Second operand 19 states. [2019-09-08 10:40:27,039 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 10:40:27,291 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 10:40:30,399 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-08 10:41:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:54,516 INFO L93 Difference]: Finished difference Result 374128 states and 469168 transitions. [2019-09-08 10:41:54,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:41:54,516 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-09-08 10:41:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:55,682 INFO L225 Difference]: With dead ends: 374128 [2019-09-08 10:41:55,682 INFO L226 Difference]: Without dead ends: 314410 [2019-09-08 10:41:55,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:41:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314410 states. [2019-09-08 10:42:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314410 to 104639. [2019-09-08 10:42:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104639 states. [2019-09-08 10:42:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104639 states to 104639 states and 131694 transitions. [2019-09-08 10:42:30,677 INFO L78 Accepts]: Start accepts. Automaton has 104639 states and 131694 transitions. Word has length 98 [2019-09-08 10:42:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:30,677 INFO L475 AbstractCegarLoop]: Abstraction has 104639 states and 131694 transitions. [2019-09-08 10:42:30,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 10:42:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 104639 states and 131694 transitions. [2019-09-08 10:42:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:42:30,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:30,690 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:30,691 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash -569185905, now seen corresponding path program 1 times [2019-09-08 10:42:30,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:30,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:30,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:30,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:30,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:42:30,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:42:30,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:42:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:42:30,899 INFO L87 Difference]: Start difference. First operand 104639 states and 131694 transitions. Second operand 10 states. [2019-09-08 10:44:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:12,054 INFO L93 Difference]: Finished difference Result 412304 states and 516366 transitions. [2019-09-08 10:44:12,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:44:12,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-08 10:44:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:12,808 INFO L225 Difference]: With dead ends: 412304 [2019-09-08 10:44:12,808 INFO L226 Difference]: Without dead ends: 343680 [2019-09-08 10:44:12,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:44:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343680 states. [2019-09-08 10:44:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343680 to 143322. [2019-09-08 10:44:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143322 states. [2019-09-08 10:44:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143322 states to 143322 states and 180406 transitions. [2019-09-08 10:44:59,506 INFO L78 Accepts]: Start accepts. Automaton has 143322 states and 180406 transitions. Word has length 98 [2019-09-08 10:44:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:59,506 INFO L475 AbstractCegarLoop]: Abstraction has 143322 states and 180406 transitions. [2019-09-08 10:44:59,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:44:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 143322 states and 180406 transitions. [2019-09-08 10:44:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:44:59,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:59,513 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:59,513 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:59,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1695242657, now seen corresponding path program 1 times [2019-09-08 10:44:59,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:59,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:59,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:59,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:44:59,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:44:59,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:59,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:44:59,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:45:00,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:45:00,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:45:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:00,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:45:00,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-09-08 10:45:00,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 10:45:00,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 10:45:00,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:45:00,734 INFO L87 Difference]: Start difference. First operand 143322 states and 180406 transitions. Second operand 19 states. [2019-09-08 10:45:02,626 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-09-08 10:45:04,471 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 10:45:04,673 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 10:45:05,286 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 10:45:06,473 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 10:45:12,400 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 10:45:15,146 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-08 10:47:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:18,320 INFO L93 Difference]: Finished difference Result 524648 states and 654578 transitions. [2019-09-08 10:47:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 10:47:18,321 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-09-08 10:47:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:19,016 INFO L225 Difference]: With dead ends: 524648 [2019-09-08 10:47:19,016 INFO L226 Difference]: Without dead ends: 433242 [2019-09-08 10:47:19,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=531, Invalid=1821, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 10:47:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433242 states.