java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:04:51,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:04:51,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:04:51,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:04:51,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:04:51,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:04:51,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:04:51,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:04:51,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:04:51,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:04:51,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:04:51,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:04:51,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:04:51,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:04:51,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:04:51,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:04:51,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:04:51,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:04:51,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:04:51,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:04:51,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:04:51,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:04:51,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:04:51,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:04:51,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:04:51,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:04:51,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:04:51,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:04:51,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:04:51,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:04:51,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:04:51,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:04:51,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:04:51,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:04:51,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:04:51,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:04:51,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:04:51,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:04:51,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:04:51,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:04:51,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:04:51,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:04:51,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:04:51,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:04:51,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:04:51,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:04:51,738 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:04:51,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:04:51,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:04:51,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:04:51,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:04:51,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:04:51,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:04:51,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:04:51,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:04:51,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:04:51,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:04:51,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:04:51,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:04:51,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:04:51,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:04:51,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:04:51,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:04:51,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:04:51,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:04:51,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:04:51,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:04:51,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:04:51,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:04:51,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:04:51,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:04:51,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:04:51,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:04:51,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:04:51,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:04:51,820 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:04:51,821 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 13:04:51,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab8b7526/d1a5e366eb254f4ca2520809878478ea/FLAG46202e932 [2019-09-08 13:04:52,498 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:04:52,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 13:04:52,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab8b7526/d1a5e366eb254f4ca2520809878478ea/FLAG46202e932 [2019-09-08 13:04:52,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab8b7526/d1a5e366eb254f4ca2520809878478ea [2019-09-08 13:04:52,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:04:52,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:04:52,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:04:52,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:04:52,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:04:52,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:04:52" (1/1) ... [2019-09-08 13:04:52,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa3d82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:52, skipping insertion in model container [2019-09-08 13:04:52,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:04:52" (1/1) ... [2019-09-08 13:04:52,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:04:52,846 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:04:53,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:04:53,479 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:04:53,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:04:53,979 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:04:53,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53 WrapperNode [2019-09-08 13:04:53,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:04:53,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:04:53,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:04:53,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:04:53,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... [2019-09-08 13:04:53,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... [2019-09-08 13:04:54,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... [2019-09-08 13:04:54,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... [2019-09-08 13:04:54,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... [2019-09-08 13:04:54,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... [2019-09-08 13:04:54,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... [2019-09-08 13:04:54,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:04:54,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:04:54,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:04:54,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:04:54,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:04:54,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:04:54,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:04:54,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:04:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:04:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:04:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:04:54,165 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:04:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:04:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:04:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:04:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:04:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:04:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:04:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:04:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:04:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:04:54,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:04:54,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:04:55,990 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:04:55,991 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:04:55,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:04:55 BoogieIcfgContainer [2019-09-08 13:04:55,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:04:55,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:04:55,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:04:55,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:04:55,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:04:52" (1/3) ... [2019-09-08 13:04:55,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40994e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:04:55, skipping insertion in model container [2019-09-08 13:04:56,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:04:53" (2/3) ... [2019-09-08 13:04:56,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40994e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:04:56, skipping insertion in model container [2019-09-08 13:04:56,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:04:55" (3/3) ... [2019-09-08 13:04:56,002 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 13:04:56,014 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:04:56,024 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-08 13:04:56,043 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-08 13:04:56,088 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:04:56,088 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:04:56,089 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:04:56,089 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:04:56,089 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:04:56,089 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:04:56,089 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:04:56,090 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:04:56,090 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:04:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-09-08 13:04:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 13:04:56,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:56,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:56,174 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -478150771, now seen corresponding path program 1 times [2019-09-08 13:04:56,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:56,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:56,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:56,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:56,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:56,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:56,887 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 3 states. [2019-09-08 13:04:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:57,169 INFO L93 Difference]: Finished difference Result 760 states and 1332 transitions. [2019-09-08 13:04:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:57,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 13:04:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:57,201 INFO L225 Difference]: With dead ends: 760 [2019-09-08 13:04:57,201 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 13:04:57,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 13:04:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-09-08 13:04:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 13:04:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 876 transitions. [2019-09-08 13:04:57,330 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 876 transitions. Word has length 152 [2019-09-08 13:04:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:57,333 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 876 transitions. [2019-09-08 13:04:57,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 876 transitions. [2019-09-08 13:04:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 13:04:57,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:57,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:57,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:57,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash -387743571, now seen corresponding path program 1 times [2019-09-08 13:04:57,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:57,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:57,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:57,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:57,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:57,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:57,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:57,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:57,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:57,597 INFO L87 Difference]: Start difference. First operand 597 states and 876 transitions. Second operand 3 states. [2019-09-08 13:04:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:57,807 INFO L93 Difference]: Finished difference Result 1196 states and 1811 transitions. [2019-09-08 13:04:57,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:57,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 13:04:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:57,824 INFO L225 Difference]: With dead ends: 1196 [2019-09-08 13:04:57,824 INFO L226 Difference]: Without dead ends: 967 [2019-09-08 13:04:57,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-08 13:04:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2019-09-08 13:04:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 13:04:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1440 transitions. [2019-09-08 13:04:57,883 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1440 transitions. Word has length 152 [2019-09-08 13:04:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:57,887 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1440 transitions. [2019-09-08 13:04:57,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1440 transitions. [2019-09-08 13:04:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 13:04:57,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:57,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:57,896 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1841947149, now seen corresponding path program 1 times [2019-09-08 13:04:57,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:57,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:57,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:57,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:57,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:58,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:58,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:58,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:58,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:58,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:58,305 INFO L87 Difference]: Start difference. First operand 965 states and 1440 transitions. Second operand 4 states. [2019-09-08 13:04:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:58,534 INFO L93 Difference]: Finished difference Result 2813 states and 4187 transitions. [2019-09-08 13:04:58,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:58,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-08 13:04:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:58,553 INFO L225 Difference]: With dead ends: 2813 [2019-09-08 13:04:58,553 INFO L226 Difference]: Without dead ends: 1861 [2019-09-08 13:04:58,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2019-09-08 13:04:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1832. [2019-09-08 13:04:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-09-08 13:04:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2716 transitions. [2019-09-08 13:04:58,695 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2716 transitions. Word has length 152 [2019-09-08 13:04:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:58,696 INFO L475 AbstractCegarLoop]: Abstraction has 1832 states and 2716 transitions. [2019-09-08 13:04:58,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2716 transitions. [2019-09-08 13:04:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 13:04:58,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:58,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:58,701 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 966393053, now seen corresponding path program 1 times [2019-09-08 13:04:58,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:58,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:58,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:58,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:58,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:58,842 INFO L87 Difference]: Start difference. First operand 1832 states and 2716 transitions. Second operand 3 states. [2019-09-08 13:04:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:58,979 INFO L93 Difference]: Finished difference Result 5450 states and 8078 transitions. [2019-09-08 13:04:58,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:58,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 13:04:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:59,001 INFO L225 Difference]: With dead ends: 5450 [2019-09-08 13:04:59,001 INFO L226 Difference]: Without dead ends: 3650 [2019-09-08 13:04:59,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2019-09-08 13:04:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 1834. [2019-09-08 13:04:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2019-09-08 13:04:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2718 transitions. [2019-09-08 13:04:59,137 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2718 transitions. Word has length 153 [2019-09-08 13:04:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:59,137 INFO L475 AbstractCegarLoop]: Abstraction has 1834 states and 2718 transitions. [2019-09-08 13:04:59,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2718 transitions. [2019-09-08 13:04:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 13:04:59,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:59,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:59,142 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:59,143 INFO L82 PathProgramCache]: Analyzing trace with hash -617611826, now seen corresponding path program 1 times [2019-09-08 13:04:59,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:59,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:59,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:59,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:59,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:59,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:59,370 INFO L87 Difference]: Start difference. First operand 1834 states and 2718 transitions. Second operand 4 states. [2019-09-08 13:04:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:59,484 INFO L93 Difference]: Finished difference Result 3654 states and 5418 transitions. [2019-09-08 13:04:59,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:59,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-08 13:04:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:59,497 INFO L225 Difference]: With dead ends: 3654 [2019-09-08 13:04:59,497 INFO L226 Difference]: Without dead ends: 1832 [2019-09-08 13:04:59,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-09-08 13:04:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2019-09-08 13:04:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-09-08 13:04:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2714 transitions. [2019-09-08 13:04:59,635 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2714 transitions. Word has length 154 [2019-09-08 13:04:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:59,636 INFO L475 AbstractCegarLoop]: Abstraction has 1832 states and 2714 transitions. [2019-09-08 13:04:59,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2714 transitions. [2019-09-08 13:04:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 13:04:59,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:59,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:59,641 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:59,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1124929589, now seen corresponding path program 1 times [2019-09-08 13:04:59,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:59,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:59,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:59,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:59,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:59,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:59,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:59,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:59,753 INFO L87 Difference]: Start difference. First operand 1832 states and 2714 transitions. Second operand 3 states. [2019-09-08 13:04:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:59,929 INFO L93 Difference]: Finished difference Result 4363 states and 6466 transitions. [2019-09-08 13:04:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:59,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 13:04:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:59,946 INFO L225 Difference]: With dead ends: 4363 [2019-09-08 13:04:59,946 INFO L226 Difference]: Without dead ends: 2728 [2019-09-08 13:04:59,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2019-09-08 13:05:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2699. [2019-09-08 13:05:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2019-09-08 13:05:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3952 transitions. [2019-09-08 13:05:00,115 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3952 transitions. Word has length 154 [2019-09-08 13:05:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:00,116 INFO L475 AbstractCegarLoop]: Abstraction has 2699 states and 3952 transitions. [2019-09-08 13:05:00,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3952 transitions. [2019-09-08 13:05:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 13:05:00,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:00,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:00,123 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash -919857140, now seen corresponding path program 1 times [2019-09-08 13:05:00,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:00,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:00,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:00,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:00,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:00,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:00,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:00,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:00,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:00,221 INFO L87 Difference]: Start difference. First operand 2699 states and 3952 transitions. Second operand 3 states. [2019-09-08 13:05:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:00,465 INFO L93 Difference]: Finished difference Result 6687 states and 9975 transitions. [2019-09-08 13:05:00,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:00,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 13:05:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:00,486 INFO L225 Difference]: With dead ends: 6687 [2019-09-08 13:05:00,486 INFO L226 Difference]: Without dead ends: 4177 [2019-09-08 13:05:00,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2019-09-08 13:05:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 3547. [2019-09-08 13:05:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2019-09-08 13:05:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 5333 transitions. [2019-09-08 13:05:00,678 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 5333 transitions. Word has length 156 [2019-09-08 13:05:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:00,679 INFO L475 AbstractCegarLoop]: Abstraction has 3547 states and 5333 transitions. [2019-09-08 13:05:00,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 5333 transitions. [2019-09-08 13:05:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 13:05:00,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:00,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:00,685 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2146763757, now seen corresponding path program 1 times [2019-09-08 13:05:00,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:00,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:00,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:00,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:00,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:00,780 INFO L87 Difference]: Start difference. First operand 3547 states and 5333 transitions. Second operand 3 states. [2019-09-08 13:05:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:01,084 INFO L93 Difference]: Finished difference Result 8845 states and 13520 transitions. [2019-09-08 13:05:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:01,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 13:05:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:01,113 INFO L225 Difference]: With dead ends: 8845 [2019-09-08 13:05:01,114 INFO L226 Difference]: Without dead ends: 5571 [2019-09-08 13:05:01,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2019-09-08 13:05:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 5055. [2019-09-08 13:05:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2019-09-08 13:05:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 7762 transitions. [2019-09-08 13:05:01,436 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 7762 transitions. Word has length 158 [2019-09-08 13:05:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:01,437 INFO L475 AbstractCegarLoop]: Abstraction has 5055 states and 7762 transitions. [2019-09-08 13:05:01,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 7762 transitions. [2019-09-08 13:05:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:05:01,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:01,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:01,443 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1620082222, now seen corresponding path program 1 times [2019-09-08 13:05:01,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:01,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:01,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:01,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:01,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:01,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:05:01,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:05:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:05:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:01,616 INFO L87 Difference]: Start difference. First operand 5055 states and 7762 transitions. Second operand 5 states. [2019-09-08 13:05:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:02,254 INFO L93 Difference]: Finished difference Result 9929 states and 15294 transitions. [2019-09-08 13:05:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:05:02,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-08 13:05:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:02,279 INFO L225 Difference]: With dead ends: 9929 [2019-09-08 13:05:02,280 INFO L226 Difference]: Without dead ends: 5057 [2019-09-08 13:05:02,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:05:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2019-09-08 13:05:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 5055. [2019-09-08 13:05:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2019-09-08 13:05:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 7727 transitions. [2019-09-08 13:05:02,524 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 7727 transitions. Word has length 159 [2019-09-08 13:05:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:02,524 INFO L475 AbstractCegarLoop]: Abstraction has 5055 states and 7727 transitions. [2019-09-08 13:05:02,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:05:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 7727 transitions. [2019-09-08 13:05:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:05:02,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:02,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:02,530 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1298246967, now seen corresponding path program 1 times [2019-09-08 13:05:02,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:02,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:02,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:02,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:02,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:05:02,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:05:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:05:02,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:05:02,732 INFO L87 Difference]: Start difference. First operand 5055 states and 7727 transitions. Second operand 8 states. [2019-09-08 13:05:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:04,303 INFO L93 Difference]: Finished difference Result 18393 states and 28557 transitions. [2019-09-08 13:05:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:05:04,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-09-08 13:05:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:04,348 INFO L225 Difference]: With dead ends: 18393 [2019-09-08 13:05:04,348 INFO L226 Difference]: Without dead ends: 13560 [2019-09-08 13:05:04,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:05:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2019-09-08 13:05:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 7049. [2019-09-08 13:05:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-09-08 13:05:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 10531 transitions. [2019-09-08 13:05:04,836 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 10531 transitions. Word has length 159 [2019-09-08 13:05:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:04,837 INFO L475 AbstractCegarLoop]: Abstraction has 7049 states and 10531 transitions. [2019-09-08 13:05:04,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:05:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 10531 transitions. [2019-09-08 13:05:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:05:04,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:04,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:04,843 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash 279900072, now seen corresponding path program 1 times [2019-09-08 13:05:04,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:04,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:05,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:05,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:05,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:05,045 INFO L87 Difference]: Start difference. First operand 7049 states and 10531 transitions. Second operand 4 states. [2019-09-08 13:05:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:05,935 INFO L93 Difference]: Finished difference Result 19003 states and 28396 transitions. [2019-09-08 13:05:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:05,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-08 13:05:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:05,965 INFO L225 Difference]: With dead ends: 19003 [2019-09-08 13:05:05,965 INFO L226 Difference]: Without dead ends: 11977 [2019-09-08 13:05:05,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11977 states. [2019-09-08 13:05:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11977 to 11954. [2019-09-08 13:05:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11954 states. [2019-09-08 13:05:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11954 states to 11954 states and 17733 transitions. [2019-09-08 13:05:07,210 INFO L78 Accepts]: Start accepts. Automaton has 11954 states and 17733 transitions. Word has length 159 [2019-09-08 13:05:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:07,210 INFO L475 AbstractCegarLoop]: Abstraction has 11954 states and 17733 transitions. [2019-09-08 13:05:07,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11954 states and 17733 transitions. [2019-09-08 13:05:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:05:07,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:07,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:07,219 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:07,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1716884978, now seen corresponding path program 1 times [2019-09-08 13:05:07,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:07,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:07,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:07,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:07,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:07,329 INFO L87 Difference]: Start difference. First operand 11954 states and 17733 transitions. Second operand 3 states. [2019-09-08 13:05:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:08,336 INFO L93 Difference]: Finished difference Result 34474 states and 51287 transitions. [2019-09-08 13:05:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:08,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 13:05:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:08,391 INFO L225 Difference]: With dead ends: 34474 [2019-09-08 13:05:08,391 INFO L226 Difference]: Without dead ends: 22908 [2019-09-08 13:05:08,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22908 states. [2019-09-08 13:05:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22908 to 22887. [2019-09-08 13:05:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22887 states. [2019-09-08 13:05:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22887 states to 22887 states and 33780 transitions. [2019-09-08 13:05:09,720 INFO L78 Accepts]: Start accepts. Automaton has 22887 states and 33780 transitions. Word has length 161 [2019-09-08 13:05:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:09,721 INFO L475 AbstractCegarLoop]: Abstraction has 22887 states and 33780 transitions. [2019-09-08 13:05:09,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22887 states and 33780 transitions. [2019-09-08 13:05:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:05:09,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:09,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:09,737 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:09,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:09,738 INFO L82 PathProgramCache]: Analyzing trace with hash 452986321, now seen corresponding path program 1 times [2019-09-08 13:05:09,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:09,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:09,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:09,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:09,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:09,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:09,892 INFO L87 Difference]: Start difference. First operand 22887 states and 33780 transitions. Second operand 4 states. [2019-09-08 13:05:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:10,837 INFO L93 Difference]: Finished difference Result 37896 states and 55849 transitions. [2019-09-08 13:05:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:10,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 13:05:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:10,872 INFO L225 Difference]: With dead ends: 37896 [2019-09-08 13:05:10,873 INFO L226 Difference]: Without dead ends: 18327 [2019-09-08 13:05:10,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18327 states. [2019-09-08 13:05:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18327 to 18327. [2019-09-08 13:05:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18327 states. [2019-09-08 13:05:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18327 states to 18327 states and 26933 transitions. [2019-09-08 13:05:12,644 INFO L78 Accepts]: Start accepts. Automaton has 18327 states and 26933 transitions. Word has length 161 [2019-09-08 13:05:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:12,644 INFO L475 AbstractCegarLoop]: Abstraction has 18327 states and 26933 transitions. [2019-09-08 13:05:12,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 18327 states and 26933 transitions. [2019-09-08 13:05:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 13:05:12,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:12,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:12,656 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:12,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash 821169327, now seen corresponding path program 1 times [2019-09-08 13:05:12,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:12,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:12,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:12,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:12,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:12,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:12,744 INFO L87 Difference]: Start difference. First operand 18327 states and 26933 transitions. Second operand 3 states. [2019-09-08 13:05:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:14,103 INFO L93 Difference]: Finished difference Result 49838 states and 74217 transitions. [2019-09-08 13:05:14,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:14,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 13:05:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:14,162 INFO L225 Difference]: With dead ends: 49838 [2019-09-08 13:05:14,163 INFO L226 Difference]: Without dead ends: 31852 [2019-09-08 13:05:14,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31852 states. [2019-09-08 13:05:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31852 to 28563. [2019-09-08 13:05:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28563 states. [2019-09-08 13:05:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28563 states to 28563 states and 43032 transitions. [2019-09-08 13:05:15,654 INFO L78 Accepts]: Start accepts. Automaton has 28563 states and 43032 transitions. Word has length 165 [2019-09-08 13:05:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:15,654 INFO L475 AbstractCegarLoop]: Abstraction has 28563 states and 43032 transitions. [2019-09-08 13:05:15,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28563 states and 43032 transitions. [2019-09-08 13:05:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:05:15,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:15,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:15,665 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:15,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1830039583, now seen corresponding path program 1 times [2019-09-08 13:05:15,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:15,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:15,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:15,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:15,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:05:15,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:05:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:05:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:05:15,853 INFO L87 Difference]: Start difference. First operand 28563 states and 43032 transitions. Second operand 8 states. [2019-09-08 13:05:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:20,978 INFO L93 Difference]: Finished difference Result 105032 states and 158564 transitions. [2019-09-08 13:05:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:05:20,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-09-08 13:05:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:21,097 INFO L225 Difference]: With dead ends: 105032 [2019-09-08 13:05:21,098 INFO L226 Difference]: Without dead ends: 76884 [2019-09-08 13:05:21,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:05:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76884 states. [2019-09-08 13:05:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76884 to 42803. [2019-09-08 13:05:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42803 states. [2019-09-08 13:05:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42803 states to 42803 states and 63524 transitions. [2019-09-08 13:05:23,939 INFO L78 Accepts]: Start accepts. Automaton has 42803 states and 63524 transitions. Word has length 166 [2019-09-08 13:05:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:23,940 INFO L475 AbstractCegarLoop]: Abstraction has 42803 states and 63524 transitions. [2019-09-08 13:05:23,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:05:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 42803 states and 63524 transitions. [2019-09-08 13:05:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:05:23,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:23,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:23,951 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1646449545, now seen corresponding path program 1 times [2019-09-08 13:05:23,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:24,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:24,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:24,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:24,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:24,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:24,158 INFO L87 Difference]: Start difference. First operand 42803 states and 63524 transitions. Second operand 4 states. [2019-09-08 13:05:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:29,046 INFO L93 Difference]: Finished difference Result 119417 states and 176936 transitions. [2019-09-08 13:05:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:29,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 13:05:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:29,163 INFO L225 Difference]: With dead ends: 119417 [2019-09-08 13:05:29,163 INFO L226 Difference]: Without dead ends: 76657 [2019-09-08 13:05:29,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76657 states. [2019-09-08 13:05:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76657 to 76604. [2019-09-08 13:05:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76604 states. [2019-09-08 13:05:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76604 states to 76604 states and 112170 transitions. [2019-09-08 13:05:33,583 INFO L78 Accepts]: Start accepts. Automaton has 76604 states and 112170 transitions. Word has length 166 [2019-09-08 13:05:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:33,583 INFO L475 AbstractCegarLoop]: Abstraction has 76604 states and 112170 transitions. [2019-09-08 13:05:33,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 76604 states and 112170 transitions. [2019-09-08 13:05:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 13:05:33,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:33,598 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:33,599 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash -529993847, now seen corresponding path program 1 times [2019-09-08 13:05:33,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:33,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:33,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:33,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:33,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:33,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:33,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:33,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:33,662 INFO L87 Difference]: Start difference. First operand 76604 states and 112170 transitions. Second operand 3 states. [2019-09-08 13:05:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:42,701 INFO L93 Difference]: Finished difference Result 229610 states and 336253 transitions. [2019-09-08 13:05:42,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:42,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 13:05:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:42,914 INFO L225 Difference]: With dead ends: 229610 [2019-09-08 13:05:42,914 INFO L226 Difference]: Without dead ends: 153116 [2019-09-08 13:05:42,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153116 states. [2019-09-08 13:05:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153116 to 76610. [2019-09-08 13:05:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76610 states. [2019-09-08 13:05:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76610 states to 76610 states and 112176 transitions. [2019-09-08 13:05:50,451 INFO L78 Accepts]: Start accepts. Automaton has 76610 states and 112176 transitions. Word has length 167 [2019-09-08 13:05:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:50,451 INFO L475 AbstractCegarLoop]: Abstraction has 76610 states and 112176 transitions. [2019-09-08 13:05:50,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 76610 states and 112176 transitions. [2019-09-08 13:05:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:05:50,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:50,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:50,467 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:50,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1584516349, now seen corresponding path program 1 times [2019-09-08 13:05:50,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:50,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:50,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:50,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:50,576 INFO L87 Difference]: Start difference. First operand 76610 states and 112176 transitions. Second operand 3 states. [2019-09-08 13:06:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:00,058 INFO L93 Difference]: Finished difference Result 200591 states and 293081 transitions. [2019-09-08 13:06:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:00,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 13:06:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:00,220 INFO L225 Difference]: With dead ends: 200591 [2019-09-08 13:06:00,220 INFO L226 Difference]: Without dead ends: 124740 [2019-09-08 13:06:00,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124740 states. [2019-09-08 13:06:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124740 to 124687. [2019-09-08 13:06:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124687 states. [2019-09-08 13:06:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124687 states to 124687 states and 179961 transitions. [2019-09-08 13:06:09,908 INFO L78 Accepts]: Start accepts. Automaton has 124687 states and 179961 transitions. Word has length 168 [2019-09-08 13:06:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:09,909 INFO L475 AbstractCegarLoop]: Abstraction has 124687 states and 179961 transitions. [2019-09-08 13:06:09,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 124687 states and 179961 transitions. [2019-09-08 13:06:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:06:09,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:09,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:09,926 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2034399520, now seen corresponding path program 1 times [2019-09-08 13:06:09,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:09,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:09,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:09,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:10,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:10,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:10,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:10,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:10,061 INFO L87 Difference]: Start difference. First operand 124687 states and 179961 transitions. Second operand 4 states. [2019-09-08 13:06:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:16,847 INFO L93 Difference]: Finished difference Result 235003 states and 339301 transitions. [2019-09-08 13:06:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:16,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 13:06:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:17,014 INFO L225 Difference]: With dead ends: 235003 [2019-09-08 13:06:17,014 INFO L226 Difference]: Without dead ends: 110999 [2019-09-08 13:06:17,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110999 states. [2019-09-08 13:06:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110999 to 110999. [2019-09-08 13:06:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110999 states. [2019-09-08 13:06:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110999 states to 110999 states and 160114 transitions. [2019-09-08 13:06:27,731 INFO L78 Accepts]: Start accepts. Automaton has 110999 states and 160114 transitions. Word has length 168 [2019-09-08 13:06:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:27,731 INFO L475 AbstractCegarLoop]: Abstraction has 110999 states and 160114 transitions. [2019-09-08 13:06:27,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110999 states and 160114 transitions. [2019-09-08 13:06:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:06:27,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:27,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:27,748 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1408902959, now seen corresponding path program 1 times [2019-09-08 13:06:27,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:27,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:27,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:27,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:27,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:27,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:27,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:27,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:27,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:27,871 INFO L87 Difference]: Start difference. First operand 110999 states and 160114 transitions. Second operand 4 states. [2019-09-08 13:06:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:40,992 INFO L93 Difference]: Finished difference Result 299742 states and 440277 transitions. [2019-09-08 13:06:40,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:40,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 13:06:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:41,302 INFO L225 Difference]: With dead ends: 299742 [2019-09-08 13:06:41,302 INFO L226 Difference]: Without dead ends: 202018 [2019-09-08 13:06:41,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202018 states. [2019-09-08 13:06:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202018 to 107895. [2019-09-08 13:06:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107895 states. [2019-09-08 13:06:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107895 states to 107895 states and 156274 transitions. [2019-09-08 13:06:54,091 INFO L78 Accepts]: Start accepts. Automaton has 107895 states and 156274 transitions. Word has length 173 [2019-09-08 13:06:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:54,091 INFO L475 AbstractCegarLoop]: Abstraction has 107895 states and 156274 transitions. [2019-09-08 13:06:54,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 107895 states and 156274 transitions. [2019-09-08 13:06:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:06:54,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:54,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:54,107 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:54,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1937689959, now seen corresponding path program 1 times [2019-09-08 13:06:54,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:54,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:54,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:06:54,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:06:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:06:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:06:54,313 INFO L87 Difference]: Start difference. First operand 107895 states and 156274 transitions. Second operand 8 states. [2019-09-08 13:07:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:16,848 INFO L93 Difference]: Finished difference Result 379533 states and 549782 transitions. [2019-09-08 13:07:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:07:16,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-09-08 13:07:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:17,317 INFO L225 Difference]: With dead ends: 379533 [2019-09-08 13:07:17,317 INFO L226 Difference]: Without dead ends: 281895 [2019-09-08 13:07:17,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:07:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281895 states. [2019-09-08 13:07:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281895 to 128073. [2019-09-08 13:07:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128073 states. [2019-09-08 13:07:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128073 states to 128073 states and 184758 transitions. [2019-09-08 13:07:34,307 INFO L78 Accepts]: Start accepts. Automaton has 128073 states and 184758 transitions. Word has length 173 [2019-09-08 13:07:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:34,307 INFO L475 AbstractCegarLoop]: Abstraction has 128073 states and 184758 transitions. [2019-09-08 13:07:34,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:07:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 128073 states and 184758 transitions. [2019-09-08 13:07:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:07:34,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:34,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:34,322 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:34,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:34,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1243574581, now seen corresponding path program 1 times [2019-09-08 13:07:34,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:34,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:34,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:34,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:34,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:34,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:34,560 INFO L87 Difference]: Start difference. First operand 128073 states and 184758 transitions. Second operand 4 states. [2019-09-08 13:07:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:44,818 INFO L93 Difference]: Finished difference Result 247032 states and 356409 transitions. [2019-09-08 13:07:44,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:44,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 13:07:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:44,984 INFO L225 Difference]: With dead ends: 247032 [2019-09-08 13:07:44,984 INFO L226 Difference]: Without dead ends: 119265 [2019-09-08 13:07:45,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119265 states. [2019-09-08 13:07:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119265 to 119204. [2019-09-08 13:07:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119204 states. [2019-09-08 13:07:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119204 states to 119204 states and 171929 transitions. [2019-09-08 13:07:58,484 INFO L78 Accepts]: Start accepts. Automaton has 119204 states and 171929 transitions. Word has length 173 [2019-09-08 13:07:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:58,484 INFO L475 AbstractCegarLoop]: Abstraction has 119204 states and 171929 transitions. [2019-09-08 13:07:58,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 119204 states and 171929 transitions. [2019-09-08 13:07:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:07:58,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:58,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:58,498 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash 344016333, now seen corresponding path program 1 times [2019-09-08 13:07:58,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:58,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:58,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:58,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:58,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:58,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:58,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:58,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:58,691 INFO L87 Difference]: Start difference. First operand 119204 states and 171929 transitions. Second operand 4 states. [2019-09-08 13:08:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:09,640 INFO L93 Difference]: Finished difference Result 238463 states and 343906 transitions. [2019-09-08 13:08:09,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:09,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:08:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:09,798 INFO L225 Difference]: With dead ends: 238463 [2019-09-08 13:08:09,798 INFO L226 Difference]: Without dead ends: 119420 [2019-09-08 13:08:09,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119420 states. [2019-09-08 13:08:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119420 to 119307. [2019-09-08 13:08:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119307 states. [2019-09-08 13:08:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119307 states to 119307 states and 172030 transitions. [2019-09-08 13:08:23,703 INFO L78 Accepts]: Start accepts. Automaton has 119307 states and 172030 transitions. Word has length 175 [2019-09-08 13:08:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:23,704 INFO L475 AbstractCegarLoop]: Abstraction has 119307 states and 172030 transitions. [2019-09-08 13:08:23,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 119307 states and 172030 transitions. [2019-09-08 13:08:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 13:08:23,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:23,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:23,717 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:23,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1708861749, now seen corresponding path program 1 times [2019-09-08 13:08:23,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:23,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:23,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:23,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:23,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:23,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:23,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:23,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:23,800 INFO L87 Difference]: Start difference. First operand 119307 states and 172030 transitions. Second operand 3 states. [2019-09-08 13:08:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:44,799 INFO L93 Difference]: Finished difference Result 333270 states and 480540 transitions. [2019-09-08 13:08:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:44,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 13:08:44,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:45,139 INFO L225 Difference]: With dead ends: 333270 [2019-09-08 13:08:45,139 INFO L226 Difference]: Without dead ends: 238400 [2019-09-08 13:08:45,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238400 states. [2019-09-08 13:09:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238400 to 119317. [2019-09-08 13:09:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119317 states. [2019-09-08 13:09:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119317 states to 119317 states and 172040 transitions. [2019-09-08 13:09:01,794 INFO L78 Accepts]: Start accepts. Automaton has 119317 states and 172040 transitions. Word has length 176 [2019-09-08 13:09:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:01,794 INFO L475 AbstractCegarLoop]: Abstraction has 119317 states and 172040 transitions. [2019-09-08 13:09:01,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119317 states and 172040 transitions. [2019-09-08 13:09:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 13:09:01,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:01,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:01,809 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1041476003, now seen corresponding path program 1 times [2019-09-08 13:09:01,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:01,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:01,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:01,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:01,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:02,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:02,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:02,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:02,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:02,016 INFO L87 Difference]: Start difference. First operand 119317 states and 172040 transitions. Second operand 4 states. [2019-09-08 13:09:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:13,459 INFO L93 Difference]: Finished difference Result 238819 states and 344262 transitions. [2019-09-08 13:09:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:13,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-08 13:09:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:13,619 INFO L225 Difference]: With dead ends: 238819 [2019-09-08 13:09:13,619 INFO L226 Difference]: Without dead ends: 119776 [2019-09-08 13:09:13,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119776 states. [2019-09-08 13:09:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119776 to 119568. [2019-09-08 13:09:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119568 states. [2019-09-08 13:09:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119568 states to 119568 states and 172291 transitions. [2019-09-08 13:09:29,135 INFO L78 Accepts]: Start accepts. Automaton has 119568 states and 172291 transitions. Word has length 177 [2019-09-08 13:09:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:29,135 INFO L475 AbstractCegarLoop]: Abstraction has 119568 states and 172291 transitions. [2019-09-08 13:09:29,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 119568 states and 172291 transitions. [2019-09-08 13:09:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 13:09:29,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:29,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:29,150 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1557353132, now seen corresponding path program 1 times [2019-09-08 13:09:29,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:29,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:29,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:29,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:29,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:29,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:29,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:29,290 INFO L87 Difference]: Start difference. First operand 119568 states and 172291 transitions. Second operand 4 states. [2019-09-08 13:09:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:39,165 INFO L93 Difference]: Finished difference Result 180758 states and 260222 transitions. [2019-09-08 13:09:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:39,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-08 13:09:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:39,321 INFO L225 Difference]: With dead ends: 180758 [2019-09-08 13:09:39,321 INFO L226 Difference]: Without dead ends: 108066 [2019-09-08 13:09:39,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108066 states. [2019-09-08 13:09:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108066 to 108066. [2019-09-08 13:09:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108066 states. [2019-09-08 13:09:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108066 states to 108066 states and 155735 transitions. [2019-09-08 13:09:50,031 INFO L78 Accepts]: Start accepts. Automaton has 108066 states and 155735 transitions. Word has length 177 [2019-09-08 13:09:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:50,031 INFO L475 AbstractCegarLoop]: Abstraction has 108066 states and 155735 transitions. [2019-09-08 13:09:50,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 108066 states and 155735 transitions. [2019-09-08 13:09:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:09:50,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:50,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:50,043 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1730932559, now seen corresponding path program 1 times [2019-09-08 13:09:50,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:50,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:50,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:50,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:50,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:50,168 INFO L87 Difference]: Start difference. First operand 108066 states and 155735 transitions. Second operand 4 states. [2019-09-08 13:10:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:11,952 INFO L93 Difference]: Finished difference Result 313130 states and 453919 transitions. [2019-09-08 13:10:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:11,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:10:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:12,273 INFO L225 Difference]: With dead ends: 313130 [2019-09-08 13:10:12,273 INFO L226 Difference]: Without dead ends: 213533 [2019-09-08 13:10:12,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:10:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213533 states. [2019-09-08 13:10:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213533 to 113080. [2019-09-08 13:10:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113080 states. [2019-09-08 13:10:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113080 states to 113080 states and 161607 transitions. [2019-09-08 13:10:24,580 INFO L78 Accepts]: Start accepts. Automaton has 113080 states and 161607 transitions. Word has length 179 [2019-09-08 13:10:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:24,580 INFO L475 AbstractCegarLoop]: Abstraction has 113080 states and 161607 transitions. [2019-09-08 13:10:24,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 113080 states and 161607 transitions. [2019-09-08 13:10:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:10:24,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:24,598 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:10:24,598 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 491868976, now seen corresponding path program 1 times [2019-09-08 13:10:24,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:24,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:24,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:10:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:24,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:10:24,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:10:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:10:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:10:24,802 INFO L87 Difference]: Start difference. First operand 113080 states and 161607 transitions. Second operand 8 states. [2019-09-08 13:10:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:53,944 INFO L93 Difference]: Finished difference Result 328347 states and 471502 transitions. [2019-09-08 13:10:53,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:10:53,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-08 13:10:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:54,653 INFO L225 Difference]: With dead ends: 328347 [2019-09-08 13:10:54,653 INFO L226 Difference]: Without dead ends: 258830 [2019-09-08 13:10:54,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:10:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258830 states. [2019-09-08 13:11:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258830 to 127164. [2019-09-08 13:11:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127164 states. [2019-09-08 13:11:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127164 states to 127164 states and 182649 transitions. [2019-09-08 13:11:09,138 INFO L78 Accepts]: Start accepts. Automaton has 127164 states and 182649 transitions. Word has length 179 [2019-09-08 13:11:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:09,138 INFO L475 AbstractCegarLoop]: Abstraction has 127164 states and 182649 transitions. [2019-09-08 13:11:09,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:11:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 127164 states and 182649 transitions. [2019-09-08 13:11:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:11:09,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:09,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:11:09,156 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash 856301933, now seen corresponding path program 1 times [2019-09-08 13:11:09,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:09,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:09,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:09,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:09,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:11:11,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:11,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 13:11:11,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 13:11:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 13:11:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-09-08 13:11:11,335 INFO L87 Difference]: Start difference. First operand 127164 states and 182649 transitions. Second operand 22 states. [2019-09-08 13:11:12,070 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 13:11:12,234 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 13:11:12,477 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-08 13:11:12,686 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-08 13:11:12,920 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-08 13:11:13,106 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-08 13:11:13,280 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 13:11:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:41,899 INFO L93 Difference]: Finished difference Result 321375 states and 468635 transitions. [2019-09-08 13:11:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 13:11:41,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2019-09-08 13:11:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:42,226 INFO L225 Difference]: With dead ends: 321375 [2019-09-08 13:11:42,226 INFO L226 Difference]: Without dead ends: 214625 [2019-09-08 13:11:42,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 13:11:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214625 states. [2019-09-08 13:12:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214625 to 210231. [2019-09-08 13:12:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210231 states. [2019-09-08 13:12:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210231 states to 210231 states and 304555 transitions. [2019-09-08 13:12:10,295 INFO L78 Accepts]: Start accepts. Automaton has 210231 states and 304555 transitions. Word has length 179 [2019-09-08 13:12:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:10,296 INFO L475 AbstractCegarLoop]: Abstraction has 210231 states and 304555 transitions. [2019-09-08 13:12:10,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 13:12:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 210231 states and 304555 transitions. [2019-09-08 13:12:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:12:10,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:10,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:12:10,322 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:10,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash -575494194, now seen corresponding path program 1 times [2019-09-08 13:12:10,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:10,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:12:10,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:10,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:12:10,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:12:10,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:12:10,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:12:10,435 INFO L87 Difference]: Start difference. First operand 210231 states and 304555 transitions. Second operand 4 states. [2019-09-08 13:12:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:54,385 INFO L93 Difference]: Finished difference Result 579456 states and 854481 transitions. [2019-09-08 13:12:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:12:54,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:12:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:55,025 INFO L225 Difference]: With dead ends: 579456 [2019-09-08 13:12:55,025 INFO L226 Difference]: Without dead ends: 390593 [2019-09-08 13:12:55,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:12:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390593 states. [2019-09-08 13:13:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390593 to 207139. [2019-09-08 13:13:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207139 states. [2019-09-08 13:13:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207139 states to 207139 states and 300946 transitions. [2019-09-08 13:13:26,933 INFO L78 Accepts]: Start accepts. Automaton has 207139 states and 300946 transitions. Word has length 179 [2019-09-08 13:13:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:26,934 INFO L475 AbstractCegarLoop]: Abstraction has 207139 states and 300946 transitions. [2019-09-08 13:13:26,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:13:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 207139 states and 300946 transitions. [2019-09-08 13:13:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:13:27,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:27,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:13:27,574 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash -252059593, now seen corresponding path program 1 times [2019-09-08 13:13:27,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:27,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:27,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:27,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:13:27,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:27,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:13:27,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:13:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:13:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:13:27,736 INFO L87 Difference]: Start difference. First operand 207139 states and 300946 transitions. Second operand 8 states. [2019-09-08 13:14:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:30,548 INFO L93 Difference]: Finished difference Result 609221 states and 885070 transitions. [2019-09-08 13:14:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:14:30,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-08 13:14:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:31,381 INFO L225 Difference]: With dead ends: 609221 [2019-09-08 13:14:31,381 INFO L226 Difference]: Without dead ends: 475187 [2019-09-08 13:14:31,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:14:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475187 states. [2019-09-08 13:15:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475187 to 242041. [2019-09-08 13:15:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242041 states. [2019-09-08 13:15:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242041 states to 242041 states and 352293 transitions. [2019-09-08 13:15:01,975 INFO L78 Accepts]: Start accepts. Automaton has 242041 states and 352293 transitions. Word has length 179 [2019-09-08 13:15:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:01,975 INFO L475 AbstractCegarLoop]: Abstraction has 242041 states and 352293 transitions. [2019-09-08 13:15:01,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:15:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 242041 states and 352293 transitions. [2019-09-08 13:15:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:15:01,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:01,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:15:01,998 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash 142326025, now seen corresponding path program 1 times [2019-09-08 13:15:01,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:01,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:02,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:02,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:02,694 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-09-08 13:15:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:03,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:03,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 13:15:03,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 13:15:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 13:15:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:15:03,683 INFO L87 Difference]: Start difference. First operand 242041 states and 352293 transitions. Second operand 21 states. [2019-09-08 13:15:04,859 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 13:15:05,024 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-08 13:15:05,435 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 13:15:05,639 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 13:15:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:49,980 INFO L93 Difference]: Finished difference Result 411338 states and 598945 transitions. [2019-09-08 13:15:49,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 13:15:49,980 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-09-08 13:15:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:50,476 INFO L225 Difference]: With dead ends: 411338 [2019-09-08 13:15:50,476 INFO L226 Difference]: Without dead ends: 296697 [2019-09-08 13:15:50,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 13:15:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296697 states. [2019-09-08 13:16:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296697 to 244572. [2019-09-08 13:16:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244572 states. [2019-09-08 13:16:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244572 states to 244572 states and 355204 transitions. [2019-09-08 13:16:20,631 INFO L78 Accepts]: Start accepts. Automaton has 244572 states and 355204 transitions. Word has length 179 [2019-09-08 13:16:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:20,632 INFO L475 AbstractCegarLoop]: Abstraction has 244572 states and 355204 transitions. [2019-09-08 13:16:20,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 13:16:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 244572 states and 355204 transitions. [2019-09-08 13:16:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:16:20,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:20,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:16:20,656 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash 35191408, now seen corresponding path program 1 times [2019-09-08 13:16:20,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:20,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:20,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:16:20,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:20,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:16:20,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:16:20,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:16:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:20,733 INFO L87 Difference]: Start difference. First operand 244572 states and 355204 transitions. Second operand 3 states. [2019-09-08 13:16:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:55,486 INFO L93 Difference]: Finished difference Result 418400 states and 608543 transitions. [2019-09-08 13:16:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:16:55,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 13:16:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:55,865 INFO L225 Difference]: With dead ends: 418400 [2019-09-08 13:16:55,866 INFO L226 Difference]: Without dead ends: 243505 [2019-09-08 13:16:55,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243505 states.