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_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:28:50,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:28:50,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:28:50,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:28:50,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:28:50,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:28:50,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:28:50,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:28:50,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:28:50,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:28:50,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:28:50,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:28:50,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:28:50,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:28:50,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:28:50,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:28:50,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:28:50,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:28:50,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:28:50,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:28:50,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:28:50,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:28:50,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:28:50,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:28:50,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:28:50,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:28:50,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:28:50,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:28:50,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:28:50,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:28:50,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:28:50,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:28:50,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:28:50,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:28:50,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:28:50,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:28:50,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:28:50,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:28:50,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:28:50,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:28:50,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:28:50,573 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 09:28:50,587 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:28:50,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:28:50,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:28:50,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:28:50,588 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:28:50,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:28:50,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:28:50,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:28:50,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:28:50,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:28:50,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:28:50,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:28:50,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:28:50,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:28:50,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:28:50,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:28:50,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:28:50,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:28:50,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:28:50,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:28:50,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:28:50,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:28:50,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:28:50,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:28:50,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:28:50,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:28:50,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:28:50,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:28:50,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:28:50,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:28:50,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:28:50,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:28:50,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:28:50,638 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:28:50,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:28:50,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dd690d2/d179849f62fd46d38d18f4c0b8201ce7/FLAG5e504bac5 [2019-09-08 09:28:51,203 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:28:51,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:28:51,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dd690d2/d179849f62fd46d38d18f4c0b8201ce7/FLAG5e504bac5 [2019-09-08 09:28:51,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dd690d2/d179849f62fd46d38d18f4c0b8201ce7 [2019-09-08 09:28:51,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:28:51,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:28:51,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:28:51,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:28:51,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:28:51,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:28:51" (1/1) ... [2019-09-08 09:28:51,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fc21ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:51, skipping insertion in model container [2019-09-08 09:28:51,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:28:51" (1/1) ... [2019-09-08 09:28:51,537 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:28:51,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:28:51,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:28:51,854 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:28:52,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:28:52,041 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:28:52,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52 WrapperNode [2019-09-08 09:28:52,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:28:52,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:28:52,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:28:52,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:28:52,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (1/1) ... [2019-09-08 09:28:52,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (1/1) ... [2019-09-08 09:28:52,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (1/1) ... [2019-09-08 09:28:52,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (1/1) ... [2019-09-08 09:28:52,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (1/1) ... [2019-09-08 09:28:52,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (1/1) ... [2019-09-08 09:28:52,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (1/1) ... [2019-09-08 09:28:52,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:28:52,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:28:52,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:28:52,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:28:52,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (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 09:28:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:28:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:28:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:28:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:28:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:28:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:28:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:28:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:28:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:28:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:28:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:28:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:28:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:28:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:28:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:28:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:28:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:28:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:28:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:28:52,960 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:28:52,960 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:28:52,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:28:52 BoogieIcfgContainer [2019-09-08 09:28:52,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:28:52,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:28:52,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:28:52,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:28:52,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:28:51" (1/3) ... [2019-09-08 09:28:52,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1034e298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:28:52, skipping insertion in model container [2019-09-08 09:28:52,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:28:52" (2/3) ... [2019-09-08 09:28:52,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1034e298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:28:52, skipping insertion in model container [2019-09-08 09:28:52,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:28:52" (3/3) ... [2019-09-08 09:28:52,970 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:28:52,979 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:28:52,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:28:53,003 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:28:53,035 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:28:53,035 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:28:53,035 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:28:53,036 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:28:53,036 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:28:53,036 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:28:53,036 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:28:53,037 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:28:53,037 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:28:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-08 09:28:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 09:28:53,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:53,068 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 09:28:53,070 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-08 09:28:53,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:53,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:53,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:53,469 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 09:28:53,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:53,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:53,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:53,496 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-08 09:28:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:53,704 INFO L93 Difference]: Finished difference Result 310 states and 519 transitions. [2019-09-08 09:28:53,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:53,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 09:28:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:53,730 INFO L225 Difference]: With dead ends: 310 [2019-09-08 09:28:53,730 INFO L226 Difference]: Without dead ends: 215 [2019-09-08 09:28:53,735 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 09:28:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-08 09:28:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-09-08 09:28:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-08 09:28:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 331 transitions. [2019-09-08 09:28:53,829 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 331 transitions. Word has length 60 [2019-09-08 09:28:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:53,830 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 331 transitions. [2019-09-08 09:28:53,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2019-09-08 09:28:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 09:28:53,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:53,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:28:53,834 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-08 09:28:53,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:53,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:53,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:53,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:28:54,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:54,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:54,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:54,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:54,008 INFO L87 Difference]: Start difference. First operand 212 states and 331 transitions. Second operand 3 states. [2019-09-08 09:28:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:54,092 INFO L93 Difference]: Finished difference Result 506 states and 815 transitions. [2019-09-08 09:28:54,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:54,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 09:28:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:54,101 INFO L225 Difference]: With dead ends: 506 [2019-09-08 09:28:54,101 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 09:28:54,105 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 09:28:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 09:28:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-08 09:28:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 09:28:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 553 transitions. [2019-09-08 09:28:54,145 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 553 transitions. Word has length 62 [2019-09-08 09:28:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:54,146 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 553 transitions. [2019-09-08 09:28:54,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 553 transitions. [2019-09-08 09:28:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 09:28:54,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:54,152 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] [2019-09-08 09:28:54,153 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-08 09:28:54,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:54,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:54,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:54,293 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 09:28:54,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:54,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:54,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:54,295 INFO L87 Difference]: Start difference. First operand 348 states and 553 transitions. Second operand 3 states. [2019-09-08 09:28:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:54,417 INFO L93 Difference]: Finished difference Result 900 states and 1455 transitions. [2019-09-08 09:28:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:54,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 09:28:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:54,424 INFO L225 Difference]: With dead ends: 900 [2019-09-08 09:28:54,424 INFO L226 Difference]: Without dead ends: 610 [2019-09-08 09:28:54,428 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 09:28:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-08 09:28:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2019-09-08 09:28:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 09:28:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 965 transitions. [2019-09-08 09:28:54,503 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 965 transitions. Word has length 64 [2019-09-08 09:28:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:54,505 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 965 transitions. [2019-09-08 09:28:54,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 965 transitions. [2019-09-08 09:28:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 09:28:54,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:54,513 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 09:28:54,513 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-08 09:28:54,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:54,725 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 09:28:54,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:54,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:28:54,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:28:54,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:28:54,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:28:54,727 INFO L87 Difference]: Start difference. First operand 604 states and 965 transitions. Second operand 5 states. [2019-09-08 09:28:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:54,981 INFO L93 Difference]: Finished difference Result 2298 states and 3758 transitions. [2019-09-08 09:28:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:28:54,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 09:28:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:54,991 INFO L225 Difference]: With dead ends: 2298 [2019-09-08 09:28:54,992 INFO L226 Difference]: Without dead ends: 1752 [2019-09-08 09:28:54,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:28:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-09-08 09:28:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1308. [2019-09-08 09:28:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-08 09:28:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2128 transitions. [2019-09-08 09:28:55,068 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2128 transitions. Word has length 66 [2019-09-08 09:28:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:55,069 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 2128 transitions. [2019-09-08 09:28:55,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:28:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2128 transitions. [2019-09-08 09:28:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 09:28:55,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:55,072 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 09:28:55,072 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-08 09:28:55,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:55,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:55,173 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 09:28:55,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:55,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:28:55,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:28:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:28:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:28:55,175 INFO L87 Difference]: Start difference. First operand 1308 states and 2128 transitions. Second operand 6 states. [2019-09-08 09:28:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:55,608 INFO L93 Difference]: Finished difference Result 5850 states and 9571 transitions. [2019-09-08 09:28:55,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:28:55,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-08 09:28:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:55,634 INFO L225 Difference]: With dead ends: 5850 [2019-09-08 09:28:55,635 INFO L226 Difference]: Without dead ends: 4600 [2019-09-08 09:28:55,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:28:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2019-09-08 09:28:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 4501. [2019-09-08 09:28:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2019-09-08 09:28:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 7340 transitions. [2019-09-08 09:28:55,906 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 7340 transitions. Word has length 67 [2019-09-08 09:28:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:55,907 INFO L475 AbstractCegarLoop]: Abstraction has 4501 states and 7340 transitions. [2019-09-08 09:28:55,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:28:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 7340 transitions. [2019-09-08 09:28:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:28:55,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:55,911 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 09:28:55,911 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-08 09:28:55,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:55,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:55,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:56,054 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 09:28:56,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:56,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:28:56,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:28:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:28:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:28:56,055 INFO L87 Difference]: Start difference. First operand 4501 states and 7340 transitions. Second operand 4 states. [2019-09-08 09:28:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:56,389 INFO L93 Difference]: Finished difference Result 10275 states and 16810 transitions. [2019-09-08 09:28:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:28:56,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-08 09:28:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:56,424 INFO L225 Difference]: With dead ends: 10275 [2019-09-08 09:28:56,424 INFO L226 Difference]: Without dead ends: 6169 [2019-09-08 09:28:56,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:28:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-09-08 09:28:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6142. [2019-09-08 09:28:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6142 states. [2019-09-08 09:28:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 10015 transitions. [2019-09-08 09:28:57,030 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 10015 transitions. Word has length 68 [2019-09-08 09:28:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:57,032 INFO L475 AbstractCegarLoop]: Abstraction has 6142 states and 10015 transitions. [2019-09-08 09:28:57,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:28:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 10015 transitions. [2019-09-08 09:28:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:28:57,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:57,036 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] [2019-09-08 09:28:57,037 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-08 09:28:57,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:57,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:57,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:57,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:57,150 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 09:28:57,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:57,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:57,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:57,152 INFO L87 Difference]: Start difference. First operand 6142 states and 10015 transitions. Second operand 3 states. [2019-09-08 09:28:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:57,609 INFO L93 Difference]: Finished difference Result 13745 states and 22500 transitions. [2019-09-08 09:28:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:57,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:28:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:57,663 INFO L225 Difference]: With dead ends: 13745 [2019-09-08 09:28:57,664 INFO L226 Difference]: Without dead ends: 9184 [2019-09-08 09:28:57,676 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 09:28:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9184 states. [2019-09-08 09:28:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9184 to 9182. [2019-09-08 09:28:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9182 states. [2019-09-08 09:28:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9182 states to 9182 states and 14930 transitions. [2019-09-08 09:28:58,239 INFO L78 Accepts]: Start accepts. Automaton has 9182 states and 14930 transitions. Word has length 69 [2019-09-08 09:28:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:58,239 INFO L475 AbstractCegarLoop]: Abstraction has 9182 states and 14930 transitions. [2019-09-08 09:28:58,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 9182 states and 14930 transitions. [2019-09-08 09:28:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:28:58,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:58,241 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] [2019-09-08 09:28:58,241 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-08 09:28:58,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:58,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:58,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:58,295 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 09:28:58,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:58,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:58,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:58,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:58,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:58,296 INFO L87 Difference]: Start difference. First operand 9182 states and 14930 transitions. Second operand 3 states. [2019-09-08 09:28:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:59,022 INFO L93 Difference]: Finished difference Result 18418 states and 30074 transitions. [2019-09-08 09:28:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:59,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:28:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:59,095 INFO L225 Difference]: With dead ends: 18418 [2019-09-08 09:28:59,095 INFO L226 Difference]: Without dead ends: 12524 [2019-09-08 09:28:59,116 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 09:28:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12524 states. [2019-09-08 09:28:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12524 to 12522. [2019-09-08 09:28:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-09-08 09:28:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 20302 transitions. [2019-09-08 09:28:59,740 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 20302 transitions. Word has length 69 [2019-09-08 09:28:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:59,741 INFO L475 AbstractCegarLoop]: Abstraction has 12522 states and 20302 transitions. [2019-09-08 09:28:59,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:28:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 20302 transitions. [2019-09-08 09:28:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:28:59,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:59,743 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] [2019-09-08 09:28:59,743 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:59,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-08 09:28:59,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:59,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:59,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:28:59,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:59,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:28:59,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:28:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:28:59,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:28:59,841 INFO L87 Difference]: Start difference. First operand 12522 states and 20302 transitions. Second operand 4 states. [2019-09-08 09:29:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:01,401 INFO L93 Difference]: Finished difference Result 37062 states and 60341 transitions. [2019-09-08 09:29:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:29:01,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 09:29:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:01,480 INFO L225 Difference]: With dead ends: 37062 [2019-09-08 09:29:01,480 INFO L226 Difference]: Without dead ends: 24678 [2019-09-08 09:29:01,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24678 states. [2019-09-08 09:29:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24678 to 18542. [2019-09-08 09:29:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18542 states. [2019-09-08 09:29:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18542 states to 18542 states and 30049 transitions. [2019-09-08 09:29:02,588 INFO L78 Accepts]: Start accepts. Automaton has 18542 states and 30049 transitions. Word has length 69 [2019-09-08 09:29:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:02,589 INFO L475 AbstractCegarLoop]: Abstraction has 18542 states and 30049 transitions. [2019-09-08 09:29:02,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:29:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states and 30049 transitions. [2019-09-08 09:29:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:29:02,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:02,590 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] [2019-09-08 09:29:02,591 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash 795480594, now seen corresponding path program 1 times [2019-09-08 09:29:02,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:02,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:02,645 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 09:29:02,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:02,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:02,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:02,646 INFO L87 Difference]: Start difference. First operand 18542 states and 30049 transitions. Second operand 3 states. [2019-09-08 09:29:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:03,644 INFO L93 Difference]: Finished difference Result 42580 states and 69526 transitions. [2019-09-08 09:29:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:03,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 09:29:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:03,713 INFO L225 Difference]: With dead ends: 42580 [2019-09-08 09:29:03,713 INFO L226 Difference]: Without dead ends: 27783 [2019-09-08 09:29:03,749 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 09:29:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27783 states. [2019-09-08 09:29:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27783 to 27781. [2019-09-08 09:29:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27781 states. [2019-09-08 09:29:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27781 states to 27781 states and 44921 transitions. [2019-09-08 09:29:04,874 INFO L78 Accepts]: Start accepts. Automaton has 27781 states and 44921 transitions. Word has length 69 [2019-09-08 09:29:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:04,874 INFO L475 AbstractCegarLoop]: Abstraction has 27781 states and 44921 transitions. [2019-09-08 09:29:04,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27781 states and 44921 transitions. [2019-09-08 09:29:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 09:29:04,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:04,876 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 09:29:04,876 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:04,877 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-08 09:29:04,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:04,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:04,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:04,995 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 09:29:04,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:04,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:29:04,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:29:04,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:29:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:04,997 INFO L87 Difference]: Start difference. First operand 27781 states and 44921 transitions. Second operand 5 states. [2019-09-08 09:29:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:06,622 INFO L93 Difference]: Finished difference Result 55483 states and 89730 transitions. [2019-09-08 09:29:06,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:29:06,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 09:29:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:06,685 INFO L225 Difference]: With dead ends: 55483 [2019-09-08 09:29:06,685 INFO L226 Difference]: Without dead ends: 27787 [2019-09-08 09:29:06,735 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 09:29:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27787 states. [2019-09-08 09:29:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27787 to 27781. [2019-09-08 09:29:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27781 states. [2019-09-08 09:29:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27781 states to 27781 states and 44786 transitions. [2019-09-08 09:29:07,983 INFO L78 Accepts]: Start accepts. Automaton has 27781 states and 44786 transitions. Word has length 71 [2019-09-08 09:29:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:07,983 INFO L475 AbstractCegarLoop]: Abstraction has 27781 states and 44786 transitions. [2019-09-08 09:29:07,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:29:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 27781 states and 44786 transitions. [2019-09-08 09:29:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 09:29:07,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:07,984 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 09:29:07,984 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-08 09:29:07,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:07,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:08,118 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 09:29:08,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:08,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:29:08,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:29:08,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:29:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:08,120 INFO L87 Difference]: Start difference. First operand 27781 states and 44786 transitions. Second operand 5 states. [2019-09-08 09:29:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:09,832 INFO L93 Difference]: Finished difference Result 77431 states and 125034 transitions. [2019-09-08 09:29:09,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:29:09,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 09:29:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:09,960 INFO L225 Difference]: With dead ends: 77431 [2019-09-08 09:29:09,960 INFO L226 Difference]: Without dead ends: 49735 [2019-09-08 09:29:10,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:29:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49735 states. [2019-09-08 09:29:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49735 to 49733. [2019-09-08 09:29:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49733 states. [2019-09-08 09:29:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49733 states to 49733 states and 79717 transitions. [2019-09-08 09:29:12,650 INFO L78 Accepts]: Start accepts. Automaton has 49733 states and 79717 transitions. Word has length 74 [2019-09-08 09:29:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:12,651 INFO L475 AbstractCegarLoop]: Abstraction has 49733 states and 79717 transitions. [2019-09-08 09:29:12,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:29:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49733 states and 79717 transitions. [2019-09-08 09:29:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 09:29:12,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:12,654 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 09:29:12,654 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-08 09:29:12,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:12,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:12,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:12,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:12,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:12,748 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 09:29:12,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:12,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:29:12,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:29:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:29:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:12,749 INFO L87 Difference]: Start difference. First operand 49733 states and 79717 transitions. Second operand 5 states. [2019-09-08 09:29:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:15,754 INFO L93 Difference]: Finished difference Result 87413 states and 139309 transitions. [2019-09-08 09:29:15,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:29:15,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 09:29:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:15,882 INFO L225 Difference]: With dead ends: 87413 [2019-09-08 09:29:15,882 INFO L226 Difference]: Without dead ends: 87411 [2019-09-08 09:29:15,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:29:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87411 states. [2019-09-08 09:29:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87411 to 50969. [2019-09-08 09:29:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50969 states. [2019-09-08 09:29:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50969 states to 50969 states and 80944 transitions. [2019-09-08 09:29:19,337 INFO L78 Accepts]: Start accepts. Automaton has 50969 states and 80944 transitions. Word has length 75 [2019-09-08 09:29:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:19,337 INFO L475 AbstractCegarLoop]: Abstraction has 50969 states and 80944 transitions. [2019-09-08 09:29:19,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:29:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50969 states and 80944 transitions. [2019-09-08 09:29:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:29:19,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:19,340 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, 1, 1, 1] [2019-09-08 09:29:19,340 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-08 09:29:19,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:19,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:19,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:29:19,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:19,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:19,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:19,437 INFO L87 Difference]: Start difference. First operand 50969 states and 80944 transitions. Second operand 3 states. [2019-09-08 09:29:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:21,250 INFO L93 Difference]: Finished difference Result 94985 states and 151372 transitions. [2019-09-08 09:29:21,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:21,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:29:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:21,313 INFO L225 Difference]: With dead ends: 94985 [2019-09-08 09:29:21,314 INFO L226 Difference]: Without dead ends: 44101 [2019-09-08 09:29:21,372 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 09:29:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44101 states. [2019-09-08 09:29:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44101 to 44099. [2019-09-08 09:29:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44099 states. [2019-09-08 09:29:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44099 states to 44099 states and 70075 transitions. [2019-09-08 09:29:23,223 INFO L78 Accepts]: Start accepts. Automaton has 44099 states and 70075 transitions. Word has length 97 [2019-09-08 09:29:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:23,224 INFO L475 AbstractCegarLoop]: Abstraction has 44099 states and 70075 transitions. [2019-09-08 09:29:23,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 44099 states and 70075 transitions. [2019-09-08 09:29:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:29:23,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:23,226 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, 1, 1, 1] [2019-09-08 09:29:23,226 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 88438004, now seen corresponding path program 1 times [2019-09-08 09:29:23,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:23,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:23,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:29:23,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:23,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:23,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:23,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:23,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:23,294 INFO L87 Difference]: Start difference. First operand 44099 states and 70075 transitions. Second operand 3 states. [2019-09-08 09:29:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:24,036 INFO L93 Difference]: Finished difference Result 62553 states and 99549 transitions. [2019-09-08 09:29:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:24,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:29:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:24,060 INFO L225 Difference]: With dead ends: 62553 [2019-09-08 09:29:24,060 INFO L226 Difference]: Without dead ends: 18566 [2019-09-08 09:29:24,101 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 09:29:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18566 states. [2019-09-08 09:29:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18566 to 18564. [2019-09-08 09:29:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18564 states. [2019-09-08 09:29:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18564 states to 18564 states and 29421 transitions. [2019-09-08 09:29:24,748 INFO L78 Accepts]: Start accepts. Automaton has 18564 states and 29421 transitions. Word has length 97 [2019-09-08 09:29:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:24,748 INFO L475 AbstractCegarLoop]: Abstraction has 18564 states and 29421 transitions. [2019-09-08 09:29:24,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18564 states and 29421 transitions. [2019-09-08 09:29:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:29:24,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:24,750 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:24,751 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -680214214, now seen corresponding path program 1 times [2019-09-08 09:29:24,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:24,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:24,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:24,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:29:24,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:29:24,846 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) [2019-09-08 09:29:24,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:29:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:25,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:29:25,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:29:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:29:26,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:29:26,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:29:26,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:29:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:29:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:29:26,255 INFO L87 Difference]: Start difference. First operand 18564 states and 29421 transitions. Second operand 8 states. [2019-09-08 09:29:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:28,567 INFO L93 Difference]: Finished difference Result 35245 states and 56049 transitions. [2019-09-08 09:29:28,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:29:28,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-09-08 09:29:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:28,685 INFO L225 Difference]: With dead ends: 35245 [2019-09-08 09:29:28,685 INFO L226 Difference]: Without dead ends: 30563 [2019-09-08 09:29:28,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:29:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30563 states. [2019-09-08 09:29:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30563 to 26895. [2019-09-08 09:29:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26895 states. [2019-09-08 09:29:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26895 states to 26895 states and 42723 transitions. [2019-09-08 09:29:30,874 INFO L78 Accepts]: Start accepts. Automaton has 26895 states and 42723 transitions. Word has length 99 [2019-09-08 09:29:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:30,874 INFO L475 AbstractCegarLoop]: Abstraction has 26895 states and 42723 transitions. [2019-09-08 09:29:30,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:29:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26895 states and 42723 transitions. [2019-09-08 09:29:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:29:30,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:30,876 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:30,877 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1255185238, now seen corresponding path program 1 times [2019-09-08 09:29:30,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:30,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:30,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:29:30,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:30,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:30,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:30,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:30,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:30,950 INFO L87 Difference]: Start difference. First operand 26895 states and 42723 transitions. Second operand 3 states. [2019-09-08 09:29:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:31,405 INFO L93 Difference]: Finished difference Result 37813 states and 60172 transitions. [2019-09-08 09:29:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:31,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:29:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:31,424 INFO L225 Difference]: With dead ends: 37813 [2019-09-08 09:29:31,424 INFO L226 Difference]: Without dead ends: 11046 [2019-09-08 09:29:31,453 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 09:29:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11046 states. [2019-09-08 09:29:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11046 to 11044. [2019-09-08 09:29:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11044 states. [2019-09-08 09:29:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 17493 transitions. [2019-09-08 09:29:32,120 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 17493 transitions. Word has length 99 [2019-09-08 09:29:32,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:32,120 INFO L475 AbstractCegarLoop]: Abstraction has 11044 states and 17493 transitions. [2019-09-08 09:29:32,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 17493 transitions. [2019-09-08 09:29:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 09:29:32,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:32,122 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:32,122 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1045071639, now seen corresponding path program 1 times [2019-09-08 09:29:32,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:32,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:29:32,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:29:32,209 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 09:29:32,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:32,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:29:32,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:29:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:29:32,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:29:32,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:29:32,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:29:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:29:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:29:32,433 INFO L87 Difference]: Start difference. First operand 11044 states and 17493 transitions. Second operand 8 states. [2019-09-08 09:29:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:33,457 INFO L93 Difference]: Finished difference Result 21825 states and 34680 transitions. [2019-09-08 09:29:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:29:33,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-08 09:29:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:33,475 INFO L225 Difference]: With dead ends: 21825 [2019-09-08 09:29:33,476 INFO L226 Difference]: Without dead ends: 15684 [2019-09-08 09:29:33,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:29:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15684 states. [2019-09-08 09:29:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15684 to 14127. [2019-09-08 09:29:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14127 states. [2019-09-08 09:29:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14127 states to 14127 states and 22371 transitions. [2019-09-08 09:29:34,265 INFO L78 Accepts]: Start accepts. Automaton has 14127 states and 22371 transitions. Word has length 101 [2019-09-08 09:29:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:34,266 INFO L475 AbstractCegarLoop]: Abstraction has 14127 states and 22371 transitions. [2019-09-08 09:29:34,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:29:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14127 states and 22371 transitions. [2019-09-08 09:29:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 09:29:34,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:34,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:34,268 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash 343541437, now seen corresponding path program 1 times [2019-09-08 09:29:34,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:34,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:34,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:29:34,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:34,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:29:34,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:29:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:29:34,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:34,373 INFO L87 Difference]: Start difference. First operand 14127 states and 22371 transitions. Second operand 5 states. [2019-09-08 09:29:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:35,206 INFO L93 Difference]: Finished difference Result 26530 states and 42140 transitions. [2019-09-08 09:29:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:29:35,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 09:29:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:35,230 INFO L225 Difference]: With dead ends: 26530 [2019-09-08 09:29:35,230 INFO L226 Difference]: Without dead ends: 17091 [2019-09-08 09:29:35,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 09:29:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17091 states. [2019-09-08 09:29:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17091 to 17061. [2019-09-08 09:29:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17061 states. [2019-09-08 09:29:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17061 states to 17061 states and 26967 transitions. [2019-09-08 09:29:35,939 INFO L78 Accepts]: Start accepts. Automaton has 17061 states and 26967 transitions. Word has length 101 [2019-09-08 09:29:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:35,939 INFO L475 AbstractCegarLoop]: Abstraction has 17061 states and 26967 transitions. [2019-09-08 09:29:35,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:29:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17061 states and 26967 transitions. [2019-09-08 09:29:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:29:35,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:35,941 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:35,941 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-08 09:29:35,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:35,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:35,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:29:36,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:36,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:29:36,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:29:36,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:29:36,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:29:36,071 INFO L87 Difference]: Start difference. First operand 17061 states and 26967 transitions. Second operand 4 states. [2019-09-08 09:29:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:37,573 INFO L93 Difference]: Finished difference Result 50265 states and 79432 transitions. [2019-09-08 09:29:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:29:37,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:29:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:37,612 INFO L225 Difference]: With dead ends: 50265 [2019-09-08 09:29:37,612 INFO L226 Difference]: Without dead ends: 33217 [2019-09-08 09:29:37,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33217 states. [2019-09-08 09:29:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33217 to 33215. [2019-09-08 09:29:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33215 states. [2019-09-08 09:29:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33215 states to 33215 states and 52117 transitions. [2019-09-08 09:29:39,096 INFO L78 Accepts]: Start accepts. Automaton has 33215 states and 52117 transitions. Word has length 102 [2019-09-08 09:29:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:39,096 INFO L475 AbstractCegarLoop]: Abstraction has 33215 states and 52117 transitions. [2019-09-08 09:29:39,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:29:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 33215 states and 52117 transitions. [2019-09-08 09:29:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 09:29:39,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:39,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:39,099 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1735669958, now seen corresponding path program 1 times [2019-09-08 09:29:39,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:29:39,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:39,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:39,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:39,138 INFO L87 Difference]: Start difference. First operand 33215 states and 52117 transitions. Second operand 3 states. [2019-09-08 09:29:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:42,701 INFO L93 Difference]: Finished difference Result 99599 states and 156281 transitions. [2019-09-08 09:29:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:42,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 09:29:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:42,772 INFO L225 Difference]: With dead ends: 99599 [2019-09-08 09:29:42,772 INFO L226 Difference]: Without dead ends: 66416 [2019-09-08 09:29:42,803 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 09:29:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66416 states. [2019-09-08 09:29:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66416 to 33217. [2019-09-08 09:29:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33217 states. [2019-09-08 09:29:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33217 states to 33217 states and 52119 transitions. [2019-09-08 09:29:44,643 INFO L78 Accepts]: Start accepts. Automaton has 33217 states and 52119 transitions. Word has length 103 [2019-09-08 09:29:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:44,644 INFO L475 AbstractCegarLoop]: Abstraction has 33217 states and 52119 transitions. [2019-09-08 09:29:44,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33217 states and 52119 transitions. [2019-09-08 09:29:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:29:44,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:44,646 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:44,646 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash -854773197, now seen corresponding path program 1 times [2019-09-08 09:29:44,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:44,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:44,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 09:29:44,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:44,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:44,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:44,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:44,714 INFO L87 Difference]: Start difference. First operand 33217 states and 52119 transitions. Second operand 3 states. [2019-09-08 09:29:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:48,399 INFO L93 Difference]: Finished difference Result 97667 states and 153224 transitions. [2019-09-08 09:29:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:29:48,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 09:29:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:48,478 INFO L225 Difference]: With dead ends: 97667 [2019-09-08 09:29:48,478 INFO L226 Difference]: Without dead ends: 64630 [2019-09-08 09:29:48,512 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 09:29:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64630 states. [2019-09-08 09:29:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64630 to 64628. [2019-09-08 09:29:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64628 states. [2019-09-08 09:29:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64628 states to 64628 states and 100619 transitions. [2019-09-08 09:29:53,593 INFO L78 Accepts]: Start accepts. Automaton has 64628 states and 100619 transitions. Word has length 104 [2019-09-08 09:29:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:53,593 INFO L475 AbstractCegarLoop]: Abstraction has 64628 states and 100619 transitions. [2019-09-08 09:29:53,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 64628 states and 100619 transitions. [2019-09-08 09:29:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 09:29:53,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:53,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:53,596 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:53,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1855097296, now seen corresponding path program 1 times [2019-09-08 09:29:53,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:53,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:53,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:53,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:53,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:29:53,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:53,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:29:53,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:29:53,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:29:53,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:29:53,690 INFO L87 Difference]: Start difference. First operand 64628 states and 100619 transitions. Second operand 4 states. [2019-09-08 09:29:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:56,535 INFO L93 Difference]: Finished difference Result 113825 states and 176929 transitions. [2019-09-08 09:29:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:29:56,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 09:29:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:56,600 INFO L225 Difference]: With dead ends: 113825 [2019-09-08 09:29:56,600 INFO L226 Difference]: Without dead ends: 49367 [2019-09-08 09:29:56,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49367 states. [2019-09-08 09:29:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49367 to 49367. [2019-09-08 09:29:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49367 states. [2019-09-08 09:29:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49367 states to 49367 states and 76535 transitions. [2019-09-08 09:29:59,584 INFO L78 Accepts]: Start accepts. Automaton has 49367 states and 76535 transitions. Word has length 104 [2019-09-08 09:29:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:59,585 INFO L475 AbstractCegarLoop]: Abstraction has 49367 states and 76535 transitions. [2019-09-08 09:29:59,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:29:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 49367 states and 76535 transitions. [2019-09-08 09:29:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 09:29:59,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:59,587 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:59,587 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash -836909356, now seen corresponding path program 1 times [2019-09-08 09:29:59,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:59,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:29:59,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:29:59,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 09:29:59,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:29:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:59,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:29:59,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:29:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:29:59,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:29:59,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2019-09-08 09:29:59,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:29:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:29:59,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:29:59,987 INFO L87 Difference]: Start difference. First operand 49367 states and 76535 transitions. Second operand 9 states. [2019-09-08 09:30:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:06,021 INFO L93 Difference]: Finished difference Result 92924 states and 144260 transitions. [2019-09-08 09:30:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:06,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-08 09:30:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:06,142 INFO L225 Difference]: With dead ends: 92924 [2019-09-08 09:30:06,142 INFO L226 Difference]: Without dead ends: 80174 [2019-09-08 09:30:06,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:30:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80174 states. [2019-09-08 09:30:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80174 to 76393. [2019-09-08 09:30:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76393 states. [2019-09-08 09:30:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76393 states to 76393 states and 118188 transitions. [2019-09-08 09:30:10,940 INFO L78 Accepts]: Start accepts. Automaton has 76393 states and 118188 transitions. Word has length 106 [2019-09-08 09:30:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:10,941 INFO L475 AbstractCegarLoop]: Abstraction has 76393 states and 118188 transitions. [2019-09-08 09:30:10,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:30:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 76393 states and 118188 transitions. [2019-09-08 09:30:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 09:30:10,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:10,944 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:30:10,944 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash 998727188, now seen corresponding path program 1 times [2019-09-08 09:30:10,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:10,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:30:11,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:11,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:30:11,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:30:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:30:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:30:11,077 INFO L87 Difference]: Start difference. First operand 76393 states and 118188 transitions. Second operand 4 states. [2019-09-08 09:30:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:20,251 INFO L93 Difference]: Finished difference Result 201282 states and 311106 transitions. [2019-09-08 09:30:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:30:20,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-08 09:30:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:20,418 INFO L225 Difference]: With dead ends: 201282 [2019-09-08 09:30:20,418 INFO L226 Difference]: Without dead ends: 124912 [2019-09-08 09:30:20,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:30:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124912 states. [2019-09-08 09:30:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124912 to 124910. [2019-09-08 09:30:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124910 states. [2019-09-08 09:30:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124910 states to 124910 states and 191264 transitions. [2019-09-08 09:30:32,773 INFO L78 Accepts]: Start accepts. Automaton has 124910 states and 191264 transitions. Word has length 106 [2019-09-08 09:30:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:30:32,773 INFO L475 AbstractCegarLoop]: Abstraction has 124910 states and 191264 transitions. [2019-09-08 09:30:32,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:30:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 124910 states and 191264 transitions. [2019-09-08 09:30:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 09:30:32,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:30:32,777 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:30:32,777 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:30:32,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:30:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash -229277515, now seen corresponding path program 1 times [2019-09-08 09:30:32,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:30:32,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:30:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:30:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:30:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:30:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:30:32,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:30:32,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:30:32,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:30:32,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:30:32,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:30:32,845 INFO L87 Difference]: Start difference. First operand 124910 states and 191264 transitions. Second operand 3 states. [2019-09-08 09:30:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:48,925 INFO L93 Difference]: Finished difference Result 367284 states and 562032 transitions. [2019-09-08 09:30:48,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:48,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 09:30:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:49,303 INFO L225 Difference]: With dead ends: 367284 [2019-09-08 09:30:49,303 INFO L226 Difference]: Without dead ends: 242759 [2019-09-08 09:30:49,408 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 09:30:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242759 states. [2019-09-08 09:31:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242759 to 242757. [2019-09-08 09:31:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242757 states. [2019-09-08 09:31:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242757 states to 242757 states and 368452 transitions. [2019-09-08 09:31:10,499 INFO L78 Accepts]: Start accepts. Automaton has 242757 states and 368452 transitions. Word has length 108 [2019-09-08 09:31:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:10,499 INFO L475 AbstractCegarLoop]: Abstraction has 242757 states and 368452 transitions. [2019-09-08 09:31:10,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 242757 states and 368452 transitions. [2019-09-08 09:31:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 09:31:10,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:10,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:10,506 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1206084882, now seen corresponding path program 1 times [2019-09-08 09:31:10,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:10,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:31:10,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:10,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:10,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:10,623 INFO L87 Difference]: Start difference. First operand 242757 states and 368452 transitions. Second operand 4 states. [2019-09-08 09:31:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:28,097 INFO L93 Difference]: Finished difference Result 390996 states and 592609 transitions. [2019-09-08 09:31:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:28,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-08 09:31:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:28,386 INFO L225 Difference]: With dead ends: 390996 [2019-09-08 09:31:28,386 INFO L226 Difference]: Without dead ends: 196990 [2019-09-08 09:31:28,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:31:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196990 states. [2019-09-08 09:31:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196990 to 196990. [2019-09-08 09:31:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196990 states. [2019-09-08 09:31:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196990 states to 196990 states and 298096 transitions. [2019-09-08 09:31:46,856 INFO L78 Accepts]: Start accepts. Automaton has 196990 states and 298096 transitions. Word has length 108 [2019-09-08 09:31:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:46,857 INFO L475 AbstractCegarLoop]: Abstraction has 196990 states and 298096 transitions. [2019-09-08 09:31:46,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:31:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 196990 states and 298096 transitions. [2019-09-08 09:31:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 09:31:46,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:46,863 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:46,864 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2089837102, now seen corresponding path program 1 times [2019-09-08 09:31:46,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:46,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:46,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 09:31:46,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:46,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:46,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:46,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:46,915 INFO L87 Difference]: Start difference. First operand 196990 states and 298096 transitions. Second operand 3 states. [2019-09-08 09:32:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:18,291 INFO L93 Difference]: Finished difference Result 586730 states and 886533 transitions. [2019-09-08 09:32:18,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:18,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 09:32:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:19,434 INFO L225 Difference]: With dead ends: 586730 [2019-09-08 09:32:19,435 INFO L226 Difference]: Without dead ends: 390447 [2019-09-08 09:32:19,608 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 09:32:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390447 states. [2019-09-08 09:32:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390447 to 390445. [2019-09-08 09:32:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390445 states. [2019-09-08 09:32:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390445 states to 390445 states and 586026 transitions. [2019-09-08 09:32:55,099 INFO L78 Accepts]: Start accepts. Automaton has 390445 states and 586026 transitions. Word has length 110 [2019-09-08 09:32:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:55,100 INFO L475 AbstractCegarLoop]: Abstraction has 390445 states and 586026 transitions. [2019-09-08 09:32:55,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 390445 states and 586026 transitions. [2019-09-08 09:32:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 09:32:55,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:55,111 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:55,111 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:55,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1973856727, now seen corresponding path program 1 times [2019-09-08 09:32:55,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:55,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:55,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:55,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:55,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:32:55,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:55,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:55,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:55,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:55,238 INFO L87 Difference]: Start difference. First operand 390445 states and 586026 transitions. Second operand 4 states. [2019-09-08 09:34:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:34:03,596 INFO L93 Difference]: Finished difference Result 1149238 states and 1722753 transitions. [2019-09-08 09:34:03,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:34:03,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-08 09:34:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:34:04,920 INFO L225 Difference]: With dead ends: 1149238 [2019-09-08 09:34:04,920 INFO L226 Difference]: Without dead ends: 758836 [2019-09-08 09:34:05,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:34:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758836 states. [2019-09-08 09:35:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758836 to 758834. [2019-09-08 09:35:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758834 states. [2019-09-08 09:35:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758834 states to 758834 states and 1127989 transitions. [2019-09-08 09:35:27,917 INFO L78 Accepts]: Start accepts. Automaton has 758834 states and 1127989 transitions. Word has length 110 [2019-09-08 09:35:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:27,917 INFO L475 AbstractCegarLoop]: Abstraction has 758834 states and 1127989 transitions. [2019-09-08 09:35:27,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:35:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 758834 states and 1127989 transitions. [2019-09-08 09:35:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 09:35:27,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:27,944 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:35:27,944 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash 325039021, now seen corresponding path program 1 times [2019-09-08 09:35:27,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:27,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:27,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:27,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:27,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:35:27,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:27,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:27,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:27,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:27,992 INFO L87 Difference]: Start difference. First operand 758834 states and 1127989 transitions. Second operand 3 states. [2019-09-08 09:37:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:37:56,813 INFO L93 Difference]: Finished difference Result 2276304 states and 3383712 transitions. [2019-09-08 09:37:56,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:37:56,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 09:37:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:37:59,655 INFO L225 Difference]: With dead ends: 2276304 [2019-09-08 09:37:59,655 INFO L226 Difference]: Without dead ends: 1517578 [2019-09-08 09:38:00,285 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 09:38:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517578 states. [2019-09-08 09:39:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517578 to 758840. [2019-09-08 09:39:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758840 states.