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.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:52:24,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:52:24,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:52:24,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:52:24,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:52:24,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:52:24,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:52:24,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:52:24,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:52:24,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:52:24,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:52:24,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:52:24,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:52:24,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:52:24,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:52:24,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:52:24,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:52:24,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:52:24,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:52:24,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:52:24,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:52:24,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:52:24,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:52:24,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:52:24,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:52:24,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:52:24,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:52:24,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:52:24,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:52:24,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:52:24,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:52:24,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:52:24,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:52:24,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:52:24,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:52:24,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:52:24,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:52:24,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:52:24,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:52:24,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:52:24,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:52:24,628 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:52:24,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:52:24,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:52:24,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:52:24,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:52:24,653 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:52:24,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:52:24,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:52:24,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:52:24,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:52:24,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:52:24,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:52:24,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:52:24,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:52:24,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:52:24,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:52:24,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:52:24,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:52:24,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:52:24,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:52:24,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:52:24,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:52:24,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:52:24,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:52:24,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:52:24,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:52:24,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:52:24,659 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:52:24,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:52:24,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:52:24,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:52:24,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:52:24,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:52:24,719 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:52:24,720 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:52:24,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:52:24,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6370c56/0fc7d2b713e148b1aaf91b5986d8a7dc/FLAG13597f7b2 [2019-09-08 09:52:25,412 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:52:25,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:52:25,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6370c56/0fc7d2b713e148b1aaf91b5986d8a7dc/FLAG13597f7b2 [2019-09-08 09:52:25,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6370c56/0fc7d2b713e148b1aaf91b5986d8a7dc [2019-09-08 09:52:25,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:52:25,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:52:25,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:52:25,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:52:25,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:52:25,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:52:25" (1/1) ... [2019-09-08 09:52:25,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10822750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:25, skipping insertion in model container [2019-09-08 09:52:25,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:52:25" (1/1) ... [2019-09-08 09:52:25,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:52:25,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:52:26,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:52:26,799 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:52:27,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:52:27,405 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:52:27,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27 WrapperNode [2019-09-08 09:52:27,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:52:27,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:52:27,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:52:27,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:52:27,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (1/1) ... [2019-09-08 09:52:27,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (1/1) ... [2019-09-08 09:52:27,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (1/1) ... [2019-09-08 09:52:27,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (1/1) ... [2019-09-08 09:52:27,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (1/1) ... [2019-09-08 09:52:27,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (1/1) ... [2019-09-08 09:52:27,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (1/1) ... [2019-09-08 09:52:27,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:52:27,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:52:27,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:52:27,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:52:27,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (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:52:27,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:52:27,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:52:27,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:52:27,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:52:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:52:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:52:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:52:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:52:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:52:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:52:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:52:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:52:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:52:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:52:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:52:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:52:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:52:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:52:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:52:30,033 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:52:30,034 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:52:30,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:52:30 BoogieIcfgContainer [2019-09-08 09:52:30,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:52:30,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:52:30,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:52:30,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:52:30,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:52:25" (1/3) ... [2019-09-08 09:52:30,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e689c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:52:30, skipping insertion in model container [2019-09-08 09:52:30,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:52:27" (2/3) ... [2019-09-08 09:52:30,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e689c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:52:30, skipping insertion in model container [2019-09-08 09:52:30,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:52:30" (3/3) ... [2019-09-08 09:52:30,043 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:52:30,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:52:30,064 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:52:30,081 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:52:30,122 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:52:30,123 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:52:30,123 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:52:30,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:52:30,124 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:52:30,124 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:52:30,124 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:52:30,124 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:52:30,124 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:52:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states. [2019-09-08 09:52:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:52:30,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:30,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,186 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:30,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash 858579338, now seen corresponding path program 1 times [2019-09-08 09:52:30,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:30,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:30,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:30,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:31,117 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:52:31,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:31,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:31,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:31,145 INFO L87 Difference]: Start difference. First operand 724 states. Second operand 3 states. [2019-09-08 09:52:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:31,551 INFO L93 Difference]: Finished difference Result 1342 states and 2373 transitions. [2019-09-08 09:52:31,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:31,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:52:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:31,578 INFO L225 Difference]: With dead ends: 1342 [2019-09-08 09:52:31,579 INFO L226 Difference]: Without dead ends: 1158 [2019-09-08 09:52:31,584 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:52:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-08 09:52:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-09-08 09:52:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-09-08 09:52:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1795 transitions. [2019-09-08 09:52:31,714 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1795 transitions. Word has length 308 [2019-09-08 09:52:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:31,716 INFO L475 AbstractCegarLoop]: Abstraction has 1156 states and 1795 transitions. [2019-09-08 09:52:31,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1795 transitions. [2019-09-08 09:52:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:52:31,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:31,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:31,725 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:31,726 INFO L82 PathProgramCache]: Analyzing trace with hash 165879038, now seen corresponding path program 1 times [2019-09-08 09:52:31,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:31,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:31,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:31,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:31,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:32,090 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:52:32,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:32,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:32,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:32,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:32,096 INFO L87 Difference]: Start difference. First operand 1156 states and 1795 transitions. Second operand 3 states. [2019-09-08 09:52:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:32,298 INFO L93 Difference]: Finished difference Result 2336 states and 3662 transitions. [2019-09-08 09:52:32,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:32,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:52:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:32,311 INFO L225 Difference]: With dead ends: 2336 [2019-09-08 09:52:32,312 INFO L226 Difference]: Without dead ends: 2014 [2019-09-08 09:52:32,315 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:52:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-09-08 09:52:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2012. [2019-09-08 09:52:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-09-08 09:52:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3117 transitions. [2019-09-08 09:52:32,393 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3117 transitions. Word has length 308 [2019-09-08 09:52:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:32,394 INFO L475 AbstractCegarLoop]: Abstraction has 2012 states and 3117 transitions. [2019-09-08 09:52:32,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3117 transitions. [2019-09-08 09:52:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:52:32,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:32,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:32,402 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 853287994, now seen corresponding path program 1 times [2019-09-08 09:52:32,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:32,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:32,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:32,724 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:52:32,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:32,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:32,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:32,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:32,727 INFO L87 Difference]: Start difference. First operand 2012 states and 3117 transitions. Second operand 3 states. [2019-09-08 09:52:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:32,995 INFO L93 Difference]: Finished difference Result 4296 states and 6719 transitions. [2019-09-08 09:52:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:32,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:52:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:33,020 INFO L225 Difference]: With dead ends: 4296 [2019-09-08 09:52:33,021 INFO L226 Difference]: Without dead ends: 3694 [2019-09-08 09:52:33,025 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:52:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-09-08 09:52:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3692. [2019-09-08 09:52:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3692 states. [2019-09-08 09:52:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5701 transitions. [2019-09-08 09:52:33,192 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5701 transitions. Word has length 308 [2019-09-08 09:52:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:33,193 INFO L475 AbstractCegarLoop]: Abstraction has 3692 states and 5701 transitions. [2019-09-08 09:52:33,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5701 transitions. [2019-09-08 09:52:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:52:33,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:33,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:33,203 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash -485468594, now seen corresponding path program 1 times [2019-09-08 09:52:33,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:33,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:33,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:33,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:33,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:33,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:33,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:33,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:33,600 INFO L87 Difference]: Start difference. First operand 3692 states and 5701 transitions. Second operand 3 states. [2019-09-08 09:52:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:34,004 INFO L93 Difference]: Finished difference Result 8112 states and 12643 transitions. [2019-09-08 09:52:34,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:34,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:52:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:34,041 INFO L225 Difference]: With dead ends: 8112 [2019-09-08 09:52:34,041 INFO L226 Difference]: Without dead ends: 6990 [2019-09-08 09:52:34,046 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:52:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2019-09-08 09:52:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 6988. [2019-09-08 09:52:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6988 states. [2019-09-08 09:52:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 10749 transitions. [2019-09-08 09:52:34,342 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 10749 transitions. Word has length 308 [2019-09-08 09:52:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:34,343 INFO L475 AbstractCegarLoop]: Abstraction has 6988 states and 10749 transitions. [2019-09-08 09:52:34,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 10749 transitions. [2019-09-08 09:52:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:52:34,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:34,359 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:34,359 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1823125226, now seen corresponding path program 1 times [2019-09-08 09:52:34,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:34,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:34,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:34,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:34,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:35,124 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:52:35,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:35,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:35,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:35,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:35,126 INFO L87 Difference]: Start difference. First operand 6988 states and 10749 transitions. Second operand 4 states. [2019-09-08 09:52:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:35,703 INFO L93 Difference]: Finished difference Result 20686 states and 31802 transitions. [2019-09-08 09:52:35,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:35,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:52:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:35,770 INFO L225 Difference]: With dead ends: 20686 [2019-09-08 09:52:35,770 INFO L226 Difference]: Without dead ends: 13713 [2019-09-08 09:52:35,789 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:52:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13713 states. [2019-09-08 09:52:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13713 to 13711. [2019-09-08 09:52:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13711 states. [2019-09-08 09:52:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13711 states to 13711 states and 20970 transitions. [2019-09-08 09:52:36,484 INFO L78 Accepts]: Start accepts. Automaton has 13711 states and 20970 transitions. Word has length 308 [2019-09-08 09:52:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:36,484 INFO L475 AbstractCegarLoop]: Abstraction has 13711 states and 20970 transitions. [2019-09-08 09:52:36,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 13711 states and 20970 transitions. [2019-09-08 09:52:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:52:36,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:36,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:36,514 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1863537621, now seen corresponding path program 1 times [2019-09-08 09:52:36,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:36,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:36,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:36,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:36,656 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:52:36,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:36,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:36,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:36,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:36,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:36,658 INFO L87 Difference]: Start difference. First operand 13711 states and 20970 transitions. Second operand 3 states. [2019-09-08 09:52:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:37,870 INFO L93 Difference]: Finished difference Result 41088 states and 62839 transitions. [2019-09-08 09:52:37,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:37,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:52:37,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:37,927 INFO L225 Difference]: With dead ends: 41088 [2019-09-08 09:52:37,928 INFO L226 Difference]: Without dead ends: 27402 [2019-09-08 09:52:37,956 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:52:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27402 states. [2019-09-08 09:52:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27402 to 13724. [2019-09-08 09:52:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13724 states. [2019-09-08 09:52:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13724 states to 13724 states and 20989 transitions. [2019-09-08 09:52:38,620 INFO L78 Accepts]: Start accepts. Automaton has 13724 states and 20989 transitions. Word has length 310 [2019-09-08 09:52:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:38,620 INFO L475 AbstractCegarLoop]: Abstraction has 13724 states and 20989 transitions. [2019-09-08 09:52:38,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 13724 states and 20989 transitions. [2019-09-08 09:52:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:52:38,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:38,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:38,650 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -978100656, now seen corresponding path program 1 times [2019-09-08 09:52:38,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:38,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:38,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:38,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:39,022 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:52:39,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:39,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:39,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:39,025 INFO L87 Difference]: Start difference. First operand 13724 states and 20989 transitions. Second operand 3 states. [2019-09-08 09:52:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:39,855 INFO L93 Difference]: Finished difference Result 40511 states and 61890 transitions. [2019-09-08 09:52:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:39,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:52:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:39,914 INFO L225 Difference]: With dead ends: 40511 [2019-09-08 09:52:39,914 INFO L226 Difference]: Without dead ends: 26929 [2019-09-08 09:52:39,957 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:52:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26929 states. [2019-09-08 09:52:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26929 to 26927. [2019-09-08 09:52:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26927 states. [2019-09-08 09:52:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26927 states to 26927 states and 40941 transitions. [2019-09-08 09:52:40,994 INFO L78 Accepts]: Start accepts. Automaton has 26927 states and 40941 transitions. Word has length 310 [2019-09-08 09:52:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:40,994 INFO L475 AbstractCegarLoop]: Abstraction has 26927 states and 40941 transitions. [2019-09-08 09:52:40,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26927 states and 40941 transitions. [2019-09-08 09:52:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 09:52:41,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:41,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:41,044 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 683032688, now seen corresponding path program 1 times [2019-09-08 09:52:41,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:41,214 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:52:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:41,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:41,216 INFO L87 Difference]: Start difference. First operand 26927 states and 40941 transitions. Second operand 3 states. [2019-09-08 09:52:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:43,212 INFO L93 Difference]: Finished difference Result 80668 states and 122636 transitions. [2019-09-08 09:52:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:43,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-08 09:52:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:43,312 INFO L225 Difference]: With dead ends: 80668 [2019-09-08 09:52:43,312 INFO L226 Difference]: Without dead ends: 53801 [2019-09-08 09:52:43,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:52:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53801 states. [2019-09-08 09:52:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53801 to 26945. [2019-09-08 09:52:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26945 states. [2019-09-08 09:52:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26945 states to 26945 states and 40962 transitions. [2019-09-08 09:52:44,485 INFO L78 Accepts]: Start accepts. Automaton has 26945 states and 40962 transitions. Word has length 311 [2019-09-08 09:52:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:44,485 INFO L475 AbstractCegarLoop]: Abstraction has 26945 states and 40962 transitions. [2019-09-08 09:52:44,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26945 states and 40962 transitions. [2019-09-08 09:52:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:52:44,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:44,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:44,530 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 51576747, now seen corresponding path program 1 times [2019-09-08 09:52:44,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:44,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:44,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:44,895 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:52:44,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:44,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:44,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:44,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:44,896 INFO L87 Difference]: Start difference. First operand 26945 states and 40962 transitions. Second operand 3 states. [2019-09-08 09:52:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:46,307 INFO L93 Difference]: Finished difference Result 76506 states and 116127 transitions. [2019-09-08 09:52:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:46,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 09:52:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:46,370 INFO L225 Difference]: With dead ends: 76506 [2019-09-08 09:52:46,370 INFO L226 Difference]: Without dead ends: 49806 [2019-09-08 09:52:46,412 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:52:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49806 states. [2019-09-08 09:52:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49806 to 49804. [2019-09-08 09:52:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49804 states. [2019-09-08 09:52:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49804 states to 49804 states and 75170 transitions. [2019-09-08 09:52:49,038 INFO L78 Accepts]: Start accepts. Automaton has 49804 states and 75170 transitions. Word has length 312 [2019-09-08 09:52:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:49,039 INFO L475 AbstractCegarLoop]: Abstraction has 49804 states and 75170 transitions. [2019-09-08 09:52:49,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 49804 states and 75170 transitions. [2019-09-08 09:52:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:52:49,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:49,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,076 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1088157560, now seen corresponding path program 1 times [2019-09-08 09:52:49,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:49,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:49,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:49,438 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:52:49,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:49,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:49,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:49,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:49,441 INFO L87 Difference]: Start difference. First operand 49804 states and 75170 transitions. Second operand 4 states. [2019-09-08 09:52:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:52,130 INFO L93 Difference]: Finished difference Result 145316 states and 219080 transitions. [2019-09-08 09:52:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:52,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 09:52:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:52,251 INFO L225 Difference]: With dead ends: 145316 [2019-09-08 09:52:52,252 INFO L226 Difference]: Without dead ends: 96052 [2019-09-08 09:52:52,307 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:52:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96052 states. [2019-09-08 09:52:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96052 to 50039. [2019-09-08 09:52:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50039 states. [2019-09-08 09:52:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50039 states to 50039 states and 75558 transitions. [2019-09-08 09:52:55,825 INFO L78 Accepts]: Start accepts. Automaton has 50039 states and 75558 transitions. Word has length 312 [2019-09-08 09:52:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:55,825 INFO L475 AbstractCegarLoop]: Abstraction has 50039 states and 75558 transitions. [2019-09-08 09:52:55,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 50039 states and 75558 transitions. [2019-09-08 09:52:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:52:55,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:55,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:55,869 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1553161009, now seen corresponding path program 1 times [2019-09-08 09:52:55,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:55,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:55,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:55,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:56,007 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:52:56,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:56,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:56,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:56,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:56,009 INFO L87 Difference]: Start difference. First operand 50039 states and 75558 transitions. Second operand 3 states. [2019-09-08 09:52:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:58,996 INFO L93 Difference]: Finished difference Result 148547 states and 223955 transitions. [2019-09-08 09:52:58,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:58,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:52:58,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:59,116 INFO L225 Difference]: With dead ends: 148547 [2019-09-08 09:52:59,116 INFO L226 Difference]: Without dead ends: 99311 [2019-09-08 09:52:59,452 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:52:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99311 states. [2019-09-08 09:53:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99311 to 50143. [2019-09-08 09:53:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50143 states. [2019-09-08 09:53:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50143 states to 50143 states and 75701 transitions. [2019-09-08 09:53:01,304 INFO L78 Accepts]: Start accepts. Automaton has 50143 states and 75701 transitions. Word has length 314 [2019-09-08 09:53:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:01,305 INFO L475 AbstractCegarLoop]: Abstraction has 50143 states and 75701 transitions. [2019-09-08 09:53:01,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:53:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 50143 states and 75701 transitions. [2019-09-08 09:53:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 09:53:01,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:01,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:01,338 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 300170270, now seen corresponding path program 1 times [2019-09-08 09:53:01,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:01,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:01,836 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:53:01,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:01,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:53:01,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:53:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:53:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:01,839 INFO L87 Difference]: Start difference. First operand 50143 states and 75701 transitions. Second operand 3 states. [2019-09-08 09:53:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:06,304 INFO L93 Difference]: Finished difference Result 148679 states and 224121 transitions. [2019-09-08 09:53:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:53:06,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-08 09:53:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:06,409 INFO L225 Difference]: With dead ends: 148679 [2019-09-08 09:53:06,409 INFO L226 Difference]: Without dead ends: 99436 [2019-09-08 09:53:06,454 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:53:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99436 states. [2019-09-08 09:53:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99436 to 50268. [2019-09-08 09:53:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50268 states. [2019-09-08 09:53:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50268 states to 50268 states and 75847 transitions. [2019-09-08 09:53:08,889 INFO L78 Accepts]: Start accepts. Automaton has 50268 states and 75847 transitions. Word has length 315 [2019-09-08 09:53:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:08,889 INFO L475 AbstractCegarLoop]: Abstraction has 50268 states and 75847 transitions. [2019-09-08 09:53:08,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:53:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 50268 states and 75847 transitions. [2019-09-08 09:53:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:53:08,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:08,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:08,923 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2110241026, now seen corresponding path program 1 times [2019-09-08 09:53:08,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:08,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:08,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:08,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:08,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:09,212 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:53:09,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:09,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:53:09,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:53:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:53:09,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:53:09,214 INFO L87 Difference]: Start difference. First operand 50268 states and 75847 transitions. Second operand 4 states. [2019-09-08 09:53:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:11,272 INFO L93 Difference]: Finished difference Result 96366 states and 145230 transitions. [2019-09-08 09:53:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:53:11,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-08 09:53:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:11,323 INFO L225 Difference]: With dead ends: 96366 [2019-09-08 09:53:11,323 INFO L226 Difference]: Without dead ends: 46961 [2019-09-08 09:53:11,361 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:53:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46961 states. [2019-09-08 09:53:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46961 to 46941. [2019-09-08 09:53:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46941 states. [2019-09-08 09:53:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46941 states to 46941 states and 70800 transitions. [2019-09-08 09:53:15,008 INFO L78 Accepts]: Start accepts. Automaton has 46941 states and 70800 transitions. Word has length 316 [2019-09-08 09:53:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:15,008 INFO L475 AbstractCegarLoop]: Abstraction has 46941 states and 70800 transitions. [2019-09-08 09:53:15,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:53:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 46941 states and 70800 transitions. [2019-09-08 09:53:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:53:15,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:15,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:15,039 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:15,040 INFO L82 PathProgramCache]: Analyzing trace with hash 497333146, now seen corresponding path program 1 times [2019-09-08 09:53:15,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:15,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:15,256 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:53:15,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:15,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:53:15,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:53:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:53:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:15,259 INFO L87 Difference]: Start difference. First operand 46941 states and 70800 transitions. Second operand 3 states. [2019-09-08 09:53:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:19,291 INFO L93 Difference]: Finished difference Result 134948 states and 203169 transitions. [2019-09-08 09:53:19,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:53:19,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 09:53:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:19,384 INFO L225 Difference]: With dead ends: 134948 [2019-09-08 09:53:19,384 INFO L226 Difference]: Without dead ends: 89708 [2019-09-08 09:53:19,433 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:53:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89708 states. [2019-09-08 09:53:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89708 to 89706. [2019-09-08 09:53:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89706 states. [2019-09-08 09:53:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89706 states to 89706 states and 134206 transitions. [2019-09-08 09:53:25,567 INFO L78 Accepts]: Start accepts. Automaton has 89706 states and 134206 transitions. Word has length 320 [2019-09-08 09:53:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:25,568 INFO L475 AbstractCegarLoop]: Abstraction has 89706 states and 134206 transitions. [2019-09-08 09:53:25,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:53:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 89706 states and 134206 transitions. [2019-09-08 09:53:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:53:25,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:25,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:25,625 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash -709286529, now seen corresponding path program 1 times [2019-09-08 09:53:25,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:25,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:25,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:25,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:25,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:26,010 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:53:26,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:26,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:53:26,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:53:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:53:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:53:26,012 INFO L87 Difference]: Start difference. First operand 89706 states and 134206 transitions. Second operand 5 states. [2019-09-08 09:53:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:30,178 INFO L93 Difference]: Finished difference Result 149992 states and 227065 transitions. [2019-09-08 09:53:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:53:30,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2019-09-08 09:53:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:30,252 INFO L225 Difference]: With dead ends: 149992 [2019-09-08 09:53:30,252 INFO L226 Difference]: Without dead ends: 75663 [2019-09-08 09:53:30,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:53:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75663 states. [2019-09-08 09:53:33,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75663 to 75661. [2019-09-08 09:53:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75661 states. [2019-09-08 09:53:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75661 states to 75661 states and 114382 transitions. [2019-09-08 09:53:33,805 INFO L78 Accepts]: Start accepts. Automaton has 75661 states and 114382 transitions. Word has length 320 [2019-09-08 09:53:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:33,805 INFO L475 AbstractCegarLoop]: Abstraction has 75661 states and 114382 transitions. [2019-09-08 09:53:33,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:53:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 75661 states and 114382 transitions. [2019-09-08 09:53:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:53:33,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:33,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:33,850 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 184767120, now seen corresponding path program 1 times [2019-09-08 09:53:33,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:33,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:34,788 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:53:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:34,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:53:34,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:53:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:53:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:53:34,790 INFO L87 Difference]: Start difference. First operand 75661 states and 114382 transitions. Second operand 4 states. [2019-09-08 09:53:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:41,774 INFO L93 Difference]: Finished difference Result 223977 states and 338658 transitions. [2019-09-08 09:53:41,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:53:41,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 09:53:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:41,936 INFO L225 Difference]: With dead ends: 223977 [2019-09-08 09:53:41,936 INFO L226 Difference]: Without dead ends: 148340 [2019-09-08 09:53:41,995 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:53:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148340 states. [2019-09-08 09:53:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148340 to 148338. [2019-09-08 09:53:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148338 states. [2019-09-08 09:53:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148338 states to 148338 states and 223139 transitions. [2019-09-08 09:53:51,557 INFO L78 Accepts]: Start accepts. Automaton has 148338 states and 223139 transitions. Word has length 320 [2019-09-08 09:53:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:51,557 INFO L475 AbstractCegarLoop]: Abstraction has 148338 states and 223139 transitions. [2019-09-08 09:53:51,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:53:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 148338 states and 223139 transitions. [2019-09-08 09:53:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 09:53:51,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:51,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:51,650 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1622551629, now seen corresponding path program 1 times [2019-09-08 09:53:51,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:51,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:51,850 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:53:51,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:51,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:53:51,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:53:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:53:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:51,852 INFO L87 Difference]: Start difference. First operand 148338 states and 223139 transitions. Second operand 3 states. [2019-09-08 09:54:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:09,181 INFO L93 Difference]: Finished difference Result 437286 states and 656769 transitions. [2019-09-08 09:54:09,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:09,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 09:54:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:09,534 INFO L225 Difference]: With dead ends: 437286 [2019-09-08 09:54:09,535 INFO L226 Difference]: Without dead ends: 290197 [2019-09-08 09:54:09,998 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:54:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290197 states. [2019-09-08 09:54:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290197 to 290195. [2019-09-08 09:54:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290195 states. [2019-09-08 09:54:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290195 states to 290195 states and 433246 transitions. [2019-09-08 09:54:29,768 INFO L78 Accepts]: Start accepts. Automaton has 290195 states and 433246 transitions. Word has length 322 [2019-09-08 09:54:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:29,769 INFO L475 AbstractCegarLoop]: Abstraction has 290195 states and 433246 transitions. [2019-09-08 09:54:29,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 290195 states and 433246 transitions. [2019-09-08 09:54:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 09:54:29,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:29,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:29,966 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:29,966 INFO L82 PathProgramCache]: Analyzing trace with hash -383714354, now seen corresponding path program 1 times [2019-09-08 09:54:29,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:29,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:29,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:29,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:30,661 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:54:30,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:30,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:30,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:30,663 INFO L87 Difference]: Start difference. First operand 290195 states and 433246 transitions. Second operand 3 states. [2019-09-08 09:55:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:06,986 INFO L93 Difference]: Finished difference Result 824740 states and 1229146 transitions. [2019-09-08 09:55:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:06,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 09:55:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:07,643 INFO L225 Difference]: With dead ends: 824740 [2019-09-08 09:55:07,643 INFO L226 Difference]: Without dead ends: 535892 [2019-09-08 09:55:07,869 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:55:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535892 states. [2019-09-08 09:55:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535892 to 535890. [2019-09-08 09:55:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535890 states. [2019-09-08 09:55:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535890 states to 535890 states and 793127 transitions. [2019-09-08 09:55:44,787 INFO L78 Accepts]: Start accepts. Automaton has 535890 states and 793127 transitions. Word has length 324 [2019-09-08 09:55:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:44,787 INFO L475 AbstractCegarLoop]: Abstraction has 535890 states and 793127 transitions. [2019-09-08 09:55:44,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 535890 states and 793127 transitions. [2019-09-08 09:55:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 09:55:52,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:52,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,754 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash 855004267, now seen corresponding path program 1 times [2019-09-08 09:55:52,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:52,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:52,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:53,127 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:55:53,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:53,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:53,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:53,129 INFO L87 Difference]: Start difference. First operand 535890 states and 793127 transitions. Second operand 4 states. [2019-09-08 09:56:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:54,211 INFO L93 Difference]: Finished difference Result 1464115 states and 2164143 transitions. [2019-09-08 09:56:54,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:54,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 09:56:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:55,416 INFO L225 Difference]: With dead ends: 1464115 [2019-09-08 09:56:55,416 INFO L226 Difference]: Without dead ends: 931517 [2019-09-08 09:56:55,784 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:56:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931517 states. [2019-09-08 09:57:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931517 to 521977. [2019-09-08 09:57:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521977 states. [2019-09-08 09:57:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521977 states to 521977 states and 772252 transitions. [2019-09-08 09:57:53,356 INFO L78 Accepts]: Start accepts. Automaton has 521977 states and 772252 transitions. Word has length 324 [2019-09-08 09:57:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:53,356 INFO L475 AbstractCegarLoop]: Abstraction has 521977 states and 772252 transitions. [2019-09-08 09:57:53,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 521977 states and 772252 transitions. [2019-09-08 09:57:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 09:57:53,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:53,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:53,670 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash 110421403, now seen corresponding path program 1 times [2019-09-08 09:57:53,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:53,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:53,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:53,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:53,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:53,807 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:57:53,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:53,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:53,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:53,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:53,809 INFO L87 Difference]: Start difference. First operand 521977 states and 772252 transitions. Second operand 3 states. [2019-09-08 09:59:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:07,011 INFO L93 Difference]: Finished difference Result 1439076 states and 2126912 transitions. [2019-09-08 09:59:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:07,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 09:59:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:08,203 INFO L225 Difference]: With dead ends: 1439076 [2019-09-08 09:59:08,203 INFO L226 Difference]: Without dead ends: 941366 [2019-09-08 09:59:08,561 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:59:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941366 states. [2019-09-08 09:59:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941366 to 522458. [2019-09-08 09:59:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522458 states. [2019-09-08 09:59:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522458 states to 522458 states and 772850 transitions. [2019-09-08 09:59:58,793 INFO L78 Accepts]: Start accepts. Automaton has 522458 states and 772850 transitions. Word has length 327 [2019-09-08 09:59:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:58,794 INFO L475 AbstractCegarLoop]: Abstraction has 522458 states and 772850 transitions. [2019-09-08 09:59:58,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 522458 states and 772850 transitions. [2019-09-08 09:59:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 09:59:59,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:59,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:59,134 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:59,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash 552929954, now seen corresponding path program 1 times [2019-09-08 09:59:59,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:59,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:59,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:59,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:59,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:59,414 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:59:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:59:59,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:59:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:59:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:59:59,416 INFO L87 Difference]: Start difference. First operand 522458 states and 772850 transitions. Second operand 4 states. [2019-09-08 10:00:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:00:40,810 INFO L93 Difference]: Finished difference Result 1010017 states and 1493053 transitions. [2019-09-08 10:00:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:00:40,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 10:00:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:41,442 INFO L225 Difference]: With dead ends: 1010017 [2019-09-08 10:00:41,442 INFO L226 Difference]: Without dead ends: 492871 [2019-09-08 10:00:42,223 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 10:00:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492871 states. [2019-09-08 10:01:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492871 to 492544. [2019-09-08 10:01:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492544 states. [2019-09-08 10:01:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492544 states to 492544 states and 728142 transitions. [2019-09-08 10:01:24,219 INFO L78 Accepts]: Start accepts. Automaton has 492544 states and 728142 transitions. Word has length 328 [2019-09-08 10:01:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:01:24,220 INFO L475 AbstractCegarLoop]: Abstraction has 492544 states and 728142 transitions. [2019-09-08 10:01:24,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:01:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 492544 states and 728142 transitions. [2019-09-08 10:01:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 10:01:25,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:01:25,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:01:25,938 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:01:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:01:25,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1110038166, now seen corresponding path program 1 times [2019-09-08 10:01:25,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:01:25,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:01:25,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:01:25,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:01:25,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:01:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:01:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:01:26,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:01:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:01:26,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:01:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:01:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:01:26,347 INFO L87 Difference]: Start difference. First operand 492544 states and 728142 transitions. Second operand 6 states. [2019-09-08 10:02:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:31,258 INFO L93 Difference]: Finished difference Result 978226 states and 1524363 transitions. [2019-09-08 10:02:31,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:02:31,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 332 [2019-09-08 10:02:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:32,399 INFO L225 Difference]: With dead ends: 978226 [2019-09-08 10:02:32,399 INFO L226 Difference]: Without dead ends: 809232 [2019-09-08 10:02:32,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:02:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809232 states.