java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:18:41,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:18:41,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:18:41,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:18:41,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:18:41,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:18:41,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:18:41,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:18:41,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:18:41,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:18:41,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:18:41,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:18:41,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:18:41,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:18:41,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:18:41,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:18:41,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:18:41,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:18:41,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:18:41,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:18:41,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:18:41,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:18:41,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:18:41,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:18:41,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:18:41,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:18:41,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:18:41,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:18:41,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:18:41,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:18:41,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:18:41,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:18:41,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:18:41,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:18:41,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:18:41,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:18:41,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:18:41,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:18:41,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:18:41,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:18:41,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:18:41,088 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:18:41,102 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:18:41,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:18:41,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:18:41,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:18:41,105 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:18:41,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:18:41,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:18:41,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:18:41,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:18:41,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:18:41,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:18:41,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:18:41,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:18:41,106 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:18:41,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:18:41,107 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:18:41,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:18:41,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:18:41,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:18:41,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:18:41,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:18:41,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:18:41,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:18:41,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:18:41,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:18:41,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:18:41,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:18:41,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:18:41,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:18:41,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:18:41,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:18:41,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:18:41,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:18:41,157 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:18:41,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:18:41,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc8ae41f/9c93fa40fd3549e296207d1afa0442d1/FLAG0697f4306 [2019-09-08 13:18:41,888 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:18:41,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:18:41,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc8ae41f/9c93fa40fd3549e296207d1afa0442d1/FLAG0697f4306 [2019-09-08 13:18:42,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc8ae41f/9c93fa40fd3549e296207d1afa0442d1 [2019-09-08 13:18:42,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:18:42,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:18:42,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:42,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:18:42,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:18:42,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:42" (1/1) ... [2019-09-08 13:18:42,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fae0dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:42, skipping insertion in model container [2019-09-08 13:18:42,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:42" (1/1) ... [2019-09-08 13:18:42,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:18:42,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:18:42,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:42,708 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:18:43,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:43,089 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:18:43,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43 WrapperNode [2019-09-08 13:18:43,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:43,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:18:43,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:18:43,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:18:43,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:18:43,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:18:43,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:18:43,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:18:43,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:18:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:18:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:18:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:18:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:18:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:18:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:18:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:18:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:18:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:18:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:18:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:18:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:18:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:18:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:18:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:18:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:18:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:18:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:18:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:18:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:18:44,709 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:18:44,709 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:18:44,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:44 BoogieIcfgContainer [2019-09-08 13:18:44,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:18:44,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:18:44,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:18:44,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:18:44,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:18:42" (1/3) ... [2019-09-08 13:18:44,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f45603f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:44, skipping insertion in model container [2019-09-08 13:18:44,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43" (2/3) ... [2019-09-08 13:18:44,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f45603f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:44, skipping insertion in model container [2019-09-08 13:18:44,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:44" (3/3) ... [2019-09-08 13:18:44,723 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:18:44,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:18:44,757 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:18:44,775 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:18:44,823 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:18:44,824 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:18:44,824 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:18:44,825 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:18:44,825 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:18:44,825 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:18:44,825 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:18:44,825 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:18:44,826 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:18:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states. [2019-09-08 13:18:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:18:44,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:44,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:44,880 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash -173501281, now seen corresponding path program 1 times [2019-09-08 13:18:44,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:44,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:44,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:45,552 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:18:45,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:45,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:45,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:45,578 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 3 states. [2019-09-08 13:18:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:45,765 INFO L93 Difference]: Finished difference Result 659 states and 1131 transitions. [2019-09-08 13:18:45,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:45,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 13:18:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:45,797 INFO L225 Difference]: With dead ends: 659 [2019-09-08 13:18:45,797 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 13:18:45,804 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:18:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 13:18:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2019-09-08 13:18:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-08 13:18:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2019-09-08 13:18:45,932 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 122 [2019-09-08 13:18:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:45,933 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2019-09-08 13:18:45,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2019-09-08 13:18:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:18:45,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:45,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:45,947 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash -911022634, now seen corresponding path program 1 times [2019-09-08 13:18:45,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:45,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:45,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:45,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:45,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:18:46,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:46,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:46,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:46,215 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand 3 states. [2019-09-08 13:18:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:46,307 INFO L93 Difference]: Finished difference Result 1056 states and 1745 transitions. [2019-09-08 13:18:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:46,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:18:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:46,316 INFO L225 Difference]: With dead ends: 1056 [2019-09-08 13:18:46,316 INFO L226 Difference]: Without dead ends: 763 [2019-09-08 13:18:46,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-08 13:18:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2019-09-08 13:18:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-08 13:18:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1250 transitions. [2019-09-08 13:18:46,385 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1250 transitions. Word has length 125 [2019-09-08 13:18:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:46,386 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1250 transitions. [2019-09-08 13:18:46,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1250 transitions. [2019-09-08 13:18:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:18:46,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:46,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:46,393 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash -462854808, now seen corresponding path program 1 times [2019-09-08 13:18:46,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:46,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:46,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:46,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:46,595 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:18:46,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:46,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:46,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:46,600 INFO L87 Difference]: Start difference. First operand 759 states and 1250 transitions. Second operand 3 states. [2019-09-08 13:18:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:46,690 INFO L93 Difference]: Finished difference Result 1843 states and 3044 transitions. [2019-09-08 13:18:46,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:46,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 13:18:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:46,703 INFO L225 Difference]: With dead ends: 1843 [2019-09-08 13:18:46,704 INFO L226 Difference]: Without dead ends: 1281 [2019-09-08 13:18:46,714 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:18:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-08 13:18:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1275. [2019-09-08 13:18:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-08 13:18:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2098 transitions. [2019-09-08 13:18:46,822 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2098 transitions. Word has length 128 [2019-09-08 13:18:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:46,824 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 2098 transitions. [2019-09-08 13:18:46,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2098 transitions. [2019-09-08 13:18:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:18:46,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:46,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:46,828 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash 750481413, now seen corresponding path program 1 times [2019-09-08 13:18:46,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:46,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:46,975 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:18:46,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:46,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:46,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:46,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:46,978 INFO L87 Difference]: Start difference. First operand 1275 states and 2098 transitions. Second operand 3 states. [2019-09-08 13:18:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:47,092 INFO L93 Difference]: Finished difference Result 3351 states and 5516 transitions. [2019-09-08 13:18:47,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:47,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 13:18:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:47,107 INFO L225 Difference]: With dead ends: 3351 [2019-09-08 13:18:47,107 INFO L226 Difference]: Without dead ends: 2273 [2019-09-08 13:18:47,112 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:18:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-09-08 13:18:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2263. [2019-09-08 13:18:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-09-08 13:18:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3710 transitions. [2019-09-08 13:18:47,216 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3710 transitions. Word has length 131 [2019-09-08 13:18:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:47,217 INFO L475 AbstractCegarLoop]: Abstraction has 2263 states and 3710 transitions. [2019-09-08 13:18:47,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3710 transitions. [2019-09-08 13:18:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 13:18:47,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:47,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:47,220 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2145185539, now seen corresponding path program 1 times [2019-09-08 13:18:47,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:47,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:47,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:47,573 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:18:47,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:47,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:18:47,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:18:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:18:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:18:47,575 INFO L87 Difference]: Start difference. First operand 2263 states and 3710 transitions. Second operand 6 states. [2019-09-08 13:18:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:48,309 INFO L93 Difference]: Finished difference Result 8633 states and 14239 transitions. [2019-09-08 13:18:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:18:48,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 13:18:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:48,347 INFO L225 Difference]: With dead ends: 8633 [2019-09-08 13:18:48,348 INFO L226 Difference]: Without dead ends: 6567 [2019-09-08 13:18:48,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:18:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2019-09-08 13:18:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 5164. [2019-09-08 13:18:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-09-08 13:18:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8485 transitions. [2019-09-08 13:18:48,789 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8485 transitions. Word has length 134 [2019-09-08 13:18:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:48,790 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8485 transitions. [2019-09-08 13:18:48,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:18:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8485 transitions. [2019-09-08 13:18:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 13:18:48,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:48,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:48,795 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2142410535, now seen corresponding path program 1 times [2019-09-08 13:18:48,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:48,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:48,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:48,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:49,015 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:18:49,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:49,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:49,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:49,017 INFO L87 Difference]: Start difference. First operand 5164 states and 8485 transitions. Second operand 4 states. [2019-09-08 13:18:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:49,690 INFO L93 Difference]: Finished difference Result 13702 states and 22612 transitions. [2019-09-08 13:18:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:49,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 13:18:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:49,735 INFO L225 Difference]: With dead ends: 13702 [2019-09-08 13:18:49,735 INFO L226 Difference]: Without dead ends: 8735 [2019-09-08 13:18:49,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-09-08 13:18:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7629. [2019-09-08 13:18:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7629 states. [2019-09-08 13:18:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 12558 transitions. [2019-09-08 13:18:50,231 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 12558 transitions. Word has length 135 [2019-09-08 13:18:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:50,232 INFO L475 AbstractCegarLoop]: Abstraction has 7629 states and 12558 transitions. [2019-09-08 13:18:50,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:18:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 12558 transitions. [2019-09-08 13:18:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:18:50,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:50,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:50,238 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2051827388, now seen corresponding path program 1 times [2019-09-08 13:18:50,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:50,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:50,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:50,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:50,501 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:18:50,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:50,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:50,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:50,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:50,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:50,503 INFO L87 Difference]: Start difference. First operand 7629 states and 12558 transitions. Second operand 4 states. [2019-09-08 13:18:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:51,299 INFO L93 Difference]: Finished difference Result 20302 states and 33486 transitions. [2019-09-08 13:18:51,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:51,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 13:18:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:51,364 INFO L225 Difference]: With dead ends: 20302 [2019-09-08 13:18:51,364 INFO L226 Difference]: Without dead ends: 12870 [2019-09-08 13:18:51,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12870 states. [2019-09-08 13:18:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12870 to 11204. [2019-09-08 13:18:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11204 states. [2019-09-08 13:18:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11204 states to 11204 states and 18427 transitions. [2019-09-08 13:18:51,987 INFO L78 Accepts]: Start accepts. Automaton has 11204 states and 18427 transitions. Word has length 136 [2019-09-08 13:18:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:51,988 INFO L475 AbstractCegarLoop]: Abstraction has 11204 states and 18427 transitions. [2019-09-08 13:18:51,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:18:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 11204 states and 18427 transitions. [2019-09-08 13:18:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 13:18:51,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:51,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:51,996 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash 760808192, now seen corresponding path program 1 times [2019-09-08 13:18:51,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:51,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:51,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:51,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:52,263 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:18:52,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:52,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:18:52,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:18:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:18:52,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:18:52,266 INFO L87 Difference]: Start difference. First operand 11204 states and 18427 transitions. Second operand 7 states. [2019-09-08 13:18:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:54,862 INFO L93 Difference]: Finished difference Result 52340 states and 86153 transitions. [2019-09-08 13:18:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:18:54,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 13:18:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:54,994 INFO L225 Difference]: With dead ends: 52340 [2019-09-08 13:18:54,994 INFO L226 Difference]: Without dead ends: 41333 [2019-09-08 13:18:55,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:18:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-09-08 13:18:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 32212. [2019-09-08 13:18:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32212 states. [2019-09-08 13:18:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32212 states to 32212 states and 52804 transitions. [2019-09-08 13:18:57,667 INFO L78 Accepts]: Start accepts. Automaton has 32212 states and 52804 transitions. Word has length 137 [2019-09-08 13:18:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:57,668 INFO L475 AbstractCegarLoop]: Abstraction has 32212 states and 52804 transitions. [2019-09-08 13:18:57,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:18:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32212 states and 52804 transitions. [2019-09-08 13:18:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:18:57,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:57,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:57,675 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash 547273736, now seen corresponding path program 1 times [2019-09-08 13:18:57,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:57,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:57,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:57,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:57,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:57,783 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:18:57,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:57,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:57,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:57,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:57,785 INFO L87 Difference]: Start difference. First operand 32212 states and 52804 transitions. Second operand 3 states. [2019-09-08 13:18:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:59,353 INFO L93 Difference]: Finished difference Result 68578 states and 112387 transitions. [2019-09-08 13:18:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:59,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:18:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:59,528 INFO L225 Difference]: With dead ends: 68578 [2019-09-08 13:18:59,528 INFO L226 Difference]: Without dead ends: 47784 [2019-09-08 13:18:59,582 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:18:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47784 states. [2019-09-08 13:19:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47784 to 47782. [2019-09-08 13:19:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2019-09-08 13:19:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 78034 transitions. [2019-09-08 13:19:02,214 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 78034 transitions. Word has length 138 [2019-09-08 13:19:02,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:02,214 INFO L475 AbstractCegarLoop]: Abstraction has 47782 states and 78034 transitions. [2019-09-08 13:19:02,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 78034 transitions. [2019-09-08 13:19:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:19:02,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:02,218 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:19:02,219 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash 696050988, now seen corresponding path program 1 times [2019-09-08 13:19:02,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:02,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:02,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:19:02,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:02,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:02,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:02,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:02,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:02,331 INFO L87 Difference]: Start difference. First operand 47782 states and 78034 transitions. Second operand 3 states. [2019-09-08 13:19:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:05,830 INFO L93 Difference]: Finished difference Result 98341 states and 160808 transitions. [2019-09-08 13:19:05,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:05,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:19:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:05,981 INFO L225 Difference]: With dead ends: 98341 [2019-09-08 13:19:05,981 INFO L226 Difference]: Without dead ends: 68203 [2019-09-08 13:19:06,043 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:19:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-09-08 13:19:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 68201. [2019-09-08 13:19:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68201 states. [2019-09-08 13:19:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68201 states to 68201 states and 111031 transitions. [2019-09-08 13:19:08,633 INFO L78 Accepts]: Start accepts. Automaton has 68201 states and 111031 transitions. Word has length 138 [2019-09-08 13:19:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:08,633 INFO L475 AbstractCegarLoop]: Abstraction has 68201 states and 111031 transitions. [2019-09-08 13:19:08,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 68201 states and 111031 transitions. [2019-09-08 13:19:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:19:08,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:08,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:19:08,637 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2057723275, now seen corresponding path program 1 times [2019-09-08 13:19:08,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:08,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:08,739 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:19:08,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:08,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:19:08,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:19:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:19:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:19:08,741 INFO L87 Difference]: Start difference. First operand 68201 states and 111031 transitions. Second operand 4 states. [2019-09-08 13:19:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:14,219 INFO L93 Difference]: Finished difference Result 199194 states and 324565 transitions. [2019-09-08 13:19:14,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:19:14,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 13:19:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:14,455 INFO L225 Difference]: With dead ends: 199194 [2019-09-08 13:19:14,456 INFO L226 Difference]: Without dead ends: 133397 [2019-09-08 13:19:14,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:19:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133397 states. [2019-09-08 13:19:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133397 to 100647. [2019-09-08 13:19:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100647 states. [2019-09-08 13:19:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100647 states to 100647 states and 163638 transitions. [2019-09-08 13:19:18,950 INFO L78 Accepts]: Start accepts. Automaton has 100647 states and 163638 transitions. Word has length 138 [2019-09-08 13:19:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:18,951 INFO L475 AbstractCegarLoop]: Abstraction has 100647 states and 163638 transitions. [2019-09-08 13:19:18,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 100647 states and 163638 transitions. [2019-09-08 13:19:18,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:19:18,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:18,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:19:18,954 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1977095112, now seen corresponding path program 1 times [2019-09-08 13:19:18,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:18,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:18,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:19,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:19:19,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:19,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:19,062 INFO L87 Difference]: Start difference. First operand 100647 states and 163638 transitions. Second operand 3 states. [2019-09-08 13:19:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:25,574 INFO L93 Difference]: Finished difference Result 218957 states and 356288 transitions. [2019-09-08 13:19:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:25,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:19:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:25,800 INFO L225 Difference]: With dead ends: 218957 [2019-09-08 13:19:25,801 INFO L226 Difference]: Without dead ends: 148819 [2019-09-08 13:19:25,877 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:19:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148819 states. [2019-09-08 13:19:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148819 to 148817. [2019-09-08 13:19:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148817 states. [2019-09-08 13:19:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148817 states to 148817 states and 240983 transitions. [2019-09-08 13:19:34,316 INFO L78 Accepts]: Start accepts. Automaton has 148817 states and 240983 transitions. Word has length 138 [2019-09-08 13:19:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:34,317 INFO L475 AbstractCegarLoop]: Abstraction has 148817 states and 240983 transitions. [2019-09-08 13:19:34,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 148817 states and 240983 transitions. [2019-09-08 13:19:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:19:34,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:34,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:19:34,319 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash -475052957, now seen corresponding path program 1 times [2019-09-08 13:19:34,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:34,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:34,413 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:19:34,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:34,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:34,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:34,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:34,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:34,415 INFO L87 Difference]: Start difference. First operand 148817 states and 240983 transitions. Second operand 3 states. [2019-09-08 13:19:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:46,019 INFO L93 Difference]: Finished difference Result 321956 states and 523325 transitions. [2019-09-08 13:19:46,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:46,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:19:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:46,381 INFO L225 Difference]: With dead ends: 321956 [2019-09-08 13:19:46,382 INFO L226 Difference]: Without dead ends: 216937 [2019-09-08 13:19:46,474 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:19:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216937 states. [2019-09-08 13:19:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216937 to 216935. [2019-09-08 13:19:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216935 states. [2019-09-08 13:19:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216935 states to 216935 states and 350275 transitions. [2019-09-08 13:19:59,395 INFO L78 Accepts]: Start accepts. Automaton has 216935 states and 350275 transitions. Word has length 138 [2019-09-08 13:19:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:59,396 INFO L475 AbstractCegarLoop]: Abstraction has 216935 states and 350275 transitions. [2019-09-08 13:19:59,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 216935 states and 350275 transitions. [2019-09-08 13:19:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 13:19:59,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:59,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:19:59,397 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 297482555, now seen corresponding path program 1 times [2019-09-08 13:19:59,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:59,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:59,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:59,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:59,721 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:19:59,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:59,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:19:59,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:19:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:19:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:19:59,723 INFO L87 Difference]: Start difference. First operand 216935 states and 350275 transitions. Second operand 6 states. [2019-09-08 13:20:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:15,600 INFO L93 Difference]: Finished difference Result 529867 states and 856378 transitions. [2019-09-08 13:20:15,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:20:15,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 13:20:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:16,095 INFO L225 Difference]: With dead ends: 529867 [2019-09-08 13:20:16,095 INFO L226 Difference]: Without dead ends: 313197 [2019-09-08 13:20:16,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:20:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313197 states. [2019-09-08 13:20:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313197 to 247495. [2019-09-08 13:20:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247495 states. [2019-09-08 13:20:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247495 states to 247495 states and 398885 transitions. [2019-09-08 13:20:34,063 INFO L78 Accepts]: Start accepts. Automaton has 247495 states and 398885 transitions. Word has length 140 [2019-09-08 13:20:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:34,064 INFO L475 AbstractCegarLoop]: Abstraction has 247495 states and 398885 transitions. [2019-09-08 13:20:34,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:20:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 247495 states and 398885 transitions. [2019-09-08 13:20:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 13:20:34,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:34,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:34,066 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:34,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:34,066 INFO L82 PathProgramCache]: Analyzing trace with hash -264023695, now seen corresponding path program 1 times [2019-09-08 13:20:34,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:34,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:34,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:34,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:34,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:34,346 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:20:34,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:34,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:20:34,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:20:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:20:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:20:34,348 INFO L87 Difference]: Start difference. First operand 247495 states and 398885 transitions. Second operand 6 states. [2019-09-08 13:21:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:04,297 INFO L93 Difference]: Finished difference Result 728011 states and 1176048 transitions. [2019-09-08 13:21:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:21:04,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 13:21:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:05,123 INFO L225 Difference]: With dead ends: 728011 [2019-09-08 13:21:05,123 INFO L226 Difference]: Without dead ends: 480781 [2019-09-08 13:21:05,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:21:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480781 states. [2019-09-08 13:21:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480781 to 440423. [2019-09-08 13:21:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440423 states. [2019-09-08 13:21:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440423 states to 440423 states and 709542 transitions. [2019-09-08 13:21:38,704 INFO L78 Accepts]: Start accepts. Automaton has 440423 states and 709542 transitions. Word has length 143 [2019-09-08 13:21:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:38,704 INFO L475 AbstractCegarLoop]: Abstraction has 440423 states and 709542 transitions. [2019-09-08 13:21:38,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:21:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 440423 states and 709542 transitions. [2019-09-08 13:21:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 13:21:38,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:38,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:38,706 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash 403290968, now seen corresponding path program 1 times [2019-09-08 13:21:38,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:38,890 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:21:38,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:38,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:21:38,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:21:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:21:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:21:38,892 INFO L87 Difference]: Start difference. First operand 440423 states and 709542 transitions. Second operand 5 states. [2019-09-08 13:22:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:31,018 INFO L93 Difference]: Finished difference Result 737113 states and 1183399 transitions. [2019-09-08 13:22:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:22:31,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 13:22:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:32,281 INFO L225 Difference]: With dead ends: 737113 [2019-09-08 13:22:32,282 INFO L226 Difference]: Without dead ends: 737111 [2019-09-08 13:22:32,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:22:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737111 states. [2019-09-08 13:23:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737111 to 446335. [2019-09-08 13:23:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446335 states. [2019-09-08 13:23:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446335 states to 446335 states and 715409 transitions. [2019-09-08 13:23:08,094 INFO L78 Accepts]: Start accepts. Automaton has 446335 states and 715409 transitions. Word has length 144 [2019-09-08 13:23:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:23:08,094 INFO L475 AbstractCegarLoop]: Abstraction has 446335 states and 715409 transitions. [2019-09-08 13:23:08,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:23:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 446335 states and 715409 transitions. [2019-09-08 13:23:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:23:08,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:23:08,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:23:08,099 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:23:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:23:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1108095999, now seen corresponding path program 1 times [2019-09-08 13:23:08,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:23:08,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:23:08,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:08,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:23:08,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:23:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:23:08,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:23:08,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:23:08,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:23:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:23:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:23:08,340 INFO L87 Difference]: Start difference. First operand 446335 states and 715409 transitions. Second operand 6 states. [2019-09-08 13:23:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:48,640 INFO L93 Difference]: Finished difference Result 766026 states and 1232016 transitions. [2019-09-08 13:23:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:23:48,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:23:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:49,496 INFO L225 Difference]: With dead ends: 766026 [2019-09-08 13:23:49,496 INFO L226 Difference]: Without dead ends: 540412 [2019-09-08 13:23:49,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:23:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540412 states. [2019-09-08 13:24:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540412 to 498602. [2019-09-08 13:24:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498602 states. [2019-09-08 13:24:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498602 states to 498602 states and 799201 transitions. [2019-09-08 13:24:33,092 INFO L78 Accepts]: Start accepts. Automaton has 498602 states and 799201 transitions. Word has length 180 [2019-09-08 13:24:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:24:33,093 INFO L475 AbstractCegarLoop]: Abstraction has 498602 states and 799201 transitions. [2019-09-08 13:24:33,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:24:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 498602 states and 799201 transitions. [2019-09-08 13:24:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:24:33,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:24:33,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:24:33,099 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:24:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:24:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash -959318747, now seen corresponding path program 1 times [2019-09-08 13:24:33,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:24:33,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:24:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:33,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:24:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:24:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 13:24:33,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:24:33,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:24:33,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:24:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:24:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:24:33,364 INFO L87 Difference]: Start difference. First operand 498602 states and 799201 transitions. Second operand 6 states. [2019-09-08 13:25:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:23,808 INFO L93 Difference]: Finished difference Result 850610 states and 1368862 transitions. [2019-09-08 13:25:23,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:25:23,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:25:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:24,850 INFO L225 Difference]: With dead ends: 850610 [2019-09-08 13:25:24,850 INFO L226 Difference]: Without dead ends: 651224 [2019-09-08 13:25:25,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:25:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651224 states. [2019-09-08 13:26:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651224 to 489736. [2019-09-08 13:26:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489736 states. [2019-09-08 13:26:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489736 states to 489736 states and 784841 transitions. [2019-09-08 13:26:17,607 INFO L78 Accepts]: Start accepts. Automaton has 489736 states and 784841 transitions. Word has length 180 [2019-09-08 13:26:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:17,608 INFO L475 AbstractCegarLoop]: Abstraction has 489736 states and 784841 transitions. [2019-09-08 13:26:17,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:26:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 489736 states and 784841 transitions. [2019-09-08 13:26:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:26:17,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:17,614 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:17,614 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:17,615 INFO L82 PathProgramCache]: Analyzing trace with hash 662502449, now seen corresponding path program 1 times [2019-09-08 13:26:17,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:17,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:17,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:26:17,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 13:26:17,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:26:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:18,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:26:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:26:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 13:26:18,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:26:18,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:26:18,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:26:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:26:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:26:18,253 INFO L87 Difference]: Start difference. First operand 489736 states and 784841 transitions. Second operand 9 states. [2019-09-08 13:27:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:40,206 INFO L93 Difference]: Finished difference Result 1104125 states and 1779620 transitions. [2019-09-08 13:27:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:27:40,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-09-08 13:27:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:42,600 INFO L225 Difference]: With dead ends: 1104125 [2019-09-08 13:27:42,600 INFO L226 Difference]: Without dead ends: 979331 [2019-09-08 13:27:42,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:27:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979331 states. [2019-09-08 13:29:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979331 to 807771. [2019-09-08 13:29:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807771 states. [2019-09-08 13:29:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807771 states to 807771 states and 1297417 transitions. [2019-09-08 13:29:02,611 INFO L78 Accepts]: Start accepts. Automaton has 807771 states and 1297417 transitions. Word has length 180 [2019-09-08 13:29:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:02,612 INFO L475 AbstractCegarLoop]: Abstraction has 807771 states and 1297417 transitions. [2019-09-08 13:29:02,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:29:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 807771 states and 1297417 transitions. [2019-09-08 13:29:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:29:02,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:02,623 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:02,624 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:02,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:02,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2130422692, now seen corresponding path program 1 times [2019-09-08 13:29:02,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:02,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:02,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:29:13,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:13,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:13,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:13,081 INFO L87 Difference]: Start difference. First operand 807771 states and 1297417 transitions. Second operand 3 states.