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_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:38:59,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:38:59,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:38:59,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:38:59,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:38:59,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:38:59,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:38:59,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:38:59,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:38:59,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:38:59,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:38:59,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:38:59,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:38:59,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:38:59,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:38:59,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:38:59,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:38:59,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:38:59,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:38:59,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:38:59,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:38:59,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:38:59,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:38:59,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:38:59,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:38:59,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:38:59,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:38:59,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:38:59,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:38:59,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:38:59,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:38:59,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:38:59,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:38:59,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:38:59,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:38:59,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:38:59,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:38:59,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:38:59,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:38:59,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:38:59,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:38:59,690 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 13:38:59,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:38:59,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:38:59,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:38:59,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:38:59,710 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:38:59,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:38:59,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:38:59,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:38:59,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:38:59,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:38:59,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:38:59,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:38:59,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:38:59,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:38:59,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:38:59,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:38:59,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:38:59,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:38:59,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:38:59,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:38:59,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:38:59,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:38:59,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:38:59,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:38:59,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:38:59,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:38:59,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:38:59,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:38:59,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:38:59,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:38:59,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:38:59,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:38:59,798 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:38:59,798 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:38:59,799 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:38:59,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92044f25/7b0ce19bcbdb4629b2ac3afb3b7a6bc8/FLAGfd9f0d604 [2019-09-08 13:39:00,592 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:39:00,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:39:00,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92044f25/7b0ce19bcbdb4629b2ac3afb3b7a6bc8/FLAGfd9f0d604 [2019-09-08 13:39:00,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92044f25/7b0ce19bcbdb4629b2ac3afb3b7a6bc8 [2019-09-08 13:39:00,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:39:00,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:39:00,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:39:00,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:39:00,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:39:00,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:39:00" (1/1) ... [2019-09-08 13:39:00,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5f5aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:00, skipping insertion in model container [2019-09-08 13:39:00,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:39:00" (1/1) ... [2019-09-08 13:39:00,759 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:39:00,926 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:39:02,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:39:02,307 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:39:03,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:39:03,190 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:39:03,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03 WrapperNode [2019-09-08 13:39:03,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:39:03,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:39:03,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:39:03,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:39:03,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (1/1) ... [2019-09-08 13:39:03,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (1/1) ... [2019-09-08 13:39:03,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (1/1) ... [2019-09-08 13:39:03,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (1/1) ... [2019-09-08 13:39:03,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (1/1) ... [2019-09-08 13:39:03,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (1/1) ... [2019-09-08 13:39:03,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (1/1) ... [2019-09-08 13:39:03,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:39:03,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:39:03,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:39:03,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:39:03,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (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 13:39:03,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:39:03,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:39:03,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:39:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:39:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:39:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:39:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:39:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:39:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:39:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:39:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:39:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:39:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:39:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:39:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:39:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:39:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:39:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:39:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:39:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:39:07,795 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:39:07,796 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:39:07,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:39:07 BoogieIcfgContainer [2019-09-08 13:39:07,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:39:07,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:39:07,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:39:07,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:39:07,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:39:00" (1/3) ... [2019-09-08 13:39:07,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc7b506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:39:07, skipping insertion in model container [2019-09-08 13:39:07,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:03" (2/3) ... [2019-09-08 13:39:07,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc7b506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:39:07, skipping insertion in model container [2019-09-08 13:39:07,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:39:07" (3/3) ... [2019-09-08 13:39:07,807 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:39:07,821 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:39:07,835 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:39:07,859 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:39:07,925 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:39:07,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:39:07,926 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:39:07,926 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:39:07,926 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:39:07,927 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:39:07,927 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:39:07,927 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:39:07,927 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:39:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states. [2019-09-08 13:39:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:39:08,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:08,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:08,034 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 691893381, now seen corresponding path program 1 times [2019-09-08 13:39:08,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:08,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:08,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:09,072 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 13:39:09,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:09,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:09,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:09,101 INFO L87 Difference]: Start difference. First operand 1549 states. Second operand 3 states. [2019-09-08 13:39:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:09,389 INFO L93 Difference]: Finished difference Result 2999 states and 5237 transitions. [2019-09-08 13:39:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:09,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-08 13:39:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:09,423 INFO L225 Difference]: With dead ends: 2999 [2019-09-08 13:39:09,424 INFO L226 Difference]: Without dead ends: 2098 [2019-09-08 13:39:09,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 13:39:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2019-09-08 13:39:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2096. [2019-09-08 13:39:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-09-08 13:39:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3502 transitions. [2019-09-08 13:39:09,590 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3502 transitions. Word has length 396 [2019-09-08 13:39:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:09,594 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3502 transitions. [2019-09-08 13:39:09,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3502 transitions. [2019-09-08 13:39:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:39:09,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:09,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:09,608 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1022638736, now seen corresponding path program 1 times [2019-09-08 13:39:09,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:09,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:09,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:09,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:09,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:10,199 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 13:39:10,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:10,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:10,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:10,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:10,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:10,202 INFO L87 Difference]: Start difference. First operand 2096 states and 3502 transitions. Second operand 3 states. [2019-09-08 13:39:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:10,382 INFO L93 Difference]: Finished difference Result 4434 states and 7326 transitions. [2019-09-08 13:39:10,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:10,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-08 13:39:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:10,402 INFO L225 Difference]: With dead ends: 4434 [2019-09-08 13:39:10,402 INFO L226 Difference]: Without dead ends: 3022 [2019-09-08 13:39:10,407 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 13:39:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-08 13:39:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3020. [2019-09-08 13:39:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-09-08 13:39:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 5003 transitions. [2019-09-08 13:39:10,550 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 5003 transitions. Word has length 396 [2019-09-08 13:39:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:10,552 INFO L475 AbstractCegarLoop]: Abstraction has 3020 states and 5003 transitions. [2019-09-08 13:39:10,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 5003 transitions. [2019-09-08 13:39:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:39:10,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:10,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:10,567 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1527350314, now seen corresponding path program 1 times [2019-09-08 13:39:10,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:11,021 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 13:39:11,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:11,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:11,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:11,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:11,024 INFO L87 Difference]: Start difference. First operand 3020 states and 5003 transitions. Second operand 3 states. [2019-09-08 13:39:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:11,294 INFO L93 Difference]: Finished difference Result 6964 states and 11430 transitions. [2019-09-08 13:39:11,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:11,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-08 13:39:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:11,322 INFO L225 Difference]: With dead ends: 6964 [2019-09-08 13:39:11,324 INFO L226 Difference]: Without dead ends: 4656 [2019-09-08 13:39:11,341 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 13:39:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2019-09-08 13:39:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4654. [2019-09-08 13:39:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4654 states. [2019-09-08 13:39:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 7648 transitions. [2019-09-08 13:39:11,564 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 7648 transitions. Word has length 396 [2019-09-08 13:39:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:11,565 INFO L475 AbstractCegarLoop]: Abstraction has 4654 states and 7648 transitions. [2019-09-08 13:39:11,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 7648 transitions. [2019-09-08 13:39:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:39:11,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:11,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:11,588 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash -519075533, now seen corresponding path program 1 times [2019-09-08 13:39:11,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:11,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:11,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:12,187 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 13:39:12,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:12,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:39:12,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:39:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:39:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:39:12,191 INFO L87 Difference]: Start difference. First operand 4654 states and 7648 transitions. Second operand 4 states. [2019-09-08 13:39:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:12,667 INFO L93 Difference]: Finished difference Result 7848 states and 13003 transitions. [2019-09-08 13:39:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:39:12,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2019-09-08 13:39:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:12,707 INFO L225 Difference]: With dead ends: 7848 [2019-09-08 13:39:12,707 INFO L226 Difference]: Without dead ends: 6558 [2019-09-08 13:39:12,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:39:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2019-09-08 13:39:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 5230. [2019-09-08 13:39:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2019-09-08 13:39:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 8624 transitions. [2019-09-08 13:39:12,985 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 8624 transitions. Word has length 396 [2019-09-08 13:39:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:12,986 INFO L475 AbstractCegarLoop]: Abstraction has 5230 states and 8624 transitions. [2019-09-08 13:39:12,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:39:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 8624 transitions. [2019-09-08 13:39:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:39:13,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:13,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:13,001 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1482848476, now seen corresponding path program 1 times [2019-09-08 13:39:13,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:13,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:39:13,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:13,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:13,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:13,498 INFO L87 Difference]: Start difference. First operand 5230 states and 8624 transitions. Second operand 3 states. [2019-09-08 13:39:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:13,989 INFO L93 Difference]: Finished difference Result 9478 states and 15754 transitions. [2019-09-08 13:39:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:13,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-08 13:39:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:14,029 INFO L225 Difference]: With dead ends: 9478 [2019-09-08 13:39:14,030 INFO L226 Difference]: Without dead ends: 7612 [2019-09-08 13:39:14,037 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 13:39:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7612 states. [2019-09-08 13:39:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7612 to 7610. [2019-09-08 13:39:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7610 states. [2019-09-08 13:39:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7610 states to 7610 states and 12572 transitions. [2019-09-08 13:39:14,511 INFO L78 Accepts]: Start accepts. Automaton has 7610 states and 12572 transitions. Word has length 396 [2019-09-08 13:39:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:14,512 INFO L475 AbstractCegarLoop]: Abstraction has 7610 states and 12572 transitions. [2019-09-08 13:39:14,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7610 states and 12572 transitions. [2019-09-08 13:39:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-08 13:39:14,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:14,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:14,543 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash 594300889, now seen corresponding path program 1 times [2019-09-08 13:39:14,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:14,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:14,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:15,365 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 13:39:15,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:15,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:39:15,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:39:15,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:39:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:39:15,368 INFO L87 Difference]: Start difference. First operand 7610 states and 12572 transitions. Second operand 5 states. [2019-09-08 13:39:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:16,875 INFO L93 Difference]: Finished difference Result 23130 states and 38568 transitions. [2019-09-08 13:39:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:39:16,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 397 [2019-09-08 13:39:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:16,975 INFO L225 Difference]: With dead ends: 23130 [2019-09-08 13:39:16,976 INFO L226 Difference]: Without dead ends: 19556 [2019-09-08 13:39:17,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 13:39:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19556 states. [2019-09-08 13:39:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19556 to 14938. [2019-09-08 13:39:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14938 states. [2019-09-08 13:39:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14938 states to 14938 states and 24804 transitions. [2019-09-08 13:39:18,158 INFO L78 Accepts]: Start accepts. Automaton has 14938 states and 24804 transitions. Word has length 397 [2019-09-08 13:39:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:18,160 INFO L475 AbstractCegarLoop]: Abstraction has 14938 states and 24804 transitions. [2019-09-08 13:39:18,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:39:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 14938 states and 24804 transitions. [2019-09-08 13:39:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 13:39:18,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:18,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:18,185 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1584378272, now seen corresponding path program 1 times [2019-09-08 13:39:18,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:18,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:18,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:19,524 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 13:39:19,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:19,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:19,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:19,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:19,527 INFO L87 Difference]: Start difference. First operand 14938 states and 24804 transitions. Second operand 3 states. [2019-09-08 13:39:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:20,246 INFO L93 Difference]: Finished difference Result 26630 states and 44334 transitions. [2019-09-08 13:39:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:20,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-08 13:39:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:20,286 INFO L225 Difference]: With dead ends: 26630 [2019-09-08 13:39:20,286 INFO L226 Difference]: Without dead ends: 13184 [2019-09-08 13:39:20,317 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 13:39:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13184 states. [2019-09-08 13:39:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13184 to 9962. [2019-09-08 13:39:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9962 states. [2019-09-08 13:39:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9962 states to 9962 states and 16584 transitions. [2019-09-08 13:39:20,928 INFO L78 Accepts]: Start accepts. Automaton has 9962 states and 16584 transitions. Word has length 398 [2019-09-08 13:39:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:20,929 INFO L475 AbstractCegarLoop]: Abstraction has 9962 states and 16584 transitions. [2019-09-08 13:39:20,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9962 states and 16584 transitions. [2019-09-08 13:39:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 13:39:20,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:20,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:20,946 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:20,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:20,947 INFO L82 PathProgramCache]: Analyzing trace with hash -836761542, now seen corresponding path program 1 times [2019-09-08 13:39:20,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:20,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:20,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:20,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:20,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:21,923 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 13:39:21,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:21,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:39:21,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:39:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:39:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:39:21,926 INFO L87 Difference]: Start difference. First operand 9962 states and 16584 transitions. Second operand 7 states. [2019-09-08 13:39:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:23,040 INFO L93 Difference]: Finished difference Result 24860 states and 41571 transitions. [2019-09-08 13:39:23,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:39:23,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 402 [2019-09-08 13:39:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:23,081 INFO L225 Difference]: With dead ends: 24860 [2019-09-08 13:39:23,082 INFO L226 Difference]: Without dead ends: 17554 [2019-09-08 13:39:23,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:39:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17554 states. [2019-09-08 13:39:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17554 to 11250. [2019-09-08 13:39:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11250 states. [2019-09-08 13:39:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11250 states to 11250 states and 18756 transitions. [2019-09-08 13:39:23,699 INFO L78 Accepts]: Start accepts. Automaton has 11250 states and 18756 transitions. Word has length 402 [2019-09-08 13:39:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:23,700 INFO L475 AbstractCegarLoop]: Abstraction has 11250 states and 18756 transitions. [2019-09-08 13:39:23,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:39:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 11250 states and 18756 transitions. [2019-09-08 13:39:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:39:23,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:23,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:23,715 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:23,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash -989970102, now seen corresponding path program 1 times [2019-09-08 13:39:23,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:23,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:23,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:25,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 13:39:25,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:25,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:39:25,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:39:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:39:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:39:25,093 INFO L87 Difference]: Start difference. First operand 11250 states and 18756 transitions. Second operand 4 states. [2019-09-08 13:39:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:26,368 INFO L93 Difference]: Finished difference Result 37772 states and 62926 transitions. [2019-09-08 13:39:26,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:39:26,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-09-08 13:39:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:26,448 INFO L225 Difference]: With dead ends: 37772 [2019-09-08 13:39:26,449 INFO L226 Difference]: Without dead ends: 28642 [2019-09-08 13:39:26,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:39:26,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28642 states. [2019-09-08 13:39:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28642 to 21620. [2019-09-08 13:39:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-09-08 13:39:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 35914 transitions. [2019-09-08 13:39:27,939 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 35914 transitions. Word has length 403 [2019-09-08 13:39:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:27,940 INFO L475 AbstractCegarLoop]: Abstraction has 21620 states and 35914 transitions. [2019-09-08 13:39:27,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:39:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 35914 transitions. [2019-09-08 13:39:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:39:27,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:27,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:27,958 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash 891518200, now seen corresponding path program 1 times [2019-09-08 13:39:27,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:27,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:27,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:28,457 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 13:39:28,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:28,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:28,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:28,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:28,459 INFO L87 Difference]: Start difference. First operand 21620 states and 35914 transitions. Second operand 3 states. [2019-09-08 13:39:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:28,861 INFO L93 Difference]: Finished difference Result 31424 states and 52246 transitions. [2019-09-08 13:39:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:28,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-09-08 13:39:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:28,880 INFO L225 Difference]: With dead ends: 31424 [2019-09-08 13:39:28,880 INFO L226 Difference]: Without dead ends: 11266 [2019-09-08 13:39:28,922 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 13:39:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states. [2019-09-08 13:39:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 11264. [2019-09-08 13:39:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11264 states. [2019-09-08 13:39:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11264 states to 11264 states and 18695 transitions. [2019-09-08 13:39:30,319 INFO L78 Accepts]: Start accepts. Automaton has 11264 states and 18695 transitions. Word has length 403 [2019-09-08 13:39:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:30,322 INFO L475 AbstractCegarLoop]: Abstraction has 11264 states and 18695 transitions. [2019-09-08 13:39:30,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 11264 states and 18695 transitions. [2019-09-08 13:39:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:39:30,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:30,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:30,333 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:30,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1820126482, now seen corresponding path program 1 times [2019-09-08 13:39:30,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:30,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:30,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:30,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:30,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 13:39:30,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:30,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:30,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:30,852 INFO L87 Difference]: Start difference. First operand 11264 states and 18695 transitions. Second operand 3 states. [2019-09-08 13:39:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:31,490 INFO L93 Difference]: Finished difference Result 28564 states and 47507 transitions. [2019-09-08 13:39:31,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:31,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-09-08 13:39:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:31,515 INFO L225 Difference]: With dead ends: 28564 [2019-09-08 13:39:31,516 INFO L226 Difference]: Without dead ends: 18422 [2019-09-08 13:39:31,532 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 13:39:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18422 states. [2019-09-08 13:39:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18422 to 17696. [2019-09-08 13:39:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17696 states. [2019-09-08 13:39:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17696 states to 17696 states and 29321 transitions. [2019-09-08 13:39:32,431 INFO L78 Accepts]: Start accepts. Automaton has 17696 states and 29321 transitions. Word has length 403 [2019-09-08 13:39:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:32,431 INFO L475 AbstractCegarLoop]: Abstraction has 17696 states and 29321 transitions. [2019-09-08 13:39:32,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 17696 states and 29321 transitions. [2019-09-08 13:39:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:39:32,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:32,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:32,444 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2144362799, now seen corresponding path program 1 times [2019-09-08 13:39:32,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:32,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:32,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:33,145 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 13:39:33,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:33,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:39:33,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:39:33,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:39:33,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:39:33,148 INFO L87 Difference]: Start difference. First operand 17696 states and 29321 transitions. Second operand 6 states. [2019-09-08 13:39:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:35,146 INFO L93 Difference]: Finished difference Result 56442 states and 93762 transitions. [2019-09-08 13:39:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:39:35,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-08 13:39:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:35,201 INFO L225 Difference]: With dead ends: 56442 [2019-09-08 13:39:35,201 INFO L226 Difference]: Without dead ends: 41412 [2019-09-08 13:39:35,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:39:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41412 states. [2019-09-08 13:39:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41412 to 39798. [2019-09-08 13:39:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39798 states. [2019-09-08 13:39:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39798 states to 39798 states and 65994 transitions. [2019-09-08 13:39:36,983 INFO L78 Accepts]: Start accepts. Automaton has 39798 states and 65994 transitions. Word has length 403 [2019-09-08 13:39:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:36,984 INFO L475 AbstractCegarLoop]: Abstraction has 39798 states and 65994 transitions. [2019-09-08 13:39:36,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:39:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 39798 states and 65994 transitions. [2019-09-08 13:39:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:39:36,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:36,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:36,992 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1681072861, now seen corresponding path program 1 times [2019-09-08 13:39:36,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:36,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:36,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:36,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:36,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:37,662 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 13:39:37,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:37,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:39:37,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:39:37,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:39:37,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:39:37,665 INFO L87 Difference]: Start difference. First operand 39798 states and 65994 transitions. Second operand 6 states. [2019-09-08 13:39:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:41,613 INFO L93 Difference]: Finished difference Result 99944 states and 165752 transitions. [2019-09-08 13:39:41,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:39:41,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-08 13:39:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:41,735 INFO L225 Difference]: With dead ends: 99944 [2019-09-08 13:39:41,735 INFO L226 Difference]: Without dead ends: 67394 [2019-09-08 13:39:41,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:39:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67394 states. [2019-09-08 13:39:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67394 to 66124. [2019-09-08 13:39:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66124 states. [2019-09-08 13:39:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66124 states to 66124 states and 109696 transitions. [2019-09-08 13:39:44,535 INFO L78 Accepts]: Start accepts. Automaton has 66124 states and 109696 transitions. Word has length 403 [2019-09-08 13:39:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:44,536 INFO L475 AbstractCegarLoop]: Abstraction has 66124 states and 109696 transitions. [2019-09-08 13:39:44,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:39:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 66124 states and 109696 transitions. [2019-09-08 13:39:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:39:44,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:44,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:44,545 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1433351598, now seen corresponding path program 1 times [2019-09-08 13:39:44,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:44,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:44,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:45,416 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 13:39:45,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:45,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:39:45,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:39:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:39:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:39:45,418 INFO L87 Difference]: Start difference. First operand 66124 states and 109696 transitions. Second operand 5 states. [2019-09-08 13:39:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:53,417 INFO L93 Difference]: Finished difference Result 236937 states and 392930 transitions. [2019-09-08 13:39:53,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:39:53,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 403 [2019-09-08 13:39:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:53,708 INFO L225 Difference]: With dead ends: 236937 [2019-09-08 13:39:53,708 INFO L226 Difference]: Without dead ends: 173531 [2019-09-08 13:39:53,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 13:39:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173531 states. [2019-09-08 13:40:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173531 to 151553. [2019-09-08 13:40:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151553 states. [2019-09-08 13:40:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151553 states to 151553 states and 250682 transitions. [2019-09-08 13:40:03,228 INFO L78 Accepts]: Start accepts. Automaton has 151553 states and 250682 transitions. Word has length 403 [2019-09-08 13:40:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:03,228 INFO L475 AbstractCegarLoop]: Abstraction has 151553 states and 250682 transitions. [2019-09-08 13:40:03,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:40:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 151553 states and 250682 transitions. [2019-09-08 13:40:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:40:03,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:03,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:03,235 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1638217178, now seen corresponding path program 1 times [2019-09-08 13:40:03,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:03,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:03,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:04,618 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 13:40:04,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:04,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:40:04,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:40:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:40:04,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:40:04,620 INFO L87 Difference]: Start difference. First operand 151553 states and 250682 transitions. Second operand 6 states. [2019-09-08 13:40:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:15,910 INFO L93 Difference]: Finished difference Result 356308 states and 589396 transitions. [2019-09-08 13:40:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:40:15,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-08 13:40:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:16,228 INFO L225 Difference]: With dead ends: 356308 [2019-09-08 13:40:16,228 INFO L226 Difference]: Without dead ends: 212129 [2019-09-08 13:40:16,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:40:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212129 states. [2019-09-08 13:40:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212129 to 206815. [2019-09-08 13:40:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206815 states. [2019-09-08 13:40:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206815 states to 206815 states and 342108 transitions. [2019-09-08 13:40:30,644 INFO L78 Accepts]: Start accepts. Automaton has 206815 states and 342108 transitions. Word has length 403 [2019-09-08 13:40:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:30,645 INFO L475 AbstractCegarLoop]: Abstraction has 206815 states and 342108 transitions. [2019-09-08 13:40:30,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:40:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 206815 states and 342108 transitions. [2019-09-08 13:40:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:40:30,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:30,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:30,652 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2025391198, now seen corresponding path program 1 times [2019-09-08 13:40:30,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:30,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:30,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:30,979 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 13:40:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:30,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:30,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:30,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:30,983 INFO L87 Difference]: Start difference. First operand 206815 states and 342108 transitions. Second operand 3 states. [2019-09-08 13:40:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:52,249 INFO L93 Difference]: Finished difference Result 538304 states and 890381 transitions. [2019-09-08 13:40:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:52,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-09-08 13:40:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:53,450 INFO L225 Difference]: With dead ends: 538304 [2019-09-08 13:40:53,450 INFO L226 Difference]: Without dead ends: 406855 [2019-09-08 13:40:53,582 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 13:40:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406855 states. [2019-09-08 13:41:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406855 to 406853. [2019-09-08 13:41:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406853 states. [2019-09-08 13:41:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406853 states to 406853 states and 672000 transitions. [2019-09-08 13:41:26,414 INFO L78 Accepts]: Start accepts. Automaton has 406853 states and 672000 transitions. Word has length 403 [2019-09-08 13:41:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:26,415 INFO L475 AbstractCegarLoop]: Abstraction has 406853 states and 672000 transitions. [2019-09-08 13:41:26,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:41:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 406853 states and 672000 transitions. [2019-09-08 13:41:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 13:41:26,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:26,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:26,424 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:26,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1959806139, now seen corresponding path program 1 times [2019-09-08 13:41:26,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:26,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:26,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:26,723 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 13:41:26,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:26,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:41:26,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:41:26,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:41:26,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:41:26,725 INFO L87 Difference]: Start difference. First operand 406853 states and 672000 transitions. Second operand 3 states. [2019-09-08 13:42:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:20,570 INFO L93 Difference]: Finished difference Result 1209369 states and 1996784 transitions. [2019-09-08 13:42:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:42:20,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-08 13:42:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:22,206 INFO L225 Difference]: With dead ends: 1209369 [2019-09-08 13:42:22,206 INFO L226 Difference]: Without dead ends: 802625 [2019-09-08 13:42:22,591 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 13:42:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802625 states. [2019-09-08 13:43:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802625 to 802623. [2019-09-08 13:43:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802623 states. [2019-09-08 13:43:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802623 states to 802623 states and 1320313 transitions. [2019-09-08 13:43:27,629 INFO L78 Accepts]: Start accepts. Automaton has 802623 states and 1320313 transitions. Word has length 404 [2019-09-08 13:43:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:43:27,629 INFO L475 AbstractCegarLoop]: Abstraction has 802623 states and 1320313 transitions. [2019-09-08 13:43:27,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:43:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 802623 states and 1320313 transitions. [2019-09-08 13:43:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 13:43:27,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:43:27,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:43:27,645 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:43:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:43:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash 879620933, now seen corresponding path program 1 times [2019-09-08 13:43:27,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:43:27,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:43:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:27,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:43:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:43:27,902 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 13:43:27,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:43:27,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:43:27,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:43:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:43:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:43:27,904 INFO L87 Difference]: Start difference. First operand 802623 states and 1320313 transitions. Second operand 3 states. [2019-09-08 13:45:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:45:23,449 INFO L93 Difference]: Finished difference Result 2386701 states and 3924535 transitions. [2019-09-08 13:45:23,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:45:23,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-08 13:45:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:45:26,915 INFO L225 Difference]: With dead ends: 2386701 [2019-09-08 13:45:26,916 INFO L226 Difference]: Without dead ends: 1584159 [2019-09-08 13:45:27,689 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 13:45:30,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584159 states.