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.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:25:53,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:25:53,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:25:53,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:25:53,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:25:53,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:25:53,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:25:53,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:25:53,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:25:53,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:25:53,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:25:53,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:25:53,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:25:53,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:25:53,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:25:53,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:25:53,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:25:53,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:25:53,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:25:53,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:25:53,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:25:53,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:25:53,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:25:53,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:25:53,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:25:53,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:25:53,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:25:53,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:25:53,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:25:53,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:25:53,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:25:53,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:25:53,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:25:53,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:25:53,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:25:53,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:25:53,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:25:53,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:25:53,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:25:53,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:25:53,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:25:53,729 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:25:53,746 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:25:53,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:25:53,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:25:53,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:25:53,748 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:25:53,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:25:53,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:25:53,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:25:53,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:25:53,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:25:53,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:25:53,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:25:53,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:25:53,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:25:53,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:25:53,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:25:53,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:25:53,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:25:53,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:25:53,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:25:53,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:25:53,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:25:53,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:25:53,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:25:53,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:25:53,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:25:53,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:25:53,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:25:53,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:25:53,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:25:53,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:25:53,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:25:53,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:25:53,803 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:25:53,804 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.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:25:53,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff0fed4a/bc877327c01c43879b0bcbf58fea788b/FLAG44c80c934 [2019-09-08 13:25:54,500 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:25:54,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:25:54,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff0fed4a/bc877327c01c43879b0bcbf58fea788b/FLAG44c80c934 [2019-09-08 13:25:54,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff0fed4a/bc877327c01c43879b0bcbf58fea788b [2019-09-08 13:25:54,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:25:54,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:25:54,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:25:54,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:25:54,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:25:54,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:25:54" (1/1) ... [2019-09-08 13:25:54,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63888b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:54, skipping insertion in model container [2019-09-08 13:25:54,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:25:54" (1/1) ... [2019-09-08 13:25:54,798 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:25:54,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:25:55,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:25:55,429 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:25:55,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:25:55,634 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:25:55,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55 WrapperNode [2019-09-08 13:25:55,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:25:55,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:25:55,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:25:55,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:25:55,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (1/1) ... [2019-09-08 13:25:55,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (1/1) ... [2019-09-08 13:25:55,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (1/1) ... [2019-09-08 13:25:55,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (1/1) ... [2019-09-08 13:25:55,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (1/1) ... [2019-09-08 13:25:55,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (1/1) ... [2019-09-08 13:25:55,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (1/1) ... [2019-09-08 13:25:55,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:25:55,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:25:55,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:25:55,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:25:55,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (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:25:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:25:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:25:55,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:25:55,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:25:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:25:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:25:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:25:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:25:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:25:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:25:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:25:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:25:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:25:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:25:55,823 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:25:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:25:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:25:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:25:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:25:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:25:57,332 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:25:57,332 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:25:57,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:25:57 BoogieIcfgContainer [2019-09-08 13:25:57,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:25:57,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:25:57,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:25:57,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:25:57,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:25:54" (1/3) ... [2019-09-08 13:25:57,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d803f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:25:57, skipping insertion in model container [2019-09-08 13:25:57,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:25:55" (2/3) ... [2019-09-08 13:25:57,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d803f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:25:57, skipping insertion in model container [2019-09-08 13:25:57,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:25:57" (3/3) ... [2019-09-08 13:25:57,346 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:25:57,357 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:25:57,387 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:25:57,408 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:25:57,456 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:25:57,458 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:25:57,458 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:25:57,458 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:25:57,459 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:25:57,459 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:25:57,460 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:25:57,460 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:25:57,460 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:25:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states. [2019-09-08 13:25:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:25:57,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:57,539 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] [2019-09-08 13:25:57,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -173501281, now seen corresponding path program 1 times [2019-09-08 13:25:57,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:57,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:57,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:58,250 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:25:58,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:58,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:25:58,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:25:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:25:58,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:25:58,275 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 3 states. [2019-09-08 13:25:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:58,432 INFO L93 Difference]: Finished difference Result 659 states and 1131 transitions. [2019-09-08 13:25:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:25:58,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 13:25:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:58,454 INFO L225 Difference]: With dead ends: 659 [2019-09-08 13:25:58,454 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 13:25:58,460 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:25:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 13:25:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2019-09-08 13:25:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-08 13:25:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2019-09-08 13:25:58,570 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 122 [2019-09-08 13:25:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:58,571 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2019-09-08 13:25:58,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:25:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2019-09-08 13:25:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:25:58,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:58,575 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] [2019-09-08 13:25:58,576 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash -911022634, now seen corresponding path program 1 times [2019-09-08 13:25:58,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:58,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:58,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:58,860 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:25:58,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:58,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:25:58,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:25:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:25:58,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:25:58,865 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand 3 states. [2019-09-08 13:25:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:58,947 INFO L93 Difference]: Finished difference Result 1056 states and 1745 transitions. [2019-09-08 13:25:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:25:58,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:25:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:58,954 INFO L225 Difference]: With dead ends: 1056 [2019-09-08 13:25:58,954 INFO L226 Difference]: Without dead ends: 763 [2019-09-08 13:25:58,958 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:25:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-08 13:25:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2019-09-08 13:25:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-08 13:25:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1250 transitions. [2019-09-08 13:25:59,024 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1250 transitions. Word has length 125 [2019-09-08 13:25:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:59,024 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1250 transitions. [2019-09-08 13:25:59,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:25:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1250 transitions. [2019-09-08 13:25:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:25:59,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:59,029 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] [2019-09-08 13:25:59,030 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:59,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash -462854808, now seen corresponding path program 1 times [2019-09-08 13:25:59,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:59,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:59,211 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:25:59,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:59,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:25:59,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:25:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:25:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:25:59,216 INFO L87 Difference]: Start difference. First operand 759 states and 1250 transitions. Second operand 3 states. [2019-09-08 13:25:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:59,288 INFO L93 Difference]: Finished difference Result 1843 states and 3044 transitions. [2019-09-08 13:25:59,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:25:59,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 13:25:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:59,296 INFO L225 Difference]: With dead ends: 1843 [2019-09-08 13:25:59,297 INFO L226 Difference]: Without dead ends: 1281 [2019-09-08 13:25:59,299 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:25:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-08 13:25:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1275. [2019-09-08 13:25:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-08 13:25:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2098 transitions. [2019-09-08 13:25:59,359 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2098 transitions. Word has length 128 [2019-09-08 13:25:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:59,359 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 2098 transitions. [2019-09-08 13:25:59,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:25:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2098 transitions. [2019-09-08 13:25:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:25:59,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:59,363 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] [2019-09-08 13:25:59,363 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 750481413, now seen corresponding path program 1 times [2019-09-08 13:25:59,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:59,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:59,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:59,531 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:25:59,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:59,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:25:59,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:25:59,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:25:59,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:25:59,534 INFO L87 Difference]: Start difference. First operand 1275 states and 2098 transitions. Second operand 3 states. [2019-09-08 13:25:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:59,650 INFO L93 Difference]: Finished difference Result 3351 states and 5516 transitions. [2019-09-08 13:25:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:25:59,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 13:25:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:59,665 INFO L225 Difference]: With dead ends: 3351 [2019-09-08 13:25:59,665 INFO L226 Difference]: Without dead ends: 2273 [2019-09-08 13:25:59,668 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:25:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-09-08 13:25:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2263. [2019-09-08 13:25:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-09-08 13:25:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3710 transitions. [2019-09-08 13:25:59,770 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3710 transitions. Word has length 131 [2019-09-08 13:25:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:59,772 INFO L475 AbstractCegarLoop]: Abstraction has 2263 states and 3710 transitions. [2019-09-08 13:25:59,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:25:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3710 transitions. [2019-09-08 13:25:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 13:25:59,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:59,775 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] [2019-09-08 13:25:59,775 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2145185539, now seen corresponding path program 1 times [2019-09-08 13:25:59,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:59,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:59,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:59,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:00,032 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:26:00,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:00,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:26:00,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:26:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:26:00,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:26:00,070 INFO L87 Difference]: Start difference. First operand 2263 states and 3710 transitions. Second operand 6 states. [2019-09-08 13:26:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:00,753 INFO L93 Difference]: Finished difference Result 8633 states and 14239 transitions. [2019-09-08 13:26:00,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:26:00,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 13:26:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:00,794 INFO L225 Difference]: With dead ends: 8633 [2019-09-08 13:26:00,795 INFO L226 Difference]: Without dead ends: 6567 [2019-09-08 13:26:00,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:26:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2019-09-08 13:26:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 5164. [2019-09-08 13:26:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-09-08 13:26:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8485 transitions. [2019-09-08 13:26:01,251 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8485 transitions. Word has length 134 [2019-09-08 13:26:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:01,251 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8485 transitions. [2019-09-08 13:26:01,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:26:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8485 transitions. [2019-09-08 13:26:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 13:26:01,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:01,256 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] [2019-09-08 13:26:01,256 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2142410535, now seen corresponding path program 1 times [2019-09-08 13:26:01,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:01,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:01,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:01,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:01,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:01,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:01,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:01,438 INFO L87 Difference]: Start difference. First operand 5164 states and 8485 transitions. Second operand 4 states. [2019-09-08 13:26:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:02,111 INFO L93 Difference]: Finished difference Result 13702 states and 22612 transitions. [2019-09-08 13:26:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:02,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 13:26:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:02,161 INFO L225 Difference]: With dead ends: 13702 [2019-09-08 13:26:02,161 INFO L226 Difference]: Without dead ends: 8735 [2019-09-08 13:26:02,178 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:26:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-09-08 13:26:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7629. [2019-09-08 13:26:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7629 states. [2019-09-08 13:26:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 12558 transitions. [2019-09-08 13:26:02,767 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 12558 transitions. Word has length 135 [2019-09-08 13:26:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:02,771 INFO L475 AbstractCegarLoop]: Abstraction has 7629 states and 12558 transitions. [2019-09-08 13:26:02,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 12558 transitions. [2019-09-08 13:26:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:26:02,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:02,776 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] [2019-09-08 13:26:02,777 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2051827388, now seen corresponding path program 1 times [2019-09-08 13:26:02,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:02,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:02,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:02,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:02,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:03,065 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:26:03,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:03,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:03,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:03,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:03,069 INFO L87 Difference]: Start difference. First operand 7629 states and 12558 transitions. Second operand 4 states. [2019-09-08 13:26:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:03,975 INFO L93 Difference]: Finished difference Result 20302 states and 33486 transitions. [2019-09-08 13:26:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:03,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 13:26:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:04,030 INFO L225 Difference]: With dead ends: 20302 [2019-09-08 13:26:04,030 INFO L226 Difference]: Without dead ends: 12870 [2019-09-08 13:26:04,049 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:26:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12870 states. [2019-09-08 13:26:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12870 to 11204. [2019-09-08 13:26:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11204 states. [2019-09-08 13:26:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11204 states to 11204 states and 18427 transitions. [2019-09-08 13:26:04,721 INFO L78 Accepts]: Start accepts. Automaton has 11204 states and 18427 transitions. Word has length 136 [2019-09-08 13:26:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:04,722 INFO L475 AbstractCegarLoop]: Abstraction has 11204 states and 18427 transitions. [2019-09-08 13:26:04,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 11204 states and 18427 transitions. [2019-09-08 13:26:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 13:26:04,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:04,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:04,729 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:04,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash 760808192, now seen corresponding path program 1 times [2019-09-08 13:26:04,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:04,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:04,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:04,920 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:26:04,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:04,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:26:04,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:26:04,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:26:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:26:04,922 INFO L87 Difference]: Start difference. First operand 11204 states and 18427 transitions. Second operand 7 states. [2019-09-08 13:26:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:07,733 INFO L93 Difference]: Finished difference Result 52340 states and 86153 transitions. [2019-09-08 13:26:07,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:26:07,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 13:26:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:07,847 INFO L225 Difference]: With dead ends: 52340 [2019-09-08 13:26:07,847 INFO L226 Difference]: Without dead ends: 41333 [2019-09-08 13:26:07,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:26:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-09-08 13:26:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 32212. [2019-09-08 13:26:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32212 states. [2019-09-08 13:26:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32212 states to 32212 states and 52804 transitions. [2019-09-08 13:26:09,640 INFO L78 Accepts]: Start accepts. Automaton has 32212 states and 52804 transitions. Word has length 137 [2019-09-08 13:26:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:09,641 INFO L475 AbstractCegarLoop]: Abstraction has 32212 states and 52804 transitions. [2019-09-08 13:26:09,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:26:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 32212 states and 52804 transitions. [2019-09-08 13:26:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:26:09,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:09,648 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] [2019-09-08 13:26:09,649 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash 547273736, now seen corresponding path program 1 times [2019-09-08 13:26:09,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:09,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:09,747 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:26:09,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:09,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:09,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:09,749 INFO L87 Difference]: Start difference. First operand 32212 states and 52804 transitions. Second operand 3 states. [2019-09-08 13:26:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:12,236 INFO L93 Difference]: Finished difference Result 68578 states and 112387 transitions. [2019-09-08 13:26:12,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:12,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:26:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:12,339 INFO L225 Difference]: With dead ends: 68578 [2019-09-08 13:26:12,340 INFO L226 Difference]: Without dead ends: 47784 [2019-09-08 13:26:12,384 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:26:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47784 states. [2019-09-08 13:26:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47784 to 47782. [2019-09-08 13:26:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2019-09-08 13:26:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 78034 transitions. [2019-09-08 13:26:14,209 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 78034 transitions. Word has length 138 [2019-09-08 13:26:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:14,210 INFO L475 AbstractCegarLoop]: Abstraction has 47782 states and 78034 transitions. [2019-09-08 13:26:14,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 78034 transitions. [2019-09-08 13:26:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:26:14,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:14,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:14,215 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash 696050988, now seen corresponding path program 1 times [2019-09-08 13:26:14,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:14,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:14,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:14,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:14,315 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:26:14,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:14,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:14,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:14,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:14,317 INFO L87 Difference]: Start difference. First operand 47782 states and 78034 transitions. Second operand 3 states. [2019-09-08 13:26:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:17,617 INFO L93 Difference]: Finished difference Result 98341 states and 160808 transitions. [2019-09-08 13:26:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:17,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:26:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:17,730 INFO L225 Difference]: With dead ends: 98341 [2019-09-08 13:26:17,731 INFO L226 Difference]: Without dead ends: 68203 [2019-09-08 13:26:17,790 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:26:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-09-08 13:26:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 68201. [2019-09-08 13:26:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68201 states. [2019-09-08 13:26:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68201 states to 68201 states and 111031 transitions. [2019-09-08 13:26:20,039 INFO L78 Accepts]: Start accepts. Automaton has 68201 states and 111031 transitions. Word has length 138 [2019-09-08 13:26:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:20,040 INFO L475 AbstractCegarLoop]: Abstraction has 68201 states and 111031 transitions. [2019-09-08 13:26:20,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 68201 states and 111031 transitions. [2019-09-08 13:26:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:26:20,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:20,045 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] [2019-09-08 13:26:20,045 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2057723275, now seen corresponding path program 1 times [2019-09-08 13:26:20,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:20,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:20,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:20,146 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:26:20,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:20,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:20,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:20,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:20,148 INFO L87 Difference]: Start difference. First operand 68201 states and 111031 transitions. Second operand 4 states. [2019-09-08 13:26:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:25,999 INFO L93 Difference]: Finished difference Result 199194 states and 324565 transitions. [2019-09-08 13:26:26,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:26,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 13:26:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:26,255 INFO L225 Difference]: With dead ends: 199194 [2019-09-08 13:26:26,256 INFO L226 Difference]: Without dead ends: 133397 [2019-09-08 13:26:26,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:26:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133397 states. [2019-09-08 13:26:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133397 to 100647. [2019-09-08 13:26:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100647 states. [2019-09-08 13:26:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100647 states to 100647 states and 163638 transitions. [2019-09-08 13:26:30,423 INFO L78 Accepts]: Start accepts. Automaton has 100647 states and 163638 transitions. Word has length 138 [2019-09-08 13:26:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:30,424 INFO L475 AbstractCegarLoop]: Abstraction has 100647 states and 163638 transitions. [2019-09-08 13:26:30,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 100647 states and 163638 transitions. [2019-09-08 13:26:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:26:30,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:30,428 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] [2019-09-08 13:26:30,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1977095112, now seen corresponding path program 1 times [2019-09-08 13:26:30,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:30,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:32,227 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:26:32,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:32,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:32,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:32,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:32,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:32,229 INFO L87 Difference]: Start difference. First operand 100647 states and 163638 transitions. Second operand 3 states. [2019-09-08 13:26:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:37,927 INFO L93 Difference]: Finished difference Result 218957 states and 356288 transitions. [2019-09-08 13:26:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:37,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:26:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:38,268 INFO L225 Difference]: With dead ends: 218957 [2019-09-08 13:26:38,268 INFO L226 Difference]: Without dead ends: 148819 [2019-09-08 13:26:38,386 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:26:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148819 states. [2019-09-08 13:26:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148819 to 148817. [2019-09-08 13:26:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148817 states. [2019-09-08 13:26:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148817 states to 148817 states and 240983 transitions. [2019-09-08 13:26:47,519 INFO L78 Accepts]: Start accepts. Automaton has 148817 states and 240983 transitions. Word has length 138 [2019-09-08 13:26:47,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:47,519 INFO L475 AbstractCegarLoop]: Abstraction has 148817 states and 240983 transitions. [2019-09-08 13:26:47,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 148817 states and 240983 transitions. [2019-09-08 13:26:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:26:47,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:47,521 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] [2019-09-08 13:26:47,522 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:47,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash -682116612, now seen corresponding path program 1 times [2019-09-08 13:26:47,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:47,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:47,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:47,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:47,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:47,609 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:26:47,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:47,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:47,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:47,611 INFO L87 Difference]: Start difference. First operand 148817 states and 240983 transitions. Second operand 3 states. [2019-09-08 13:26:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:57,859 INFO L93 Difference]: Finished difference Result 321956 states and 523325 transitions. [2019-09-08 13:26:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:57,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:26:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:58,239 INFO L225 Difference]: With dead ends: 321956 [2019-09-08 13:26:58,239 INFO L226 Difference]: Without dead ends: 216937 [2019-09-08 13:26:58,333 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:26:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216937 states. [2019-09-08 13:27:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216937 to 216935. [2019-09-08 13:27:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216935 states. [2019-09-08 13:27:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216935 states to 216935 states and 350275 transitions. [2019-09-08 13:27:11,155 INFO L78 Accepts]: Start accepts. Automaton has 216935 states and 350275 transitions. Word has length 138 [2019-09-08 13:27:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:11,155 INFO L475 AbstractCegarLoop]: Abstraction has 216935 states and 350275 transitions. [2019-09-08 13:27:11,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 216935 states and 350275 transitions. [2019-09-08 13:27:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 13:27:11,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:11,157 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] [2019-09-08 13:27:11,157 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 297482555, now seen corresponding path program 1 times [2019-09-08 13:27:11,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:11,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:11,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:11,451 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:27:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:11,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:27:11,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:27:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:27:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:27:11,453 INFO L87 Difference]: Start difference. First operand 216935 states and 350275 transitions. Second operand 6 states. [2019-09-08 13:27:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:30,078 INFO L93 Difference]: Finished difference Result 529867 states and 856378 transitions. [2019-09-08 13:27:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:27:30,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 13:27:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:30,617 INFO L225 Difference]: With dead ends: 529867 [2019-09-08 13:27:30,617 INFO L226 Difference]: Without dead ends: 313197 [2019-09-08 13:27:30,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:27:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313197 states. [2019-09-08 13:27:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313197 to 247495. [2019-09-08 13:27:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247495 states. [2019-09-08 13:27:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247495 states to 247495 states and 398885 transitions. [2019-09-08 13:27:44,806 INFO L78 Accepts]: Start accepts. Automaton has 247495 states and 398885 transitions. Word has length 140 [2019-09-08 13:27:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:44,806 INFO L475 AbstractCegarLoop]: Abstraction has 247495 states and 398885 transitions. [2019-09-08 13:27:44,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:27:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 247495 states and 398885 transitions. [2019-09-08 13:27:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 13:27:44,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:44,807 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] [2019-09-08 13:27:44,808 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash -264023695, now seen corresponding path program 1 times [2019-09-08 13:27:44,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:44,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:44,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:45,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:45,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:27:45,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:27:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:27:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:27:45,882 INFO L87 Difference]: Start difference. First operand 247495 states and 398885 transitions. Second operand 6 states. [2019-09-08 13:28:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:13,272 INFO L93 Difference]: Finished difference Result 728011 states and 1176048 transitions. [2019-09-08 13:28:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:28:13,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 13:28:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:14,180 INFO L225 Difference]: With dead ends: 728011 [2019-09-08 13:28:14,181 INFO L226 Difference]: Without dead ends: 480781 [2019-09-08 13:28:14,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:28:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480781 states. [2019-09-08 13:28:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480781 to 440423. [2019-09-08 13:28:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440423 states. [2019-09-08 13:28:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440423 states to 440423 states and 709542 transitions. [2019-09-08 13:28:52,221 INFO L78 Accepts]: Start accepts. Automaton has 440423 states and 709542 transitions. Word has length 143 [2019-09-08 13:28:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:52,222 INFO L475 AbstractCegarLoop]: Abstraction has 440423 states and 709542 transitions. [2019-09-08 13:28:52,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:28:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 440423 states and 709542 transitions. [2019-09-08 13:28:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 13:28:52,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:52,223 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] [2019-09-08 13:28:52,223 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:52,224 INFO L82 PathProgramCache]: Analyzing trace with hash 403290968, now seen corresponding path program 1 times [2019-09-08 13:28:52,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:52,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:52,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:52,380 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:28:52,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:52,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:28:52,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:28:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:28:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:28:52,382 INFO L87 Difference]: Start difference. First operand 440423 states and 709542 transitions. Second operand 5 states. [2019-09-08 13:29:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:38,990 INFO L93 Difference]: Finished difference Result 737113 states and 1183399 transitions. [2019-09-08 13:29:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:29:38,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 13:29:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:40,295 INFO L225 Difference]: With dead ends: 737113 [2019-09-08 13:29:40,295 INFO L226 Difference]: Without dead ends: 737111 [2019-09-08 13:29:40,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:29:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737111 states. [2019-09-08 13:30:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737111 to 446335. [2019-09-08 13:30:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446335 states. [2019-09-08 13:30:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446335 states to 446335 states and 715409 transitions. [2019-09-08 13:30:25,076 INFO L78 Accepts]: Start accepts. Automaton has 446335 states and 715409 transitions. Word has length 144 [2019-09-08 13:30:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:25,076 INFO L475 AbstractCegarLoop]: Abstraction has 446335 states and 715409 transitions. [2019-09-08 13:30:25,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:30:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 446335 states and 715409 transitions. [2019-09-08 13:30:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:30:25,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:25,081 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:25,081 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1108095999, now seen corresponding path program 1 times [2019-09-08 13:30:25,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:25,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:25,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:25,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:30:25,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:25,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:30:25,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:30:25,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:30:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:30:25,277 INFO L87 Difference]: Start difference. First operand 446335 states and 715409 transitions. Second operand 6 states. [2019-09-08 13:31:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:06,181 INFO L93 Difference]: Finished difference Result 766026 states and 1232016 transitions. [2019-09-08 13:31:06,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:31:06,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:31:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:07,224 INFO L225 Difference]: With dead ends: 766026 [2019-09-08 13:31:07,225 INFO L226 Difference]: Without dead ends: 540412 [2019-09-08 13:31:07,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:31:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540412 states. [2019-09-08 13:31:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540412 to 498602. [2019-09-08 13:31:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498602 states. [2019-09-08 13:31:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498602 states to 498602 states and 799201 transitions. [2019-09-08 13:31:50,156 INFO L78 Accepts]: Start accepts. Automaton has 498602 states and 799201 transitions. Word has length 180 [2019-09-08 13:31:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:50,157 INFO L475 AbstractCegarLoop]: Abstraction has 498602 states and 799201 transitions. [2019-09-08 13:31:50,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:31:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 498602 states and 799201 transitions. [2019-09-08 13:31:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:31:50,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:50,162 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:50,162 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -959318747, now seen corresponding path program 1 times [2019-09-08 13:31:50,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:50,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:50,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:31:50,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:31:50,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:50,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:31:50,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:31:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 13:31:50,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:31:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:31:50,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:31:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:31:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:31:50,989 INFO L87 Difference]: Start difference. First operand 498602 states and 799201 transitions. Second operand 9 states. [2019-09-08 13:32:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:57,393 INFO L93 Difference]: Finished difference Result 1101315 states and 1774196 transitions. [2019-09-08 13:32:57,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 13:32:57,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-09-08 13:32:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:59,619 INFO L225 Difference]: With dead ends: 1101315 [2019-09-08 13:32:59,619 INFO L226 Difference]: Without dead ends: 901929 [2019-09-08 13:32:59,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:33:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901929 states. [2019-09-08 13:34:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901929 to 809701. [2019-09-08 13:34:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809701 states. [2019-09-08 13:34:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809701 states to 809701 states and 1300345 transitions. [2019-09-08 13:34:33,116 INFO L78 Accepts]: Start accepts. Automaton has 809701 states and 1300345 transitions. Word has length 180 [2019-09-08 13:34:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:33,116 INFO L475 AbstractCegarLoop]: Abstraction has 809701 states and 1300345 transitions. [2019-09-08 13:34:33,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:34:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 809701 states and 1300345 transitions. [2019-09-08 13:34:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:34:33,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:33,121 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:33,122 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash 662502449, now seen corresponding path program 1 times [2019-09-08 13:34:33,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 13:34:33,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:33,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:34:33,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:34:33,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:34:33,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:34:33,342 INFO L87 Difference]: Start difference. First operand 809701 states and 1300345 transitions. Second operand 6 states. [2019-09-08 13:36:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:36:02,453 INFO L93 Difference]: Finished difference Result 1418001 states and 2286808 transitions. [2019-09-08 13:36:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:36:02,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:36:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:05,046 INFO L225 Difference]: With dead ends: 1418001 [2019-09-08 13:36:05,046 INFO L226 Difference]: Without dead ends: 1164375 [2019-09-08 13:36:05,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:36:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164375 states.