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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:04:33,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:04:33,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:04:33,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:04:33,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:04:33,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:04:33,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:04:33,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:04:33,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:04:33,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:04:33,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:04:33,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:04:33,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:04:33,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:04:33,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:04:33,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:04:33,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:04:33,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:04:33,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:04:33,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:04:33,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:04:33,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:04:33,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:04:33,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:04:33,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:04:33,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:04:33,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:04:33,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:04:33,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:04:33,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:04:33,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:04:33,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:04:33,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:04:33,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:04:33,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:04:33,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:04:33,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:04:33,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:04:33,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:04:33,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:04:33,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:04:33,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:04:33,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:04:33,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:04:33,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:04:33,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:04:33,903 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:04:33,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:04:33,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:04:33,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:04:33,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:04:33,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:04:33,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:04:33,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:04:33,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:04:33,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:04:33,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:04:33,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:04:33,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:04:33,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:04:33,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:04:33,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:04:33,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:04:33,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:04:33,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:04:33,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:04:33,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:04:33,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:04:33,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:04:33,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:04:33,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:04:33,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:04:33,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:04:33,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:04:33,970 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:04:33,970 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:04:33,971 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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:04:34,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4c33a68/b76f7b73ec7842aba4a1e243f6881d41/FLAG0ff3812cf [2019-09-08 13:04:34,524 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:04:34,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:04:34,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4c33a68/b76f7b73ec7842aba4a1e243f6881d41/FLAG0ff3812cf [2019-09-08 13:04:34,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4c33a68/b76f7b73ec7842aba4a1e243f6881d41 [2019-09-08 13:04:34,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:04:34,885 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:04:34,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:04:34,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:04:34,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:04:34,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:04:34" (1/1) ... [2019-09-08 13:04:34,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7106b43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:34, skipping insertion in model container [2019-09-08 13:04:34,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:04:34" (1/1) ... [2019-09-08 13:04:34,903 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:04:34,977 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:04:35,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:04:35,493 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:04:35,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:04:35,674 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:04:35,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35 WrapperNode [2019-09-08 13:04:35,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:04:35,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:04:35,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:04:35,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:04:35,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... [2019-09-08 13:04:35,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... [2019-09-08 13:04:35,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... [2019-09-08 13:04:35,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... [2019-09-08 13:04:35,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... [2019-09-08 13:04:35,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... [2019-09-08 13:04:35,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... [2019-09-08 13:04:35,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:04:35,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:04:35,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:04:35,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:04:35,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:04:35,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:04:35,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:04:35,869 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:04:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:04:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:04:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:04:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:04:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:04:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:04:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:04:37,387 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:04:37,387 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:04:37,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:04:37 BoogieIcfgContainer [2019-09-08 13:04:37,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:04:37,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:04:37,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:04:37,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:04:37,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:04:34" (1/3) ... [2019-09-08 13:04:37,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43245838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:04:37, skipping insertion in model container [2019-09-08 13:04:37,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:35" (2/3) ... [2019-09-08 13:04:37,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43245838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:04:37, skipping insertion in model container [2019-09-08 13:04:37,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:04:37" (3/3) ... [2019-09-08 13:04:37,397 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:04:37,406 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:04:37,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:04:37,430 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:04:37,463 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:04:37,464 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:04:37,464 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:04:37,465 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:04:37,465 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:04:37,465 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:04:37,465 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:04:37,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:04:37,466 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:04:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-09-08 13:04:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 13:04:37,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:37,510 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] [2019-09-08 13:04:37,512 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1155837260, now seen corresponding path program 1 times [2019-09-08 13:04:37,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:37,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:37,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:37,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:38,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:38,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:38,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:38,236 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-09-08 13:04:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:38,470 INFO L93 Difference]: Finished difference Result 647 states and 1119 transitions. [2019-09-08 13:04:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:38,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 13:04:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:38,514 INFO L225 Difference]: With dead ends: 647 [2019-09-08 13:04:38,515 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 13:04:38,523 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:04:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 13:04:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2019-09-08 13:04:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-08 13:04:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 780 transitions. [2019-09-08 13:04:38,643 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 780 transitions. Word has length 156 [2019-09-08 13:04:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:38,644 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 780 transitions. [2019-09-08 13:04:38,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 780 transitions. [2019-09-08 13:04:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 13:04:38,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:38,651 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] [2019-09-08 13:04:38,651 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1353690447, now seen corresponding path program 1 times [2019-09-08 13:04:38,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:38,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:39,024 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:04:39,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:39,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:39,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:39,028 INFO L87 Difference]: Start difference. First operand 525 states and 780 transitions. Second operand 4 states. [2019-09-08 13:04:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:39,186 INFO L93 Difference]: Finished difference Result 1532 states and 2273 transitions. [2019-09-08 13:04:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:39,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-08 13:04:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:39,194 INFO L225 Difference]: With dead ends: 1532 [2019-09-08 13:04:39,194 INFO L226 Difference]: Without dead ends: 1020 [2019-09-08 13:04:39,201 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:04:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-09-08 13:04:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1018. [2019-09-08 13:04:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-09-08 13:04:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1501 transitions. [2019-09-08 13:04:39,260 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1501 transitions. Word has length 156 [2019-09-08 13:04:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:39,260 INFO L475 AbstractCegarLoop]: Abstraction has 1018 states and 1501 transitions. [2019-09-08 13:04:39,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1501 transitions. [2019-09-08 13:04:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 13:04:39,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:39,267 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] [2019-09-08 13:04:39,267 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1552789903, now seen corresponding path program 1 times [2019-09-08 13:04:39,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:39,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:39,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:39,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:39,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:39,401 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:04:39,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:39,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:39,405 INFO L87 Difference]: Start difference. First operand 1018 states and 1501 transitions. Second operand 3 states. [2019-09-08 13:04:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:39,496 INFO L93 Difference]: Finished difference Result 3008 states and 4433 transitions. [2019-09-08 13:04:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:39,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-08 13:04:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:39,514 INFO L225 Difference]: With dead ends: 3008 [2019-09-08 13:04:39,514 INFO L226 Difference]: Without dead ends: 2022 [2019-09-08 13:04:39,518 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:04:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-09-08 13:04:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1020. [2019-09-08 13:04:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-09-08 13:04:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1503 transitions. [2019-09-08 13:04:39,594 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1503 transitions. Word has length 157 [2019-09-08 13:04:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:39,594 INFO L475 AbstractCegarLoop]: Abstraction has 1020 states and 1503 transitions. [2019-09-08 13:04:39,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1503 transitions. [2019-09-08 13:04:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 13:04:39,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:39,597 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] [2019-09-08 13:04:39,598 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1516867775, now seen corresponding path program 1 times [2019-09-08 13:04:39,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:39,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:39,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:39,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:39,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:39,715 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:04:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:39,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:39,717 INFO L87 Difference]: Start difference. First operand 1020 states and 1503 transitions. Second operand 3 states. [2019-09-08 13:04:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:39,873 INFO L93 Difference]: Finished difference Result 2789 states and 4120 transitions. [2019-09-08 13:04:39,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:39,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 13:04:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:39,883 INFO L225 Difference]: With dead ends: 2789 [2019-09-08 13:04:39,883 INFO L226 Difference]: Without dead ends: 1966 [2019-09-08 13:04:39,885 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:04:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-09-08 13:04:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1964. [2019-09-08 13:04:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-09-08 13:04:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2867 transitions. [2019-09-08 13:04:39,990 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2867 transitions. Word has length 158 [2019-09-08 13:04:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:39,990 INFO L475 AbstractCegarLoop]: Abstraction has 1964 states and 2867 transitions. [2019-09-08 13:04:39,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2867 transitions. [2019-09-08 13:04:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 13:04:39,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:39,995 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] [2019-09-08 13:04:39,995 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:39,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:39,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2015367012, now seen corresponding path program 1 times [2019-09-08 13:04:39,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:39,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:39,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:40,175 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:04:40,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:40,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:40,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:40,177 INFO L87 Difference]: Start difference. First operand 1964 states and 2867 transitions. Second operand 4 states. [2019-09-08 13:04:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:40,303 INFO L93 Difference]: Finished difference Result 3278 states and 4800 transitions. [2019-09-08 13:04:40,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:40,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-08 13:04:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:40,312 INFO L225 Difference]: With dead ends: 3278 [2019-09-08 13:04:40,312 INFO L226 Difference]: Without dead ends: 1499 [2019-09-08 13:04:40,318 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 13:04:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-09-08 13:04:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2019-09-08 13:04:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-09-08 13:04:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2182 transitions. [2019-09-08 13:04:40,426 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2182 transitions. Word has length 158 [2019-09-08 13:04:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:40,427 INFO L475 AbstractCegarLoop]: Abstraction has 1499 states and 2182 transitions. [2019-09-08 13:04:40,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2182 transitions. [2019-09-08 13:04:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:04:40,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:40,435 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 13:04:40,435 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash -528962491, now seen corresponding path program 1 times [2019-09-08 13:04:40,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:40,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:40,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:40,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:40,627 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:04:40,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:40,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:40,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:40,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:40,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:40,630 INFO L87 Difference]: Start difference. First operand 1499 states and 2182 transitions. Second operand 3 states. [2019-09-08 13:04:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:40,786 INFO L93 Difference]: Finished difference Result 3290 states and 4921 transitions. [2019-09-08 13:04:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:40,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 13:04:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:40,799 INFO L225 Difference]: With dead ends: 3290 [2019-09-08 13:04:40,799 INFO L226 Difference]: Without dead ends: 1977 [2019-09-08 13:04:40,807 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:04:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-09-08 13:04:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1933. [2019-09-08 13:04:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2019-09-08 13:04:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2888 transitions. [2019-09-08 13:04:40,921 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2888 transitions. Word has length 159 [2019-09-08 13:04:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:40,922 INFO L475 AbstractCegarLoop]: Abstraction has 1933 states and 2888 transitions. [2019-09-08 13:04:40,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2888 transitions. [2019-09-08 13:04:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 13:04:40,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:40,926 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] [2019-09-08 13:04:40,926 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1484207381, now seen corresponding path program 1 times [2019-09-08 13:04:40,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:40,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:41,043 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:04:41,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:41,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:41,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:41,045 INFO L87 Difference]: Start difference. First operand 1933 states and 2888 transitions. Second operand 3 states. [2019-09-08 13:04:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:41,240 INFO L93 Difference]: Finished difference Result 4690 states and 7155 transitions. [2019-09-08 13:04:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:41,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-08 13:04:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:41,257 INFO L225 Difference]: With dead ends: 4690 [2019-09-08 13:04:41,257 INFO L226 Difference]: Without dead ends: 3027 [2019-09-08 13:04:41,261 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:04:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2019-09-08 13:04:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2711. [2019-09-08 13:04:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-09-08 13:04:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4151 transitions. [2019-09-08 13:04:41,539 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4151 transitions. Word has length 162 [2019-09-08 13:04:41,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:41,539 INFO L475 AbstractCegarLoop]: Abstraction has 2711 states and 4151 transitions. [2019-09-08 13:04:41,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4151 transitions. [2019-09-08 13:04:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 13:04:41,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:41,547 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] [2019-09-08 13:04:41,547 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2071220188, now seen corresponding path program 1 times [2019-09-08 13:04:41,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:41,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:41,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:41,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:41,750 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:04:41,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:41,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:04:41,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:04:41,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:04:41,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:41,752 INFO L87 Difference]: Start difference. First operand 2711 states and 4151 transitions. Second operand 5 states. [2019-09-08 13:04:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:42,356 INFO L93 Difference]: Finished difference Result 7622 states and 11796 transitions. [2019-09-08 13:04:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:04:42,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-09-08 13:04:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:42,384 INFO L225 Difference]: With dead ends: 7622 [2019-09-08 13:04:42,384 INFO L226 Difference]: Without dead ends: 5091 [2019-09-08 13:04:42,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:04:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2019-09-08 13:04:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 5089. [2019-09-08 13:04:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2019-09-08 13:04:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 7829 transitions. [2019-09-08 13:04:42,815 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 7829 transitions. Word has length 162 [2019-09-08 13:04:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:42,816 INFO L475 AbstractCegarLoop]: Abstraction has 5089 states and 7829 transitions. [2019-09-08 13:04:42,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:04:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 7829 transitions. [2019-09-08 13:04:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 13:04:42,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:42,822 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] [2019-09-08 13:04:42,822 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:42,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:42,822 INFO L82 PathProgramCache]: Analyzing trace with hash 430958199, now seen corresponding path program 1 times [2019-09-08 13:04:42,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:42,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:42,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:42,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:42,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:42,990 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:04:42,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:42,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:42,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:42,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:42,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:42,991 INFO L87 Difference]: Start difference. First operand 5089 states and 7829 transitions. Second operand 4 states. [2019-09-08 13:04:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:43,636 INFO L93 Difference]: Finished difference Result 13547 states and 21235 transitions. [2019-09-08 13:04:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:43,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-08 13:04:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:43,699 INFO L225 Difference]: With dead ends: 13547 [2019-09-08 13:04:43,699 INFO L226 Difference]: Without dead ends: 9797 [2019-09-08 13:04:43,710 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:04:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9797 states. [2019-09-08 13:04:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9797 to 9795. [2019-09-08 13:04:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9795 states. [2019-09-08 13:04:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 15103 transitions. [2019-09-08 13:04:44,339 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 15103 transitions. Word has length 162 [2019-09-08 13:04:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:44,340 INFO L475 AbstractCegarLoop]: Abstraction has 9795 states and 15103 transitions. [2019-09-08 13:04:44,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 15103 transitions. [2019-09-08 13:04:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 13:04:44,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:44,348 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] [2019-09-08 13:04:44,348 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash 169281566, now seen corresponding path program 1 times [2019-09-08 13:04:44,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:44,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:44,576 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:04:44,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:44,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:44,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:44,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:44,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:44,578 INFO L87 Difference]: Start difference. First operand 9795 states and 15103 transitions. Second operand 4 states. [2019-09-08 13:04:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:45,525 INFO L93 Difference]: Finished difference Result 25746 states and 39693 transitions. [2019-09-08 13:04:45,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:45,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-08 13:04:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:45,562 INFO L225 Difference]: With dead ends: 25746 [2019-09-08 13:04:45,562 INFO L226 Difference]: Without dead ends: 15974 [2019-09-08 13:04:45,583 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:04:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15974 states. [2019-09-08 13:04:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15974 to 15972. [2019-09-08 13:04:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15972 states. [2019-09-08 13:04:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15972 states to 15972 states and 24436 transitions. [2019-09-08 13:04:46,586 INFO L78 Accepts]: Start accepts. Automaton has 15972 states and 24436 transitions. Word has length 162 [2019-09-08 13:04:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:46,586 INFO L475 AbstractCegarLoop]: Abstraction has 15972 states and 24436 transitions. [2019-09-08 13:04:46,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 15972 states and 24436 transitions. [2019-09-08 13:04:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 13:04:46,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:46,598 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] [2019-09-08 13:04:46,598 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1075293888, now seen corresponding path program 1 times [2019-09-08 13:04:46,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:46,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:46,714 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:04:46,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:46,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:46,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:46,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:46,716 INFO L87 Difference]: Start difference. First operand 15972 states and 24436 transitions. Second operand 3 states. [2019-09-08 13:04:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:48,126 INFO L93 Difference]: Finished difference Result 43438 states and 66412 transitions. [2019-09-08 13:04:48,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:48,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-08 13:04:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:48,196 INFO L225 Difference]: With dead ends: 43438 [2019-09-08 13:04:48,196 INFO L226 Difference]: Without dead ends: 27862 [2019-09-08 13:04:48,240 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:04:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27862 states. [2019-09-08 13:04:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27862 to 27860. [2019-09-08 13:04:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27860 states. [2019-09-08 13:04:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27860 states to 27860 states and 42130 transitions. [2019-09-08 13:04:49,696 INFO L78 Accepts]: Start accepts. Automaton has 27860 states and 42130 transitions. Word has length 164 [2019-09-08 13:04:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:49,696 INFO L475 AbstractCegarLoop]: Abstraction has 27860 states and 42130 transitions. [2019-09-08 13:04:49,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 27860 states and 42130 transitions. [2019-09-08 13:04:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 13:04:49,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:49,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:49,715 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1992197475, now seen corresponding path program 1 times [2019-09-08 13:04:49,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:49,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:49,864 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:04:49,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:49,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:49,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:49,866 INFO L87 Difference]: Start difference. First operand 27860 states and 42130 transitions. Second operand 4 states. [2019-09-08 13:04:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:51,109 INFO L93 Difference]: Finished difference Result 46369 states and 70138 transitions. [2019-09-08 13:04:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:51,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 13:04:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:51,146 INFO L225 Difference]: With dead ends: 46369 [2019-09-08 13:04:51,146 INFO L226 Difference]: Without dead ends: 24890 [2019-09-08 13:04:51,181 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 13:04:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24890 states. [2019-09-08 13:04:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24890 to 24890. [2019-09-08 13:04:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24890 states. [2019-09-08 13:04:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24890 states to 24890 states and 37611 transitions. [2019-09-08 13:04:52,963 INFO L78 Accepts]: Start accepts. Automaton has 24890 states and 37611 transitions. Word has length 164 [2019-09-08 13:04:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:52,964 INFO L475 AbstractCegarLoop]: Abstraction has 24890 states and 37611 transitions. [2019-09-08 13:04:52,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 24890 states and 37611 transitions. [2019-09-08 13:04:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:04:52,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:52,976 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 13:04:52,977 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 914961264, now seen corresponding path program 1 times [2019-09-08 13:04:52,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:52,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:52,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:53,056 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:04:53,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:53,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:53,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:53,058 INFO L87 Difference]: Start difference. First operand 24890 states and 37611 transitions. Second operand 3 states. [2019-09-08 13:04:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:54,662 INFO L93 Difference]: Finished difference Result 67686 states and 103354 transitions. [2019-09-08 13:04:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:54,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 13:04:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:54,720 INFO L225 Difference]: With dead ends: 67686 [2019-09-08 13:04:54,720 INFO L226 Difference]: Without dead ends: 43132 [2019-09-08 13:04:54,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43132 states. [2019-09-08 13:04:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43132 to 38738. [2019-09-08 13:04:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-09-08 13:04:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 59682 transitions. [2019-09-08 13:04:56,389 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 59682 transitions. Word has length 168 [2019-09-08 13:04:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:56,389 INFO L475 AbstractCegarLoop]: Abstraction has 38738 states and 59682 transitions. [2019-09-08 13:04:56,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 59682 transitions. [2019-09-08 13:04:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:04:56,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:56,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:56,402 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash -808861162, now seen corresponding path program 1 times [2019-09-08 13:04:56,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:56,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:56,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:56,597 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:04:56,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:56,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:04:56,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:04:56,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:04:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:04:56,599 INFO L87 Difference]: Start difference. First operand 38738 states and 59682 transitions. Second operand 9 states. [2019-09-08 13:05:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:04,074 INFO L93 Difference]: Finished difference Result 185670 states and 287874 transitions. [2019-09-08 13:05:04,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:05:04,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-09-08 13:05:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:04,277 INFO L225 Difference]: With dead ends: 185670 [2019-09-08 13:05:04,277 INFO L226 Difference]: Without dead ends: 147342 [2019-09-08 13:05:04,331 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:05:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147342 states. [2019-09-08 13:05:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147342 to 86702. [2019-09-08 13:05:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86702 states. [2019-09-08 13:05:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86702 states to 86702 states and 133802 transitions. [2019-09-08 13:05:10,487 INFO L78 Accepts]: Start accepts. Automaton has 86702 states and 133802 transitions. Word has length 168 [2019-09-08 13:05:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:10,487 INFO L475 AbstractCegarLoop]: Abstraction has 86702 states and 133802 transitions. [2019-09-08 13:05:10,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:05:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 86702 states and 133802 transitions. [2019-09-08 13:05:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:05:10,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:10,498 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 13:05:10,498 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1828444201, now seen corresponding path program 1 times [2019-09-08 13:05:10,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:10,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:10,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:10,679 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:10,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:10,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:05:10,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:05:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:05:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:10,681 INFO L87 Difference]: Start difference. First operand 86702 states and 133802 transitions. Second operand 5 states. [2019-09-08 13:05:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:18,485 INFO L93 Difference]: Finished difference Result 176140 states and 273164 transitions. [2019-09-08 13:05:18,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:05:18,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-08 13:05:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:18,698 INFO L225 Difference]: With dead ends: 176140 [2019-09-08 13:05:18,699 INFO L226 Difference]: Without dead ends: 147547 [2019-09-08 13:05:18,755 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 13:05:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147547 states. [2019-09-08 13:05:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147547 to 108473. [2019-09-08 13:05:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108473 states. [2019-09-08 13:05:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108473 states to 108473 states and 167515 transitions. [2019-09-08 13:05:26,834 INFO L78 Accepts]: Start accepts. Automaton has 108473 states and 167515 transitions. Word has length 168 [2019-09-08 13:05:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:26,834 INFO L475 AbstractCegarLoop]: Abstraction has 108473 states and 167515 transitions. [2019-09-08 13:05:26,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:05:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 108473 states and 167515 transitions. [2019-09-08 13:05:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:05:26,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:26,843 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 13:05:26,843 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2026297388, now seen corresponding path program 1 times [2019-09-08 13:05:26,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:26,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:26,998 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:26,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:26,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:26,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:26,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:27,000 INFO L87 Difference]: Start difference. First operand 108473 states and 167515 transitions. Second operand 4 states. [2019-09-08 13:05:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:30,851 INFO L93 Difference]: Finished difference Result 136709 states and 211573 transitions. [2019-09-08 13:05:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:30,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 13:05:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:30,944 INFO L225 Difference]: With dead ends: 136709 [2019-09-08 13:05:30,944 INFO L226 Difference]: Without dead ends: 76619 [2019-09-08 13:05:30,989 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:05:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76619 states. [2019-09-08 13:05:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76619 to 76617. [2019-09-08 13:05:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76617 states. [2019-09-08 13:05:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76617 states to 76617 states and 117343 transitions. [2019-09-08 13:05:34,694 INFO L78 Accepts]: Start accepts. Automaton has 76617 states and 117343 transitions. Word has length 168 [2019-09-08 13:05:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:34,694 INFO L475 AbstractCegarLoop]: Abstraction has 76617 states and 117343 transitions. [2019-09-08 13:05:34,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76617 states and 117343 transitions. [2019-09-08 13:05:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:05:34,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:34,703 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 13:05:34,704 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1750643892, now seen corresponding path program 1 times [2019-09-08 13:05:34,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:34,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:34,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:34,866 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:34,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:34,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:34,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:34,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:34,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:34,868 INFO L87 Difference]: Start difference. First operand 76617 states and 117343 transitions. Second operand 4 states. [2019-09-08 13:05:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:42,534 INFO L93 Difference]: Finished difference Result 213301 states and 325983 transitions. [2019-09-08 13:05:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:42,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 13:05:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:42,712 INFO L225 Difference]: With dead ends: 213301 [2019-09-08 13:05:42,712 INFO L226 Difference]: Without dead ends: 136727 [2019-09-08 13:05:42,771 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:05:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136727 states. [2019-09-08 13:05:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136727 to 136725. [2019-09-08 13:05:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136725 states. [2019-09-08 13:05:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136725 states to 136725 states and 206597 transitions. [2019-09-08 13:05:52,842 INFO L78 Accepts]: Start accepts. Automaton has 136725 states and 206597 transitions. Word has length 168 [2019-09-08 13:05:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:52,842 INFO L475 AbstractCegarLoop]: Abstraction has 136725 states and 206597 transitions. [2019-09-08 13:05:52,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 136725 states and 206597 transitions. [2019-09-08 13:05:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 13:05:52,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:52,858 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] [2019-09-08 13:05:52,858 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1922317134, now seen corresponding path program 1 times [2019-09-08 13:05:52,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:52,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:52,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:52,914 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:52,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:52,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:52,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:52,916 INFO L87 Difference]: Start difference. First operand 136725 states and 206597 transitions. Second operand 3 states. [2019-09-08 13:06:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:09,307 INFO L93 Difference]: Finished difference Result 409975 states and 619536 transitions. [2019-09-08 13:06:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:09,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 13:06:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:09,679 INFO L225 Difference]: With dead ends: 409975 [2019-09-08 13:06:09,679 INFO L226 Difference]: Without dead ends: 273359 [2019-09-08 13:06:09,785 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:06:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273359 states. [2019-09-08 13:06:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273359 to 136731. [2019-09-08 13:06:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136731 states. [2019-09-08 13:06:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136731 states to 136731 states and 206603 transitions. [2019-09-08 13:06:18,661 INFO L78 Accepts]: Start accepts. Automaton has 136731 states and 206603 transitions. Word has length 169 [2019-09-08 13:06:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:18,661 INFO L475 AbstractCegarLoop]: Abstraction has 136731 states and 206603 transitions. [2019-09-08 13:06:18,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 136731 states and 206603 transitions. [2019-09-08 13:06:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:06:18,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:18,672 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] [2019-09-08 13:06:18,673 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:18,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1844980787, now seen corresponding path program 1 times [2019-09-08 13:06:18,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:18,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:18,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:18,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:18,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:18,799 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:06:18,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:18,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:18,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:18,801 INFO L87 Difference]: Start difference. First operand 136731 states and 206603 transitions. Second operand 4 states. [2019-09-08 13:06:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:26,837 INFO L93 Difference]: Finished difference Result 273351 states and 413065 transitions. [2019-09-08 13:06:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:26,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-08 13:06:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:27,017 INFO L225 Difference]: With dead ends: 273351 [2019-09-08 13:06:27,017 INFO L226 Difference]: Without dead ends: 136731 [2019-09-08 13:06:27,102 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 13:06:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136731 states. [2019-09-08 13:06:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136731 to 136728. [2019-09-08 13:06:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136728 states. [2019-09-08 13:06:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136728 states to 136728 states and 206596 transitions. [2019-09-08 13:06:38,157 INFO L78 Accepts]: Start accepts. Automaton has 136728 states and 206596 transitions. Word has length 170 [2019-09-08 13:06:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:38,157 INFO L475 AbstractCegarLoop]: Abstraction has 136728 states and 206596 transitions. [2019-09-08 13:06:38,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 136728 states and 206596 transitions. [2019-09-08 13:06:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:06:38,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:38,168 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] [2019-09-08 13:06:38,169 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2007638048, now seen corresponding path program 1 times [2019-09-08 13:06:38,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:38,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:38,267 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:06:38,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:38,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:38,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:38,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:38,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:38,269 INFO L87 Difference]: Start difference. First operand 136728 states and 206596 transitions. Second operand 3 states. [2019-09-08 13:06:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:52,636 INFO L93 Difference]: Finished difference Result 358238 states and 540437 transitions. [2019-09-08 13:06:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:52,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 13:06:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:53,226 INFO L225 Difference]: With dead ends: 358238 [2019-09-08 13:06:53,226 INFO L226 Difference]: Without dead ends: 222257 [2019-09-08 13:06:53,307 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:06:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222257 states. [2019-09-08 13:07:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222257 to 222255. [2019-09-08 13:07:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222255 states. [2019-09-08 13:07:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222255 states to 222255 states and 331883 transitions. [2019-09-08 13:07:11,670 INFO L78 Accepts]: Start accepts. Automaton has 222255 states and 331883 transitions. Word has length 170 [2019-09-08 13:07:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:11,670 INFO L475 AbstractCegarLoop]: Abstraction has 222255 states and 331883 transitions. [2019-09-08 13:07:11,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 222255 states and 331883 transitions. [2019-09-08 13:07:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:07:11,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:11,694 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] [2019-09-08 13:07:11,694 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:11,695 INFO L82 PathProgramCache]: Analyzing trace with hash 862278397, now seen corresponding path program 1 times [2019-09-08 13:07:11,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:11,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:11,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:11,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:11,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:11,833 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:07:11,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:11,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:11,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:11,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:11,834 INFO L87 Difference]: Start difference. First operand 222255 states and 331883 transitions. Second operand 4 states. [2019-09-08 13:07:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:28,162 INFO L93 Difference]: Finished difference Result 421131 states and 629004 transitions. [2019-09-08 13:07:28,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:28,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-08 13:07:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:28,446 INFO L225 Difference]: With dead ends: 421131 [2019-09-08 13:07:28,446 INFO L226 Difference]: Without dead ends: 199547 [2019-09-08 13:07:28,586 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 13:07:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199547 states. [2019-09-08 13:07:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199547 to 199547. [2019-09-08 13:07:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199547 states. [2019-09-08 13:07:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199547 states to 199547 states and 297892 transitions. [2019-09-08 13:07:41,504 INFO L78 Accepts]: Start accepts. Automaton has 199547 states and 297892 transitions. Word has length 170 [2019-09-08 13:07:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:41,505 INFO L475 AbstractCegarLoop]: Abstraction has 199547 states and 297892 transitions. [2019-09-08 13:07:41,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 199547 states and 297892 transitions. [2019-09-08 13:07:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:07:41,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:41,525 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:07:41,525 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1517127692, now seen corresponding path program 1 times [2019-09-08 13:07:41,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:41,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:41,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:41,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:41,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:41,635 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:07:41,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:41,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:41,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:41,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:41,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:41,637 INFO L87 Difference]: Start difference. First operand 199547 states and 297892 transitions. Second operand 3 states. [2019-09-08 13:08:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:03,342 INFO L93 Difference]: Finished difference Result 482464 states and 720013 transitions. [2019-09-08 13:08:03,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:03,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 13:08:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:04,030 INFO L225 Difference]: With dead ends: 482464 [2019-09-08 13:08:04,030 INFO L226 Difference]: Without dead ends: 305624 [2019-09-08 13:08:04,274 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:08:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305624 states. [2019-09-08 13:08:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305624 to 282213. [2019-09-08 13:08:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282213 states. [2019-09-08 13:08:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282213 states to 282213 states and 413981 transitions. [2019-09-08 13:08:28,308 INFO L78 Accepts]: Start accepts. Automaton has 282213 states and 413981 transitions. Word has length 175 [2019-09-08 13:08:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:28,308 INFO L475 AbstractCegarLoop]: Abstraction has 282213 states and 413981 transitions. [2019-09-08 13:08:28,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 282213 states and 413981 transitions. [2019-09-08 13:08:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:08:28,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:28,324 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:28,325 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1914602502, now seen corresponding path program 1 times [2019-09-08 13:08:28,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:28,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:28,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:28,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:28,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:28,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:28,440 INFO L87 Difference]: Start difference. First operand 282213 states and 413981 transitions. Second operand 4 states. [2019-09-08 13:09:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:00,022 INFO L93 Difference]: Finished difference Result 577927 states and 850443 transitions. [2019-09-08 13:09:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:00,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:09:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:00,684 INFO L225 Difference]: With dead ends: 577927 [2019-09-08 13:09:00,684 INFO L226 Difference]: Without dead ends: 434327 [2019-09-08 13:09:00,832 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 13:09:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434327 states. [2019-09-08 13:09:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434327 to 282109. [2019-09-08 13:09:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282109 states. [2019-09-08 13:09:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282109 states to 282109 states and 413729 transitions. [2019-09-08 13:09:27,089 INFO L78 Accepts]: Start accepts. Automaton has 282109 states and 413729 transitions. Word has length 175 [2019-09-08 13:09:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:27,089 INFO L475 AbstractCegarLoop]: Abstraction has 282109 states and 413729 transitions. [2019-09-08 13:09:27,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 282109 states and 413729 transitions. [2019-09-08 13:09:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:09:27,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:27,109 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:09:27,109 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:27,110 INFO L82 PathProgramCache]: Analyzing trace with hash -258769081, now seen corresponding path program 1 times [2019-09-08 13:09:27,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:27,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:27,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:27,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:27,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:27,754 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:09:27,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:27,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:09:27,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:09:27,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:09:27,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:09:27,757 INFO L87 Difference]: Start difference. First operand 282109 states and 413729 transitions. Second operand 8 states. [2019-09-08 13:10:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:33,854 INFO L93 Difference]: Finished difference Result 1081692 states and 1576561 transitions. [2019-09-08 13:10:33,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:10:33,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-08 13:10:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:35,254 INFO L225 Difference]: With dead ends: 1081692 [2019-09-08 13:10:35,254 INFO L226 Difference]: Without dead ends: 814607 [2019-09-08 13:10:35,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:10:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814607 states. [2019-09-08 13:11:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814607 to 333761. [2019-09-08 13:11:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333761 states. [2019-09-08 13:11:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333761 states to 333761 states and 487869 transitions. [2019-09-08 13:11:15,588 INFO L78 Accepts]: Start accepts. Automaton has 333761 states and 487869 transitions. Word has length 175 [2019-09-08 13:11:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:15,589 INFO L475 AbstractCegarLoop]: Abstraction has 333761 states and 487869 transitions. [2019-09-08 13:11:15,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:11:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 333761 states and 487869 transitions. [2019-09-08 13:11:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:11:15,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:15,607 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:11:15,607 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -611823378, now seen corresponding path program 1 times [2019-09-08 13:11:15,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:15,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:15,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:15,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:15,766 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:11:15,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:15,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:11:15,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:11:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:11:15,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:11:15,768 INFO L87 Difference]: Start difference. First operand 333761 states and 487869 transitions. Second operand 4 states. [2019-09-08 13:11:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:47,334 INFO L93 Difference]: Finished difference Result 574720 states and 838968 transitions. [2019-09-08 13:11:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:11:47,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:11:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:47,817 INFO L225 Difference]: With dead ends: 574720 [2019-09-08 13:11:47,817 INFO L226 Difference]: Without dead ends: 311086 [2019-09-08 13:11:48,022 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:11:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311086 states. [2019-09-08 13:12:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311086 to 311044. [2019-09-08 13:12:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311044 states. [2019-09-08 13:12:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311044 states to 311044 states and 454481 transitions. [2019-09-08 13:12:20,461 INFO L78 Accepts]: Start accepts. Automaton has 311044 states and 454481 transitions. Word has length 175 [2019-09-08 13:12:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:20,462 INFO L475 AbstractCegarLoop]: Abstraction has 311044 states and 454481 transitions. [2019-09-08 13:12:20,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:12:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 311044 states and 454481 transitions. [2019-09-08 13:12:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 13:12:20,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:20,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:12:20,476 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1485366488, now seen corresponding path program 1 times [2019-09-08 13:12:20,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:20,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:20,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:20,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:20,614 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:12:20,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:20,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:12:20,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:12:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:12:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:12:20,616 INFO L87 Difference]: Start difference. First operand 311044 states and 454481 transitions. Second operand 4 states. [2019-09-08 13:12:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:48,433 INFO L93 Difference]: Finished difference Result 622093 states and 908969 transitions. [2019-09-08 13:12:48,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:12:48,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-08 13:12:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:48,935 INFO L225 Difference]: With dead ends: 622093 [2019-09-08 13:12:48,935 INFO L226 Difference]: Without dead ends: 311208 [2019-09-08 13:12:49,478 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 13:12:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311208 states. [2019-09-08 13:13:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311208 to 311146. [2019-09-08 13:13:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311146 states. [2019-09-08 13:13:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311146 states to 311146 states and 454584 transitions. [2019-09-08 13:13:23,914 INFO L78 Accepts]: Start accepts. Automaton has 311146 states and 454584 transitions. Word has length 177 [2019-09-08 13:13:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:23,914 INFO L475 AbstractCegarLoop]: Abstraction has 311146 states and 454584 transitions. [2019-09-08 13:13:23,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:13:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 311146 states and 454584 transitions. [2019-09-08 13:13:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:13:23,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:23,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:13:23,929 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:23,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2040593584, now seen corresponding path program 1 times [2019-09-08 13:13:23,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:23,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:23,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:23,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:23,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:13:23,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:23,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:13:23,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:13:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:13:23,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:13:23,996 INFO L87 Difference]: Start difference. First operand 311146 states and 454584 transitions. Second operand 3 states. [2019-09-08 13:14:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:24,847 INFO L93 Difference]: Finished difference Result 870601 states and 1271846 transitions. [2019-09-08 13:14:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:24,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 13:14:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:25,821 INFO L225 Difference]: With dead ends: 870601 [2019-09-08 13:14:25,821 INFO L226 Difference]: Without dead ends: 622081 [2019-09-08 13:14:26,030 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:14:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622081 states. [2019-09-08 13:14:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622081 to 311156. [2019-09-08 13:14:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311156 states. [2019-09-08 13:14:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311156 states to 311156 states and 454594 transitions. [2019-09-08 13:14:57,046 INFO L78 Accepts]: Start accepts. Automaton has 311156 states and 454594 transitions. Word has length 178 [2019-09-08 13:14:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:57,046 INFO L475 AbstractCegarLoop]: Abstraction has 311156 states and 454594 transitions. [2019-09-08 13:14:57,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 311156 states and 454594 transitions. [2019-09-08 13:14:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:14:57,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:57,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:57,061 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 65679431, now seen corresponding path program 1 times [2019-09-08 13:14:57,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:57,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:57,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:57,180 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:14:57,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:57,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:57,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:57,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:57,182 INFO L87 Difference]: Start difference. First operand 311156 states and 454594 transitions. Second operand 4 states. [2019-09-08 13:15:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:29,672 INFO L93 Difference]: Finished difference Result 560111 states and 817997 transitions. [2019-09-08 13:15:29,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:29,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:15:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:30,118 INFO L225 Difference]: With dead ends: 560111 [2019-09-08 13:15:30,118 INFO L226 Difference]: Without dead ends: 311146 [2019-09-08 13:15:30,273 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 13:15:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311146 states. [2019-09-08 13:15:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311146 to 311146. [2019-09-08 13:15:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311146 states. [2019-09-08 13:15:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311146 states to 311146 states and 454579 transitions. [2019-09-08 13:15:58,756 INFO L78 Accepts]: Start accepts. Automaton has 311146 states and 454579 transitions. Word has length 179 [2019-09-08 13:15:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:58,756 INFO L475 AbstractCegarLoop]: Abstraction has 311146 states and 454579 transitions. [2019-09-08 13:15:58,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 311146 states and 454579 transitions. [2019-09-08 13:15:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:15:58,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:58,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:15:58,773 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1682379632, now seen corresponding path program 1 times [2019-09-08 13:15:58,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:58,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:58,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:58,942 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:15:58,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:58,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:58,944 INFO L87 Difference]: Start difference. First operand 311146 states and 454579 transitions. Second operand 4 states.