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_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:02:41,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:02:41,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:02:41,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:02:41,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:02:41,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:02:41,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:02:41,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:02:41,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:02:41,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:02:41,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:02:41,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:02:41,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:02:41,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:02:41,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:02:41,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:02:41,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:02:41,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:02:41,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:02:41,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:02:41,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:02:41,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:02:41,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:02:41,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:02:41,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:02:41,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:02:41,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:02:41,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:02:41,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:02:41,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:02:41,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:02:41,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:02:41,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:02:41,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:02:41,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:02:41,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:02:41,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:02:41,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:02:41,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:02:41,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:02:41,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:02:41,883 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 11:02:41,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:02:41,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:02:41,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:02:41,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:02:41,903 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:02:41,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:02:41,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:02:41,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:02:41,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:02:41,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:02:41,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:02:41,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:02:41,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:02:41,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:02:41,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:02:41,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:02:41,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:02:41,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:02:41,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:02:41,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:02:41,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:02:41,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:02:41,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:02:41,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:02:41,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:02:41,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:02:41,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:02:41,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:02:41,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:02:41,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:02:41,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:02:41,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:02:41,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:02:41,974 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:02:41,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:02:42,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11788128/44b0d9aa226740abbf02ecf66df05ba8/FLAGf4736141e [2019-09-08 11:02:42,597 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:02:42,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:02:42,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11788128/44b0d9aa226740abbf02ecf66df05ba8/FLAGf4736141e [2019-09-08 11:02:42,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11788128/44b0d9aa226740abbf02ecf66df05ba8 [2019-09-08 11:02:42,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:02:42,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:02:42,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:02:42,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:02:42,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:02:42,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:02:42" (1/1) ... [2019-09-08 11:02:42,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b519728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:42, skipping insertion in model container [2019-09-08 11:02:42,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:02:42" (1/1) ... [2019-09-08 11:02:42,977 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:02:43,035 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:02:43,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:02:43,503 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:02:43,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:02:43,648 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:02:43,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43 WrapperNode [2019-09-08 11:02:43,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:02:43,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:02:43,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:02:43,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:02:43,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (1/1) ... [2019-09-08 11:02:43,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (1/1) ... [2019-09-08 11:02:43,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (1/1) ... [2019-09-08 11:02:43,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (1/1) ... [2019-09-08 11:02:43,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (1/1) ... [2019-09-08 11:02:43,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (1/1) ... [2019-09-08 11:02:43,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (1/1) ... [2019-09-08 11:02:43,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:02:43,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:02:43,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:02:43,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:02:43,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (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 11:02:43,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:02:43,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:02:43,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:02:43,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:02:43,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:02:43,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:02:43,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:02:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:02:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:02:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:02:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:02:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:02:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:02:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:02:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:02:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:02:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:02:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:02:43,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:02:43,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:02:43,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:02:44,692 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:02:44,692 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:02:44,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:02:44 BoogieIcfgContainer [2019-09-08 11:02:44,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:02:44,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:02:44,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:02:44,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:02:44,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:02:42" (1/3) ... [2019-09-08 11:02:44,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b06a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:02:44, skipping insertion in model container [2019-09-08 11:02:44,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:43" (2/3) ... [2019-09-08 11:02:44,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b06a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:02:44, skipping insertion in model container [2019-09-08 11:02:44,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:02:44" (3/3) ... [2019-09-08 11:02:44,702 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:02:44,712 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:02:44,721 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:02:44,738 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:02:44,772 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:02:44,772 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:02:44,773 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:02:44,773 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:02:44,773 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:02:44,774 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:02:44,774 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:02:44,774 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:02:44,774 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:02:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2019-09-08 11:02:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:02:44,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:44,812 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] [2019-09-08 11:02:44,814 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2015518254, now seen corresponding path program 1 times [2019-09-08 11:02:44,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:44,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:44,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:44,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:45,329 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 11:02:45,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:45,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:45,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:45,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:45,354 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 3 states. [2019-09-08 11:02:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:45,526 INFO L93 Difference]: Finished difference Result 443 states and 725 transitions. [2019-09-08 11:02:45,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:45,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:02:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:45,549 INFO L225 Difference]: With dead ends: 443 [2019-09-08 11:02:45,550 INFO L226 Difference]: Without dead ends: 332 [2019-09-08 11:02:45,554 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 11:02:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-08 11:02:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-09-08 11:02:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 11:02:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 494 transitions. [2019-09-08 11:02:45,626 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 494 transitions. Word has length 84 [2019-09-08 11:02:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:45,627 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 494 transitions. [2019-09-08 11:02:45,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 494 transitions. [2019-09-08 11:02:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:02:45,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:45,632 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] [2019-09-08 11:02:45,632 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2072558176, now seen corresponding path program 1 times [2019-09-08 11:02:45,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:45,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:45,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:45,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:45,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:46,000 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 11:02:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:46,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:46,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:46,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:46,004 INFO L87 Difference]: Start difference. First operand 330 states and 494 transitions. Second operand 7 states. [2019-09-08 11:02:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:46,417 INFO L93 Difference]: Finished difference Result 1416 states and 2196 transitions. [2019-09-08 11:02:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:02:46,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-08 11:02:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:46,428 INFO L225 Difference]: With dead ends: 1416 [2019-09-08 11:02:46,428 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 11:02:46,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 11:02:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1162. [2019-09-08 11:02:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-09-08 11:02:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1795 transitions. [2019-09-08 11:02:46,524 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1795 transitions. Word has length 85 [2019-09-08 11:02:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:46,525 INFO L475 AbstractCegarLoop]: Abstraction has 1162 states and 1795 transitions. [2019-09-08 11:02:46,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:02:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1795 transitions. [2019-09-08 11:02:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:02:46,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:46,532 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] [2019-09-08 11:02:46,532 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1529357462, now seen corresponding path program 1 times [2019-09-08 11:02:46,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:46,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:46,703 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 11:02:46,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:46,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:02:46,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:02:46,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:02:46,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:02:46,705 INFO L87 Difference]: Start difference. First operand 1162 states and 1795 transitions. Second operand 6 states. [2019-09-08 11:02:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:47,282 INFO L93 Difference]: Finished difference Result 3974 states and 6233 transitions. [2019-09-08 11:02:47,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:47,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-08 11:02:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:47,302 INFO L225 Difference]: With dead ends: 3974 [2019-09-08 11:02:47,308 INFO L226 Difference]: Without dead ends: 2874 [2019-09-08 11:02:47,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:02:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2019-09-08 11:02:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2870. [2019-09-08 11:02:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2870 states. [2019-09-08 11:02:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 4490 transitions. [2019-09-08 11:02:47,460 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 4490 transitions. Word has length 86 [2019-09-08 11:02:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:47,461 INFO L475 AbstractCegarLoop]: Abstraction has 2870 states and 4490 transitions. [2019-09-08 11:02:47,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:02:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 4490 transitions. [2019-09-08 11:02:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:02:47,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:47,466 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] [2019-09-08 11:02:47,467 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash 792250185, now seen corresponding path program 1 times [2019-09-08 11:02:47,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:47,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:47,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:47,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:47,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:47,600 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 11:02:47,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:47,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:47,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:47,603 INFO L87 Difference]: Start difference. First operand 2870 states and 4490 transitions. Second operand 5 states. [2019-09-08 11:02:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:48,203 INFO L93 Difference]: Finished difference Result 7907 states and 12459 transitions. [2019-09-08 11:02:48,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:48,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:02:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:48,232 INFO L225 Difference]: With dead ends: 7907 [2019-09-08 11:02:48,232 INFO L226 Difference]: Without dead ends: 5186 [2019-09-08 11:02:48,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2019-09-08 11:02:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5184. [2019-09-08 11:02:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2019-09-08 11:02:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 8126 transitions. [2019-09-08 11:02:48,541 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 8126 transitions. Word has length 86 [2019-09-08 11:02:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:48,541 INFO L475 AbstractCegarLoop]: Abstraction has 5184 states and 8126 transitions. [2019-09-08 11:02:48,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 8126 transitions. [2019-09-08 11:02:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:02:48,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:48,551 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] [2019-09-08 11:02:48,551 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1699352504, now seen corresponding path program 1 times [2019-09-08 11:02:48,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:48,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:48,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:48,729 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 11:02:48,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:48,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:48,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:48,734 INFO L87 Difference]: Start difference. First operand 5184 states and 8126 transitions. Second operand 5 states. [2019-09-08 11:02:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:49,607 INFO L93 Difference]: Finished difference Result 14903 states and 23439 transitions. [2019-09-08 11:02:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:49,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:02:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:49,657 INFO L225 Difference]: With dead ends: 14903 [2019-09-08 11:02:49,657 INFO L226 Difference]: Without dead ends: 9834 [2019-09-08 11:02:49,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2019-09-08 11:02:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9832. [2019-09-08 11:02:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9832 states. [2019-09-08 11:02:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 15381 transitions. [2019-09-08 11:02:50,229 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 15381 transitions. Word has length 86 [2019-09-08 11:02:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:50,230 INFO L475 AbstractCegarLoop]: Abstraction has 9832 states and 15381 transitions. [2019-09-08 11:02:50,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 15381 transitions. [2019-09-08 11:02:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:02:50,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:50,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:02:50,235 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash -327564249, now seen corresponding path program 1 times [2019-09-08 11:02:50,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:50,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:50,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:50,362 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 11:02:50,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:50,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:50,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:50,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:50,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:50,363 INFO L87 Difference]: Start difference. First operand 9832 states and 15381 transitions. Second operand 5 states. [2019-09-08 11:02:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:51,436 INFO L93 Difference]: Finished difference Result 28975 states and 45414 transitions. [2019-09-08 11:02:51,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:51,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:02:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:51,497 INFO L225 Difference]: With dead ends: 28975 [2019-09-08 11:02:51,497 INFO L226 Difference]: Without dead ends: 19228 [2019-09-08 11:02:51,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19228 states. [2019-09-08 11:02:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19228 to 19226. [2019-09-08 11:02:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19226 states. [2019-09-08 11:02:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19226 states to 19226 states and 29963 transitions. [2019-09-08 11:02:53,037 INFO L78 Accepts]: Start accepts. Automaton has 19226 states and 29963 transitions. Word has length 86 [2019-09-08 11:02:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:53,038 INFO L475 AbstractCegarLoop]: Abstraction has 19226 states and 29963 transitions. [2019-09-08 11:02:53,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 19226 states and 29963 transitions. [2019-09-08 11:02:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:02:53,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:53,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:02:53,045 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2020962565, now seen corresponding path program 1 times [2019-09-08 11:02:53,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:53,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:53,133 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 11:02:53,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:53,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:53,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:53,136 INFO L87 Difference]: Start difference. First operand 19226 states and 29963 transitions. Second operand 5 states. [2019-09-08 11:02:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:54,796 INFO L93 Difference]: Finished difference Result 57290 states and 89371 transitions. [2019-09-08 11:02:54,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:54,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:02:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:54,887 INFO L225 Difference]: With dead ends: 57290 [2019-09-08 11:02:54,887 INFO L226 Difference]: Without dead ends: 38110 [2019-09-08 11:02:54,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38110 states. [2019-09-08 11:02:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38110 to 38108. [2019-09-08 11:02:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38108 states. [2019-09-08 11:02:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38108 states to 38108 states and 59023 transitions. [2019-09-08 11:02:57,334 INFO L78 Accepts]: Start accepts. Automaton has 38108 states and 59023 transitions. Word has length 86 [2019-09-08 11:02:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:57,335 INFO L475 AbstractCegarLoop]: Abstraction has 38108 states and 59023 transitions. [2019-09-08 11:02:57,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 38108 states and 59023 transitions. [2019-09-08 11:02:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:02:57,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:57,352 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] [2019-09-08 11:02:57,353 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1584577227, now seen corresponding path program 1 times [2019-09-08 11:02:57,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:57,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:57,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:57,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:57,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:57,464 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 11:02:57,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:57,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:57,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:57,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:57,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:57,465 INFO L87 Difference]: Start difference. First operand 38108 states and 59023 transitions. Second operand 5 states. [2019-09-08 11:02:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:59,653 INFO L93 Difference]: Finished difference Result 71294 states and 109864 transitions. [2019-09-08 11:02:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:02:59,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:02:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:59,840 INFO L225 Difference]: With dead ends: 71294 [2019-09-08 11:02:59,840 INFO L226 Difference]: Without dead ends: 71292 [2019-09-08 11:02:59,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:02:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71292 states. [2019-09-08 11:03:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71292 to 38588. [2019-09-08 11:03:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38588 states. [2019-09-08 11:03:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38588 states to 38588 states and 59503 transitions. [2019-09-08 11:03:01,617 INFO L78 Accepts]: Start accepts. Automaton has 38588 states and 59503 transitions. Word has length 87 [2019-09-08 11:03:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:01,618 INFO L475 AbstractCegarLoop]: Abstraction has 38588 states and 59503 transitions. [2019-09-08 11:03:01,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:03:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 38588 states and 59503 transitions. [2019-09-08 11:03:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:03:01,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:01,628 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] [2019-09-08 11:03:01,628 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:01,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2139259668, now seen corresponding path program 1 times [2019-09-08 11:03:01,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:01,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:01,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:01,877 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 11:03:01,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:01,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:03:01,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:03:01,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:03:01,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:03:01,879 INFO L87 Difference]: Start difference. First operand 38588 states and 59503 transitions. Second operand 10 states. [2019-09-08 11:03:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:18,136 INFO L93 Difference]: Finished difference Result 331990 states and 512077 transitions. [2019-09-08 11:03:18,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 11:03:18,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:03:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:18,766 INFO L225 Difference]: With dead ends: 331990 [2019-09-08 11:03:18,766 INFO L226 Difference]: Without dead ends: 302932 [2019-09-08 11:03:18,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:03:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302932 states. [2019-09-08 11:03:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302932 to 38823. [2019-09-08 11:03:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38823 states. [2019-09-08 11:03:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38823 states to 38823 states and 59800 transitions. [2019-09-08 11:03:23,067 INFO L78 Accepts]: Start accepts. Automaton has 38823 states and 59800 transitions. Word has length 88 [2019-09-08 11:03:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:23,067 INFO L475 AbstractCegarLoop]: Abstraction has 38823 states and 59800 transitions. [2019-09-08 11:03:23,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:03:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38823 states and 59800 transitions. [2019-09-08 11:03:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:03:23,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:23,079 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] [2019-09-08 11:03:23,080 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1011869172, now seen corresponding path program 1 times [2019-09-08 11:03:23,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:23,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:23,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:23,338 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 11:03:23,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:23,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:03:23,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:03:23,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:03:23,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:03:23,340 INFO L87 Difference]: Start difference. First operand 38823 states and 59800 transitions. Second operand 10 states. [2019-09-08 11:03:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:37,727 INFO L93 Difference]: Finished difference Result 205210 states and 314597 transitions. [2019-09-08 11:03:37,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:03:37,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:03:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:38,044 INFO L225 Difference]: With dead ends: 205210 [2019-09-08 11:03:38,044 INFO L226 Difference]: Without dead ends: 200774 [2019-09-08 11:03:38,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:03:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200774 states. [2019-09-08 11:03:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200774 to 38823. [2019-09-08 11:03:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38823 states. [2019-09-08 11:03:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38823 states to 38823 states and 59798 transitions. [2019-09-08 11:03:41,534 INFO L78 Accepts]: Start accepts. Automaton has 38823 states and 59798 transitions. Word has length 88 [2019-09-08 11:03:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:41,535 INFO L475 AbstractCegarLoop]: Abstraction has 38823 states and 59798 transitions. [2019-09-08 11:03:41,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:03:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 38823 states and 59798 transitions. [2019-09-08 11:03:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:03:41,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:41,544 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] [2019-09-08 11:03:41,545 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1484118612, now seen corresponding path program 1 times [2019-09-08 11:03:41,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:41,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:41,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:41,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:41,785 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 11:03:41,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:41,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:03:41,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:03:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:03:41,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:03:41,787 INFO L87 Difference]: Start difference. First operand 38823 states and 59798 transitions. Second operand 10 states. [2019-09-08 11:03:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:52,642 INFO L93 Difference]: Finished difference Result 125543 states and 191106 transitions. [2019-09-08 11:03:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:03:52,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:03:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:52,778 INFO L225 Difference]: With dead ends: 125543 [2019-09-08 11:03:52,778 INFO L226 Difference]: Without dead ends: 112917 [2019-09-08 11:03:52,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:03:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112917 states. [2019-09-08 11:03:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112917 to 39471. [2019-09-08 11:03:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39471 states. [2019-09-08 11:03:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39471 states to 39471 states and 60738 transitions. [2019-09-08 11:03:56,298 INFO L78 Accepts]: Start accepts. Automaton has 39471 states and 60738 transitions. Word has length 88 [2019-09-08 11:03:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:56,298 INFO L475 AbstractCegarLoop]: Abstraction has 39471 states and 60738 transitions. [2019-09-08 11:03:56,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:03:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39471 states and 60738 transitions. [2019-09-08 11:03:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:03:56,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:56,308 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] [2019-09-08 11:03:56,309 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:56,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1369706164, now seen corresponding path program 1 times [2019-09-08 11:03:56,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:56,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:56,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:56,515 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 11:03:56,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:56,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:03:56,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:03:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:03:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:03:56,517 INFO L87 Difference]: Start difference. First operand 39471 states and 60738 transitions. Second operand 10 states. [2019-09-08 11:04:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:21,614 INFO L93 Difference]: Finished difference Result 266937 states and 408171 transitions. [2019-09-08 11:04:21,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:04:21,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:04:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:21,977 INFO L225 Difference]: With dead ends: 266937 [2019-09-08 11:04:21,978 INFO L226 Difference]: Without dead ends: 246347 [2019-09-08 11:04:22,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:04:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246347 states. [2019-09-08 11:04:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246347 to 40219. [2019-09-08 11:04:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40219 states. [2019-09-08 11:04:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40219 states to 40219 states and 61719 transitions. [2019-09-08 11:04:27,573 INFO L78 Accepts]: Start accepts. Automaton has 40219 states and 61719 transitions. Word has length 88 [2019-09-08 11:04:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:27,573 INFO L475 AbstractCegarLoop]: Abstraction has 40219 states and 61719 transitions. [2019-09-08 11:04:27,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:04:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40219 states and 61719 transitions. [2019-09-08 11:04:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:04:27,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:27,583 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] [2019-09-08 11:04:27,583 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash -28915572, now seen corresponding path program 1 times [2019-09-08 11:04:27,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:27,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:27,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:27,780 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 11:04:27,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:27,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:04:27,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:04:27,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:04:27,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:04:27,782 INFO L87 Difference]: Start difference. First operand 40219 states and 61719 transitions. Second operand 10 states. [2019-09-08 11:04:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:57,075 INFO L93 Difference]: Finished difference Result 286636 states and 437235 transitions. [2019-09-08 11:04:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:04:57,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:04:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:57,450 INFO L225 Difference]: With dead ends: 286636 [2019-09-08 11:04:57,451 INFO L226 Difference]: Without dead ends: 248482 [2019-09-08 11:04:57,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:04:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248482 states. [2019-09-08 11:05:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248482 to 40578. [2019-09-08 11:05:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40578 states. [2019-09-08 11:05:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 62130 transitions. [2019-09-08 11:05:03,603 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 62130 transitions. Word has length 88 [2019-09-08 11:05:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:03,604 INFO L475 AbstractCegarLoop]: Abstraction has 40578 states and 62130 transitions. [2019-09-08 11:05:03,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:05:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 62130 transitions. [2019-09-08 11:05:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:05:03,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:03,612 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] [2019-09-08 11:05:03,613 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash -849303856, now seen corresponding path program 1 times [2019-09-08 11:05:03,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:03,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:03,666 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 11:05:03,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:03,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:03,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:03,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:03,668 INFO L87 Difference]: Start difference. First operand 40578 states and 62130 transitions. Second operand 3 states. [2019-09-08 11:05:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:10,253 INFO L93 Difference]: Finished difference Result 75134 states and 115376 transitions. [2019-09-08 11:05:10,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:10,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:05:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:10,311 INFO L225 Difference]: With dead ends: 75134 [2019-09-08 11:05:10,311 INFO L226 Difference]: Without dead ends: 50464 [2019-09-08 11:05:10,334 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 11:05:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50464 states. [2019-09-08 11:05:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50464 to 50078. [2019-09-08 11:05:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50078 states. [2019-09-08 11:05:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50078 states to 50078 states and 75907 transitions. [2019-09-08 11:05:16,036 INFO L78 Accepts]: Start accepts. Automaton has 50078 states and 75907 transitions. Word has length 89 [2019-09-08 11:05:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:16,037 INFO L475 AbstractCegarLoop]: Abstraction has 50078 states and 75907 transitions. [2019-09-08 11:05:16,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states and 75907 transitions. [2019-09-08 11:05:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:05:16,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:16,047 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] [2019-09-08 11:05:16,047 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1873505628, now seen corresponding path program 1 times [2019-09-08 11:05:16,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:16,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:16,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:16,158 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 11:05:16,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:16,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:05:16,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:05:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:05:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:05:16,160 INFO L87 Difference]: Start difference. First operand 50078 states and 75907 transitions. Second operand 4 states. [2019-09-08 11:05:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:27,130 INFO L93 Difference]: Finished difference Result 138342 states and 209701 transitions. [2019-09-08 11:05:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:05:28,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 11:05:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:28,880 INFO L225 Difference]: With dead ends: 138342 [2019-09-08 11:05:28,880 INFO L226 Difference]: Without dead ends: 91476 [2019-09-08 11:05:28,916 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 11:05:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91476 states. [2019-09-08 11:05:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91476 to 90874. [2019-09-08 11:05:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90874 states. [2019-09-08 11:05:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90874 states to 90874 states and 136635 transitions. [2019-09-08 11:05:39,608 INFO L78 Accepts]: Start accepts. Automaton has 90874 states and 136635 transitions. Word has length 89 [2019-09-08 11:05:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:39,608 INFO L475 AbstractCegarLoop]: Abstraction has 90874 states and 136635 transitions. [2019-09-08 11:05:39,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:05:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 90874 states and 136635 transitions. [2019-09-08 11:05:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:05:39,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:39,617 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] [2019-09-08 11:05:39,617 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash 354142704, now seen corresponding path program 1 times [2019-09-08 11:05:39,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:39,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:39,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:39,669 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 11:05:39,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:39,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:39,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:39,671 INFO L87 Difference]: Start difference. First operand 90874 states and 136635 transitions. Second operand 3 states. [2019-09-08 11:06:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:01,635 INFO L93 Difference]: Finished difference Result 238214 states and 358896 transitions. [2019-09-08 11:06:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:01,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:06:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:01,836 INFO L225 Difference]: With dead ends: 238214 [2019-09-08 11:06:01,837 INFO L226 Difference]: Without dead ends: 158805 [2019-09-08 11:06:01,894 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 11:06:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158805 states. [2019-09-08 11:06:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158805 to 158539. [2019-09-08 11:06:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158539 states. [2019-09-08 11:06:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158539 states to 158539 states and 237305 transitions. [2019-09-08 11:06:23,797 INFO L78 Accepts]: Start accepts. Automaton has 158539 states and 237305 transitions. Word has length 89 [2019-09-08 11:06:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:23,797 INFO L475 AbstractCegarLoop]: Abstraction has 158539 states and 237305 transitions. [2019-09-08 11:06:23,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 158539 states and 237305 transitions. [2019-09-08 11:06:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:06:23,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:23,809 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] [2019-09-08 11:06:23,809 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:23,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1105953187, now seen corresponding path program 1 times [2019-09-08 11:06:23,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:23,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:23,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:23,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:23,858 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 11:06:23,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:23,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:23,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:23,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:23,860 INFO L87 Difference]: Start difference. First operand 158539 states and 237305 transitions. Second operand 3 states. [2019-09-08 11:06:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:48,647 INFO L93 Difference]: Finished difference Result 219329 states and 327515 transitions. [2019-09-08 11:06:48,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:48,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:06:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:48,886 INFO L225 Difference]: With dead ends: 219329 [2019-09-08 11:06:48,886 INFO L226 Difference]: Without dead ends: 174855 [2019-09-08 11:06:48,941 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 11:06:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174855 states. [2019-09-08 11:07:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174855 to 155053. [2019-09-08 11:07:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155053 states. [2019-09-08 11:07:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155053 states to 155053 states and 228609 transitions. [2019-09-08 11:07:10,500 INFO L78 Accepts]: Start accepts. Automaton has 155053 states and 228609 transitions. Word has length 89 [2019-09-08 11:07:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:10,500 INFO L475 AbstractCegarLoop]: Abstraction has 155053 states and 228609 transitions. [2019-09-08 11:07:10,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:07:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 155053 states and 228609 transitions. [2019-09-08 11:07:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:07:10,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:10,512 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] [2019-09-08 11:07:10,513 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1939422446, now seen corresponding path program 1 times [2019-09-08 11:07:10,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:10,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:10,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:10,568 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 11:07:10,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:10,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:07:10,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:07:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:07:10,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:07:10,570 INFO L87 Difference]: Start difference. First operand 155053 states and 228609 transitions. Second operand 3 states. [2019-09-08 11:07:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:35,125 INFO L93 Difference]: Finished difference Result 245184 states and 361138 transitions. [2019-09-08 11:07:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:07:35,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:07:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:35,363 INFO L225 Difference]: With dead ends: 245184 [2019-09-08 11:07:35,363 INFO L226 Difference]: Without dead ends: 165034 [2019-09-08 11:07:35,428 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 11:07:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165034 states. [2019-09-08 11:08:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165034 to 163412. [2019-09-08 11:08:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163412 states. [2019-09-08 11:08:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163412 states to 163412 states and 236566 transitions. [2019-09-08 11:08:01,723 INFO L78 Accepts]: Start accepts. Automaton has 163412 states and 236566 transitions. Word has length 89 [2019-09-08 11:08:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:01,723 INFO L475 AbstractCegarLoop]: Abstraction has 163412 states and 236566 transitions. [2019-09-08 11:08:01,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:08:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 163412 states and 236566 transitions. [2019-09-08 11:08:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:01,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:01,731 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] [2019-09-08 11:08:01,731 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1377715858, now seen corresponding path program 1 times [2019-09-08 11:08:01,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:01,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:01,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:01,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:08:01,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:08:01,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:08:01,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:08:01,790 INFO L87 Difference]: Start difference. First operand 163412 states and 236566 transitions. Second operand 3 states. [2019-09-08 11:08:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:34,919 INFO L93 Difference]: Finished difference Result 369465 states and 534298 transitions. [2019-09-08 11:08:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:08:34,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:08:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:35,221 INFO L225 Difference]: With dead ends: 369465 [2019-09-08 11:08:35,221 INFO L226 Difference]: Without dead ends: 218687 [2019-09-08 11:08:35,319 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 11:08:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218687 states. [2019-09-08 11:09:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218687 to 216925. [2019-09-08 11:09:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216925 states. [2019-09-08 11:09:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216925 states to 216925 states and 309078 transitions. [2019-09-08 11:09:11,719 INFO L78 Accepts]: Start accepts. Automaton has 216925 states and 309078 transitions. Word has length 89 [2019-09-08 11:09:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:11,719 INFO L475 AbstractCegarLoop]: Abstraction has 216925 states and 309078 transitions. [2019-09-08 11:09:11,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:09:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 216925 states and 309078 transitions. [2019-09-08 11:09:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:09:11,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:11,727 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] [2019-09-08 11:09:11,727 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:11,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:11,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2021811832, now seen corresponding path program 1 times [2019-09-08 11:09:11,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:11,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:11,811 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 11:09:11,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:11,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:09:11,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:09:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:09:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:11,812 INFO L87 Difference]: Start difference. First operand 216925 states and 309078 transitions. Second operand 7 states. [2019-09-08 11:11:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:43,184 INFO L93 Difference]: Finished difference Result 972103 states and 1374042 transitions. [2019-09-08 11:11:43,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:11:43,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:11:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:44,606 INFO L225 Difference]: With dead ends: 972103 [2019-09-08 11:11:44,607 INFO L226 Difference]: Without dead ends: 875042 [2019-09-08 11:11:44,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:11:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875042 states. [2019-09-08 11:12:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875042 to 217137. [2019-09-08 11:12:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217137 states. [2019-09-08 11:12:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217137 states to 217137 states and 309333 transitions. [2019-09-08 11:12:31,199 INFO L78 Accepts]: Start accepts. Automaton has 217137 states and 309333 transitions. Word has length 90 [2019-09-08 11:12:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:31,199 INFO L475 AbstractCegarLoop]: Abstraction has 217137 states and 309333 transitions. [2019-09-08 11:12:31,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:12:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 217137 states and 309333 transitions. [2019-09-08 11:12:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:12:31,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:31,206 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] [2019-09-08 11:12:31,206 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1199896505, now seen corresponding path program 1 times [2019-09-08 11:12:31,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:31,815 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 11:12:31,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:31,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:12:31,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:12:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:12:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:12:31,818 INFO L87 Difference]: Start difference. First operand 217137 states and 309333 transitions. Second operand 7 states. [2019-09-08 11:14:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:35,820 INFO L93 Difference]: Finished difference Result 718545 states and 1015747 transitions. [2019-09-08 11:14:35,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:14:35,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:14:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:36,856 INFO L225 Difference]: With dead ends: 718545 [2019-09-08 11:14:36,856 INFO L226 Difference]: Without dead ends: 672517 [2019-09-08 11:14:37,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:14:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672517 states.