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.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:58:28,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:58:28,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:58:28,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:58:28,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:58:28,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:58:28,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:58:28,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:58:28,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:58:28,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:58:28,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:58:28,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:58:28,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:58:28,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:58:28,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:58:28,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:58:28,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:58:28,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:58:28,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:58:28,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:58:28,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:58:28,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:58:28,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:58:28,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:58:28,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:58:28,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:58:28,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:58:28,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:58:28,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:58:28,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:58:28,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:58:28,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:58:28,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:58:28,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:58:28,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:58:28,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:58:28,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:58:28,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:58:28,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:58:28,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:58:28,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:58:28,809 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 12:58:28,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:58:28,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:58:28,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:58:28,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:58:28,840 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:58:28,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:58:28,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:58:28,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:58:28,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:58:28,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:58:28,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:58:28,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:58:28,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:58:28,842 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:58:28,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:58:28,842 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:58:28,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:58:28,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:58:28,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:58:28,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:58:28,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:58:28,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:58:28,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:58:28,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:58:28,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:58:28,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:58:28,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:58:28,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:58:28,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:58:28,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:58:28,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:58:28,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:58:28,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:58:28,887 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:58:28,888 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.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:58:28,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aaac4900/9e58eb8ebfc5475c93a19c344401108c/FLAG4ef31ddfc [2019-09-08 12:58:29,506 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:58:29,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:58:29,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aaac4900/9e58eb8ebfc5475c93a19c344401108c/FLAG4ef31ddfc [2019-09-08 12:58:29,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aaac4900/9e58eb8ebfc5475c93a19c344401108c [2019-09-08 12:58:29,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:58:29,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:58:29,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:58:29,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:58:29,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:58:29,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:58:29" (1/1) ... [2019-09-08 12:58:29,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:29, skipping insertion in model container [2019-09-08 12:58:29,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:58:29" (1/1) ... [2019-09-08 12:58:29,808 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:58:29,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:58:30,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:58:30,443 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:58:30,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:58:30,627 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:58:30,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30 WrapperNode [2019-09-08 12:58:30,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:58:30,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:58:30,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:58:30,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:58:30,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (1/1) ... [2019-09-08 12:58:30,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (1/1) ... [2019-09-08 12:58:30,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (1/1) ... [2019-09-08 12:58:30,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (1/1) ... [2019-09-08 12:58:30,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (1/1) ... [2019-09-08 12:58:30,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (1/1) ... [2019-09-08 12:58:30,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (1/1) ... [2019-09-08 12:58:30,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:58:30,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:58:30,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:58:30,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:58:30,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (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 12:58:30,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:58:30,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:58:30,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:58:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:58:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:58:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:58:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:58:30,803 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:58:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:58:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:58:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:58:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:58:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:58:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:58:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:58:30,806 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:58:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:58:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:58:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:58:32,415 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:58:32,415 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:58:32,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:58:32 BoogieIcfgContainer [2019-09-08 12:58:32,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:58:32,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:58:32,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:58:32,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:58:32,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:58:29" (1/3) ... [2019-09-08 12:58:32,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c88fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:58:32, skipping insertion in model container [2019-09-08 12:58:32,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:30" (2/3) ... [2019-09-08 12:58:32,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c88fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:58:32, skipping insertion in model container [2019-09-08 12:58:32,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:58:32" (3/3) ... [2019-09-08 12:58:32,429 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:58:32,439 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:58:32,463 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:58:32,481 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:58:32,527 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:58:32,528 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:58:32,528 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:58:32,528 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:58:32,528 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:58:32,528 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:58:32,529 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:58:32,529 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:58:32,529 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:58:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2019-09-08 12:58:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:58:32,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:32,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:32,601 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:32,605 INFO L82 PathProgramCache]: Analyzing trace with hash -680724110, now seen corresponding path program 1 times [2019-09-08 12:58:32,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:32,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:32,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:32,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:32,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:33,530 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 12:58:33,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:33,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:33,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:33,556 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 4 states. [2019-09-08 12:58:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:33,857 INFO L93 Difference]: Finished difference Result 1006 states and 1767 transitions. [2019-09-08 12:58:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:58:33,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-08 12:58:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:33,886 INFO L225 Difference]: With dead ends: 1006 [2019-09-08 12:58:33,886 INFO L226 Difference]: Without dead ends: 662 [2019-09-08 12:58:33,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-08 12:58:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2019-09-08 12:58:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 12:58:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 961 transitions. [2019-09-08 12:58:34,016 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 961 transitions. Word has length 159 [2019-09-08 12:58:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:34,017 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 961 transitions. [2019-09-08 12:58:34,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 961 transitions. [2019-09-08 12:58:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:58:34,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:34,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:34,023 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:34,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1230031220, now seen corresponding path program 1 times [2019-09-08 12:58:34,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:34,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:34,172 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 12:58:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:34,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:34,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:34,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:34,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:34,176 INFO L87 Difference]: Start difference. First operand 660 states and 961 transitions. Second operand 3 states. [2019-09-08 12:58:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:34,237 INFO L93 Difference]: Finished difference Result 1934 states and 2813 transitions. [2019-09-08 12:58:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:34,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 12:58:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:34,245 INFO L225 Difference]: With dead ends: 1934 [2019-09-08 12:58:34,245 INFO L226 Difference]: Without dead ends: 1306 [2019-09-08 12:58:34,248 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 12:58:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-08 12:58:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 662. [2019-09-08 12:58:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-08 12:58:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 963 transitions. [2019-09-08 12:58:34,290 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 963 transitions. Word has length 160 [2019-09-08 12:58:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:34,291 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 963 transitions. [2019-09-08 12:58:34,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 963 transitions. [2019-09-08 12:58:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:58:34,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:34,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:34,295 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash 230722581, now seen corresponding path program 1 times [2019-09-08 12:58:34,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:34,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:34,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:34,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:34,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:34,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:34,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:34,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:34,459 INFO L87 Difference]: Start difference. First operand 662 states and 963 transitions. Second operand 3 states. [2019-09-08 12:58:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:34,571 INFO L93 Difference]: Finished difference Result 1739 states and 2540 transitions. [2019-09-08 12:58:34,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:34,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 12:58:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:34,581 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 12:58:34,581 INFO L226 Difference]: Without dead ends: 1274 [2019-09-08 12:58:34,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-08 12:58:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-08 12:58:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-08 12:58:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1835 transitions. [2019-09-08 12:58:34,654 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1835 transitions. Word has length 161 [2019-09-08 12:58:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:34,655 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1835 transitions. [2019-09-08 12:58:34,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1835 transitions. [2019-09-08 12:58:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:58:34,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:34,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:34,660 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1877064936, now seen corresponding path program 1 times [2019-09-08 12:58:34,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:34,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:34,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:34,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:34,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:34,897 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 12:58:34,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:34,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:34,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:34,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:34,899 INFO L87 Difference]: Start difference. First operand 1272 states and 1835 transitions. Second operand 4 states. [2019-09-08 12:58:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:34,993 INFO L93 Difference]: Finished difference Result 2060 states and 2985 transitions. [2019-09-08 12:58:34,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:34,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 12:58:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:35,000 INFO L225 Difference]: With dead ends: 2060 [2019-09-08 12:58:35,001 INFO L226 Difference]: Without dead ends: 973 [2019-09-08 12:58:35,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-08 12:58:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2019-09-08 12:58:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-09-08 12:58:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1399 transitions. [2019-09-08 12:58:35,111 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1399 transitions. Word has length 161 [2019-09-08 12:58:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:35,112 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1399 transitions. [2019-09-08 12:58:35,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1399 transitions. [2019-09-08 12:58:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 12:58:35,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:35,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:35,116 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash 916510918, now seen corresponding path program 1 times [2019-09-08 12:58:35,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:35,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:35,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:35,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:35,230 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 12:58:35,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:35,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:35,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:35,232 INFO L87 Difference]: Start difference. First operand 973 states and 1399 transitions. Second operand 3 states. [2019-09-08 12:58:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:35,351 INFO L93 Difference]: Finished difference Result 2146 states and 3165 transitions. [2019-09-08 12:58:35,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:35,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 12:58:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:35,359 INFO L225 Difference]: With dead ends: 2146 [2019-09-08 12:58:35,359 INFO L226 Difference]: Without dead ends: 1359 [2019-09-08 12:58:35,361 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 12:58:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-09-08 12:58:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1194. [2019-09-08 12:58:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2019-09-08 12:58:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1757 transitions. [2019-09-08 12:58:35,431 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1757 transitions. Word has length 163 [2019-09-08 12:58:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:35,433 INFO L475 AbstractCegarLoop]: Abstraction has 1194 states and 1757 transitions. [2019-09-08 12:58:35,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1757 transitions. [2019-09-08 12:58:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:58:35,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:35,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:35,437 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash -575678253, now seen corresponding path program 1 times [2019-09-08 12:58:35,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:35,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:35,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:35,588 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 12:58:35,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:35,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:35,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:35,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:35,590 INFO L87 Difference]: Start difference. First operand 1194 states and 1757 transitions. Second operand 3 states. [2019-09-08 12:58:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:35,722 INFO L93 Difference]: Finished difference Result 2666 states and 4024 transitions. [2019-09-08 12:58:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:35,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 12:58:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:35,733 INFO L225 Difference]: With dead ends: 2666 [2019-09-08 12:58:35,734 INFO L226 Difference]: Without dead ends: 1742 [2019-09-08 12:58:35,737 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 12:58:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-08 12:58:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1583. [2019-09-08 12:58:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2019-09-08 12:58:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2386 transitions. [2019-09-08 12:58:35,876 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2386 transitions. Word has length 165 [2019-09-08 12:58:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:35,876 INFO L475 AbstractCegarLoop]: Abstraction has 1583 states and 2386 transitions. [2019-09-08 12:58:35,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2386 transitions. [2019-09-08 12:58:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:58:35,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:35,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:35,880 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 866582975, now seen corresponding path program 1 times [2019-09-08 12:58:35,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:35,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:35,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:35,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:36,092 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 12:58:36,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:36,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:36,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:36,094 INFO L87 Difference]: Start difference. First operand 1583 states and 2386 transitions. Second operand 4 states. [2019-09-08 12:58:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:36,335 INFO L93 Difference]: Finished difference Result 3749 states and 5839 transitions. [2019-09-08 12:58:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:36,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 12:58:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:36,349 INFO L225 Difference]: With dead ends: 3749 [2019-09-08 12:58:36,350 INFO L226 Difference]: Without dead ends: 2810 [2019-09-08 12:58:36,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 12:58:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-09-08 12:58:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2808. [2019-09-08 12:58:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-09-08 12:58:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4292 transitions. [2019-09-08 12:58:36,510 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4292 transitions. Word has length 166 [2019-09-08 12:58:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:36,511 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 4292 transitions. [2019-09-08 12:58:36,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4292 transitions. [2019-09-08 12:58:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:58:36,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:36,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:36,515 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash 604906342, now seen corresponding path program 1 times [2019-09-08 12:58:36,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:36,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:36,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:36,759 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 12:58:36,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:36,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:58:36,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:58:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:58:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:36,761 INFO L87 Difference]: Start difference. First operand 2808 states and 4292 transitions. Second operand 5 states. [2019-09-08 12:58:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:37,276 INFO L93 Difference]: Finished difference Result 7311 states and 11597 transitions. [2019-09-08 12:58:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:58:37,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-08 12:58:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:37,312 INFO L225 Difference]: With dead ends: 7311 [2019-09-08 12:58:37,312 INFO L226 Difference]: Without dead ends: 6438 [2019-09-08 12:58:37,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6438 states. [2019-09-08 12:58:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6438 to 4696. [2019-09-08 12:58:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-09-08 12:58:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 7288 transitions. [2019-09-08 12:58:37,705 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 7288 transitions. Word has length 166 [2019-09-08 12:58:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:37,706 INFO L475 AbstractCegarLoop]: Abstraction has 4696 states and 7288 transitions. [2019-09-08 12:58:37,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:58:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 7288 transitions. [2019-09-08 12:58:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:58:37,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:37,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:37,710 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:37,711 INFO L82 PathProgramCache]: Analyzing trace with hash 407053155, now seen corresponding path program 1 times [2019-09-08 12:58:37,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:37,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:37,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:37,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:37,839 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 12:58:37,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:37,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:37,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:37,841 INFO L87 Difference]: Start difference. First operand 4696 states and 7288 transitions. Second operand 3 states. [2019-09-08 12:58:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:38,347 INFO L93 Difference]: Finished difference Result 11669 states and 18396 transitions. [2019-09-08 12:58:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:38,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 12:58:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:38,407 INFO L225 Difference]: With dead ends: 11669 [2019-09-08 12:58:38,407 INFO L226 Difference]: Without dead ends: 8075 [2019-09-08 12:58:38,419 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 12:58:38,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2019-09-08 12:58:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2019-09-08 12:58:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8073 states. [2019-09-08 12:58:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 12553 transitions. [2019-09-08 12:58:38,954 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 12553 transitions. Word has length 166 [2019-09-08 12:58:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:38,955 INFO L475 AbstractCegarLoop]: Abstraction has 8073 states and 12553 transitions. [2019-09-08 12:58:38,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 12553 transitions. [2019-09-08 12:58:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:58:38,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:38,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:38,966 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -481927627, now seen corresponding path program 1 times [2019-09-08 12:58:38,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:38,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:38,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:38,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:39,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:39,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:39,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:39,112 INFO L87 Difference]: Start difference. First operand 8073 states and 12553 transitions. Second operand 3 states. [2019-09-08 12:58:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:39,944 INFO L93 Difference]: Finished difference Result 19174 states and 30215 transitions. [2019-09-08 12:58:39,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:39,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 12:58:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:39,985 INFO L225 Difference]: With dead ends: 19174 [2019-09-08 12:58:39,986 INFO L226 Difference]: Without dead ends: 15312 [2019-09-08 12:58:39,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15312 states. [2019-09-08 12:58:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15312 to 15310. [2019-09-08 12:58:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15310 states. [2019-09-08 12:58:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15310 states to 15310 states and 23939 transitions. [2019-09-08 12:58:40,830 INFO L78 Accepts]: Start accepts. Automaton has 15310 states and 23939 transitions. Word has length 166 [2019-09-08 12:58:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:40,831 INFO L475 AbstractCegarLoop]: Abstraction has 15310 states and 23939 transitions. [2019-09-08 12:58:40,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15310 states and 23939 transitions. [2019-09-08 12:58:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:58:40,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:40,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:40,840 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1103659511, now seen corresponding path program 1 times [2019-09-08 12:58:40,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:40,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:41,029 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 12:58:41,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:41,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:41,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:41,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:41,032 INFO L87 Difference]: Start difference. First operand 15310 states and 23939 transitions. Second operand 4 states. [2019-09-08 12:58:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:42,835 INFO L93 Difference]: Finished difference Result 40258 states and 62924 transitions. [2019-09-08 12:58:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:42,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 12:58:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:42,900 INFO L225 Difference]: With dead ends: 40258 [2019-09-08 12:58:42,900 INFO L226 Difference]: Without dead ends: 24971 [2019-09-08 12:58:42,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24971 states. [2019-09-08 12:58:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24971 to 24969. [2019-09-08 12:58:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24969 states. [2019-09-08 12:58:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24969 states to 24969 states and 38683 transitions. [2019-09-08 12:58:44,136 INFO L78 Accepts]: Start accepts. Automaton has 24969 states and 38683 transitions. Word has length 166 [2019-09-08 12:58:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:44,136 INFO L475 AbstractCegarLoop]: Abstraction has 24969 states and 38683 transitions. [2019-09-08 12:58:44,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 24969 states and 38683 transitions. [2019-09-08 12:58:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 12:58:44,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:44,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:44,150 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1600496136, now seen corresponding path program 1 times [2019-09-08 12:58:44,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:44,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:44,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:44,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:44,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:44,249 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 12:58:44,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:44,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:44,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:44,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:44,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:44,251 INFO L87 Difference]: Start difference. First operand 24969 states and 38683 transitions. Second operand 3 states. [2019-09-08 12:58:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:45,756 INFO L93 Difference]: Finished difference Result 67647 states and 104662 transitions. [2019-09-08 12:58:45,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:45,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 12:58:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:45,862 INFO L225 Difference]: With dead ends: 67647 [2019-09-08 12:58:45,862 INFO L226 Difference]: Without dead ends: 43074 [2019-09-08 12:58:45,914 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 12:58:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43074 states. [2019-09-08 12:58:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43074 to 43072. [2019-09-08 12:58:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43072 states. [2019-09-08 12:58:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43072 states to 43072 states and 65959 transitions. [2019-09-08 12:58:48,531 INFO L78 Accepts]: Start accepts. Automaton has 43072 states and 65959 transitions. Word has length 168 [2019-09-08 12:58:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:48,531 INFO L475 AbstractCegarLoop]: Abstraction has 43072 states and 65959 transitions. [2019-09-08 12:58:48,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 43072 states and 65959 transitions. [2019-09-08 12:58:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 12:58:48,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:48,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:48,549 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1549111509, now seen corresponding path program 1 times [2019-09-08 12:58:48,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:48,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:48,688 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 12:58:48,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:48,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:48,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:48,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:48,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:48,690 INFO L87 Difference]: Start difference. First operand 43072 states and 65959 transitions. Second operand 4 states. [2019-09-08 12:58:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:50,173 INFO L93 Difference]: Finished difference Result 72291 states and 110707 transitions. [2019-09-08 12:58:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:50,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 12:58:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:50,236 INFO L225 Difference]: With dead ends: 72291 [2019-09-08 12:58:50,236 INFO L226 Difference]: Without dead ends: 39006 [2019-09-08 12:58:50,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39006 states. [2019-09-08 12:58:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39006 to 39006. [2019-09-08 12:58:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39006 states. [2019-09-08 12:58:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39006 states to 39006 states and 59715 transitions. [2019-09-08 12:58:52,920 INFO L78 Accepts]: Start accepts. Automaton has 39006 states and 59715 transitions. Word has length 168 [2019-09-08 12:58:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:52,920 INFO L475 AbstractCegarLoop]: Abstraction has 39006 states and 59715 transitions. [2019-09-08 12:58:52,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 39006 states and 59715 transitions. [2019-09-08 12:58:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 12:58:52,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:52,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:52,935 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1641209572, now seen corresponding path program 1 times [2019-09-08 12:58:52,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:52,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:52,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:52,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:52,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:53,011 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 12:58:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:53,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:53,012 INFO L87 Difference]: Start difference. First operand 39006 states and 59715 transitions. Second operand 3 states. [2019-09-08 12:58:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:55,475 INFO L93 Difference]: Finished difference Result 107450 states and 165930 transitions. [2019-09-08 12:58:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:55,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 12:58:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:55,570 INFO L225 Difference]: With dead ends: 107450 [2019-09-08 12:58:55,570 INFO L226 Difference]: Without dead ends: 68780 [2019-09-08 12:58:55,615 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 12:58:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68780 states. [2019-09-08 12:58:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68780 to 63162. [2019-09-08 12:58:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63162 states. [2019-09-08 12:58:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63162 states to 63162 states and 98050 transitions. [2019-09-08 12:58:59,932 INFO L78 Accepts]: Start accepts. Automaton has 63162 states and 98050 transitions. Word has length 172 [2019-09-08 12:58:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:59,932 INFO L475 AbstractCegarLoop]: Abstraction has 63162 states and 98050 transitions. [2019-09-08 12:58:59,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 63162 states and 98050 transitions. [2019-09-08 12:58:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:58:59,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:59,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:59,947 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1028468433, now seen corresponding path program 1 times [2019-09-08 12:58:59,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:00,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:00,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:00,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:00,023 INFO L87 Difference]: Start difference. First operand 63162 states and 98050 transitions. Second operand 3 states. [2019-09-08 12:59:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:04,908 INFO L93 Difference]: Finished difference Result 185545 states and 288658 transitions. [2019-09-08 12:59:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:04,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 12:59:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:05,107 INFO L225 Difference]: With dead ends: 185545 [2019-09-08 12:59:05,107 INFO L226 Difference]: Without dead ends: 124447 [2019-09-08 12:59:05,168 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 12:59:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124447 states. [2019-09-08 12:59:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124447 to 124445. [2019-09-08 12:59:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124445 states. [2019-09-08 12:59:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124445 states to 124445 states and 192484 transitions. [2019-09-08 12:59:12,149 INFO L78 Accepts]: Start accepts. Automaton has 124445 states and 192484 transitions. Word has length 173 [2019-09-08 12:59:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:12,150 INFO L475 AbstractCegarLoop]: Abstraction has 124445 states and 192484 transitions. [2019-09-08 12:59:12,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 124445 states and 192484 transitions. [2019-09-08 12:59:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:59:12,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:12,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:12,171 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1862933814, now seen corresponding path program 1 times [2019-09-08 12:59:12,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:12,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:12,334 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 12:59:12,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:12,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:12,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:12,338 INFO L87 Difference]: Start difference. First operand 124445 states and 192484 transitions. Second operand 3 states. [2019-09-08 12:59:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:21,680 INFO L93 Difference]: Finished difference Result 286161 states and 443702 transitions. [2019-09-08 12:59:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:21,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 12:59:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:21,958 INFO L225 Difference]: With dead ends: 286161 [2019-09-08 12:59:21,958 INFO L226 Difference]: Without dead ends: 176383 [2019-09-08 12:59:22,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176383 states. [2019-09-08 12:59:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176383 to 175741. [2019-09-08 12:59:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175741 states. [2019-09-08 12:59:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175741 states to 175741 states and 268468 transitions. [2019-09-08 12:59:33,349 INFO L78 Accepts]: Start accepts. Automaton has 175741 states and 268468 transitions. Word has length 173 [2019-09-08 12:59:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:33,349 INFO L475 AbstractCegarLoop]: Abstraction has 175741 states and 268468 transitions. [2019-09-08 12:59:33,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 175741 states and 268468 transitions. [2019-09-08 12:59:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:59:33,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:33,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:33,368 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1681094410, now seen corresponding path program 1 times [2019-09-08 12:59:33,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:33,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:33,584 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 12:59:33,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:33,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:33,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:33,585 INFO L87 Difference]: Start difference. First operand 175741 states and 268468 transitions. Second operand 9 states. [2019-09-08 13:00:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:16,781 INFO L93 Difference]: Finished difference Result 905410 states and 1378926 transitions. [2019-09-08 13:00:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:00:16,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-09-08 13:00:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:18,039 INFO L225 Difference]: With dead ends: 905410 [2019-09-08 13:00:18,039 INFO L226 Difference]: Without dead ends: 730224 [2019-09-08 13:00:18,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:00:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730224 states. [2019-09-08 13:00:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730224 to 411304. [2019-09-08 13:00:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411304 states. [2019-09-08 13:00:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411304 states to 411304 states and 622305 transitions. [2019-09-08 13:00:58,736 INFO L78 Accepts]: Start accepts. Automaton has 411304 states and 622305 transitions. Word has length 173 [2019-09-08 13:00:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:58,736 INFO L475 AbstractCegarLoop]: Abstraction has 411304 states and 622305 transitions. [2019-09-08 13:00:58,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 411304 states and 622305 transitions. [2019-09-08 13:00:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:00:58,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:58,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:58,751 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash 23432477, now seen corresponding path program 1 times [2019-09-08 13:00:58,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:58,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:58,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:58,889 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:00:58,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:58,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:00:58,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:00:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:00:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:00:58,891 INFO L87 Difference]: Start difference. First operand 411304 states and 622305 transitions. Second operand 4 states. [2019-09-08 13:01:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:21,148 INFO L93 Difference]: Finished difference Result 543844 states and 823419 transitions. [2019-09-08 13:01:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:01:21,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 13:01:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:22,309 INFO L225 Difference]: With dead ends: 543844 [2019-09-08 13:01:22,309 INFO L226 Difference]: Without dead ends: 265682 [2019-09-08 13:01:22,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:01:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265682 states. [2019-09-08 13:01:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265682 to 265680. [2019-09-08 13:01:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265680 states. [2019-09-08 13:01:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265680 states to 265680 states and 399745 transitions. [2019-09-08 13:01:45,255 INFO L78 Accepts]: Start accepts. Automaton has 265680 states and 399745 transitions. Word has length 173 [2019-09-08 13:01:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:45,256 INFO L475 AbstractCegarLoop]: Abstraction has 265680 states and 399745 transitions. [2019-09-08 13:01:45,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:01:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 265680 states and 399745 transitions. [2019-09-08 13:01:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:01:45,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:45,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:45,271 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -174420710, now seen corresponding path program 1 times [2019-09-08 13:01:45,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:45,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:45,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:45,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:45,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:45,441 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:01:45,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:45,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:01:45,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:01:45,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:01:45,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:01:45,443 INFO L87 Difference]: Start difference. First operand 265680 states and 399745 transitions. Second operand 6 states. [2019-09-08 13:02:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:18,186 INFO L93 Difference]: Finished difference Result 654866 states and 992037 transitions. [2019-09-08 13:02:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:02:18,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-09-08 13:02:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:19,124 INFO L225 Difference]: With dead ends: 654866 [2019-09-08 13:02:19,125 INFO L226 Difference]: Without dead ends: 459162 [2019-09-08 13:02:19,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:02:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459162 states. [2019-09-08 13:02:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459162 to 398160. [2019-09-08 13:02:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398160 states. [2019-09-08 13:02:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398160 states to 398160 states and 600739 transitions. [2019-09-08 13:02:53,699 INFO L78 Accepts]: Start accepts. Automaton has 398160 states and 600739 transitions. Word has length 173 [2019-09-08 13:02:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:53,700 INFO L475 AbstractCegarLoop]: Abstraction has 398160 states and 600739 transitions. [2019-09-08 13:02:53,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:02:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 398160 states and 600739 transitions. [2019-09-08 13:02:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:02:53,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:53,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:53,719 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -420368598, now seen corresponding path program 1 times [2019-09-08 13:02:53,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:53,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:53,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:53,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:53,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:02:53,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:02:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:02:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:02:53,903 INFO L87 Difference]: Start difference. First operand 398160 states and 600739 transitions. Second operand 4 states. [2019-09-08 13:03:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:51,753 INFO L93 Difference]: Finished difference Result 1105637 states and 1665158 transitions. [2019-09-08 13:03:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:51,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 13:03:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:53,052 INFO L225 Difference]: With dead ends: 1105637 [2019-09-08 13:03:53,052 INFO L226 Difference]: Without dead ends: 707520 [2019-09-08 13:03:53,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707520 states. [2019-09-08 13:05:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707520 to 707518. [2019-09-08 13:05:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707518 states. [2019-09-08 13:05:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707518 states to 707518 states and 1052875 transitions. [2019-09-08 13:05:03,007 INFO L78 Accepts]: Start accepts. Automaton has 707518 states and 1052875 transitions. Word has length 173 [2019-09-08 13:05:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:03,007 INFO L475 AbstractCegarLoop]: Abstraction has 707518 states and 1052875 transitions. [2019-09-08 13:05:03,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 707518 states and 1052875 transitions. [2019-09-08 13:05:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 13:05:03,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:03,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:03,043 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1327227970, now seen corresponding path program 1 times [2019-09-08 13:05:03,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:03,109 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:05:03,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:03,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:03,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:03,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:03,112 INFO L87 Difference]: Start difference. First operand 707518 states and 1052875 transitions. Second operand 3 states. [2019-09-08 13:06:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:58,578 INFO L93 Difference]: Finished difference Result 2122348 states and 3158362 transitions. [2019-09-08 13:06:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:58,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 13:06:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:01,146 INFO L225 Difference]: With dead ends: 2122348 [2019-09-08 13:07:01,147 INFO L226 Difference]: Without dead ends: 1414942 [2019-09-08 13:07:01,675 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:07:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414942 states. [2019-09-08 13:08:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414942 to 707524. [2019-09-08 13:08:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707524 states. [2019-09-08 13:08:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707524 states to 707524 states and 1052881 transitions. [2019-09-08 13:08:31,387 INFO L78 Accepts]: Start accepts. Automaton has 707524 states and 1052881 transitions. Word has length 174 [2019-09-08 13:08:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:31,388 INFO L475 AbstractCegarLoop]: Abstraction has 707524 states and 1052881 transitions. [2019-09-08 13:08:31,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 707524 states and 1052881 transitions. [2019-09-08 13:08:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:08:31,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:31,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:31,418 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2059264649, now seen corresponding path program 1 times [2019-09-08 13:08:31,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:31,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:31,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:31,548 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:08:31,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:31,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:31,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:31,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:31,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:31,550 INFO L87 Difference]: Start difference. First operand 707524 states and 1052881 transitions. Second operand 4 states.