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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:42:50,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:42:50,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:42:50,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:42:50,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:42:50,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:42:50,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:42:50,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:42:50,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:42:50,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:42:50,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:42:50,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:42:50,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:42:50,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:42:50,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:42:50,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:42:50,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:42:50,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:42:50,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:42:50,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:42:50,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:42:50,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:42:50,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:42:50,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:42:50,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:42:50,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:42:50,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:42:50,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:42:50,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:42:50,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:42:50,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:42:50,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:42:50,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:42:50,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:42:50,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:42:50,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:42:50,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:42:50,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:42:50,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:42:50,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:42:50,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:42:50,259 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 09:42:50,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:42:50,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:42:50,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:42:50,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:42:50,304 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:42:50,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:42:50,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:42:50,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:42:50,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:42:50,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:42:50,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:42:50,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:42:50,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:42:50,307 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:42:50,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:42:50,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:42:50,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:42:50,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:42:50,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:42:50,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:42:50,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:42:50,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:42:50,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:42:50,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:42:50,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:42:50,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:42:50,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:42:50,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:42:50,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:42:50,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:42:50,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:42:50,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:42:50,361 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:42:50,361 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:42:50,362 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:42:50,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bbe4e02/42fa435fc90d49dfb14d806160dee97f/FLAGffe925ebf [2019-09-08 09:42:51,013 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:42:51,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:42:51,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bbe4e02/42fa435fc90d49dfb14d806160dee97f/FLAGffe925ebf [2019-09-08 09:42:51,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bbe4e02/42fa435fc90d49dfb14d806160dee97f [2019-09-08 09:42:51,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:42:51,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:42:51,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:42:51,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:42:51,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:42:51,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:42:51" (1/1) ... [2019-09-08 09:42:51,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:51, skipping insertion in model container [2019-09-08 09:42:51,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:42:51" (1/1) ... [2019-09-08 09:42:51,338 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:42:51,417 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:42:51,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:42:51,977 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:42:52,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:42:52,149 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:42:52,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52 WrapperNode [2019-09-08 09:42:52,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:42:52,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:42:52,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:42:52,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:42:52,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (1/1) ... [2019-09-08 09:42:52,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (1/1) ... [2019-09-08 09:42:52,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (1/1) ... [2019-09-08 09:42:52,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (1/1) ... [2019-09-08 09:42:52,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (1/1) ... [2019-09-08 09:42:52,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (1/1) ... [2019-09-08 09:42:52,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (1/1) ... [2019-09-08 09:42:52,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:42:52,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:42:52,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:42:52,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:42:52,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (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 09:42:52,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:42:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:42:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:42:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:42:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:42:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:42:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:42:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:42:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:42:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:42:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:42:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:42:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:42:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:42:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:42:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:42:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:42:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:42:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:42:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:42:53,762 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:42:53,762 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:42:53,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:42:53 BoogieIcfgContainer [2019-09-08 09:42:53,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:42:53,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:42:53,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:42:53,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:42:53,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:42:51" (1/3) ... [2019-09-08 09:42:53,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f988a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:42:53, skipping insertion in model container [2019-09-08 09:42:53,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:52" (2/3) ... [2019-09-08 09:42:53,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f988a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:42:53, skipping insertion in model container [2019-09-08 09:42:53,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:42:53" (3/3) ... [2019-09-08 09:42:53,772 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:42:53,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:42:53,789 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:42:53,806 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:42:53,840 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:42:53,841 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:42:53,841 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:42:53,842 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:42:53,842 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:42:53,842 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:42:53,842 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:42:53,842 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:42:53,842 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:42:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states. [2019-09-08 09:42:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:42:53,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:53,889 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] [2019-09-08 09:42:53,891 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1495088547, now seen corresponding path program 1 times [2019-09-08 09:42:53,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:53,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:53,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:53,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:54,527 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 09:42:54,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:54,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:54,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:54,557 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 3 states. [2019-09-08 09:42:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:54,762 INFO L93 Difference]: Finished difference Result 584 states and 1004 transitions. [2019-09-08 09:42:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:54,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 09:42:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:54,787 INFO L225 Difference]: With dead ends: 584 [2019-09-08 09:42:54,787 INFO L226 Difference]: Without dead ends: 438 [2019-09-08 09:42:54,793 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 09:42:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-08 09:42:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2019-09-08 09:42:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-08 09:42:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 726 transitions. [2019-09-08 09:42:54,885 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 726 transitions. Word has length 102 [2019-09-08 09:42:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:54,886 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 726 transitions. [2019-09-08 09:42:54,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 726 transitions. [2019-09-08 09:42:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 09:42:54,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:54,892 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] [2019-09-08 09:42:54,893 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1002553119, now seen corresponding path program 1 times [2019-09-08 09:42:54,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:54,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:54,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:54,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:55,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:55,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:55,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:55,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:55,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:55,171 INFO L87 Difference]: Start difference. First operand 435 states and 726 transitions. Second operand 3 states. [2019-09-08 09:42:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:55,270 INFO L93 Difference]: Finished difference Result 925 states and 1542 transitions. [2019-09-08 09:42:55,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:55,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 09:42:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:55,278 INFO L225 Difference]: With dead ends: 925 [2019-09-08 09:42:55,279 INFO L226 Difference]: Without dead ends: 671 [2019-09-08 09:42:55,285 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 09:42:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-08 09:42:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 667. [2019-09-08 09:42:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-09-08 09:42:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1110 transitions. [2019-09-08 09:42:55,360 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1110 transitions. Word has length 105 [2019-09-08 09:42:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:55,363 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 1110 transitions. [2019-09-08 09:42:55,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1110 transitions. [2019-09-08 09:42:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 09:42:55,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:55,372 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] [2019-09-08 09:42:55,373 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1754696449, now seen corresponding path program 1 times [2019-09-08 09:42:55,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:55,498 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 09:42:55,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:55,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:55,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:55,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:55,500 INFO L87 Difference]: Start difference. First operand 667 states and 1110 transitions. Second operand 3 states. [2019-09-08 09:42:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:55,574 INFO L93 Difference]: Finished difference Result 1603 states and 2660 transitions. [2019-09-08 09:42:55,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:55,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 09:42:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:55,582 INFO L225 Difference]: With dead ends: 1603 [2019-09-08 09:42:55,582 INFO L226 Difference]: Without dead ends: 1117 [2019-09-08 09:42:55,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-09-08 09:42:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1111. [2019-09-08 09:42:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-09-08 09:42:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1838 transitions. [2019-09-08 09:42:55,640 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1838 transitions. Word has length 108 [2019-09-08 09:42:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:55,640 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1838 transitions. [2019-09-08 09:42:55,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1838 transitions. [2019-09-08 09:42:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 09:42:55,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:55,644 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] [2019-09-08 09:42:55,644 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:55,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1073140101, now seen corresponding path program 1 times [2019-09-08 09:42:55,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:55,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:55,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:55,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:55,806 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 09:42:55,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:55,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:55,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:55,808 INFO L87 Difference]: Start difference. First operand 1111 states and 1838 transitions. Second operand 3 states. [2019-09-08 09:42:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:55,925 INFO L93 Difference]: Finished difference Result 2899 states and 4776 transitions. [2019-09-08 09:42:55,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:55,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 09:42:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:55,939 INFO L225 Difference]: With dead ends: 2899 [2019-09-08 09:42:55,939 INFO L226 Difference]: Without dead ends: 1969 [2019-09-08 09:42:55,942 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 09:42:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-08 09:42:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1959. [2019-09-08 09:42:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-09-08 09:42:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3214 transitions. [2019-09-08 09:42:56,050 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3214 transitions. Word has length 111 [2019-09-08 09:42:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:56,050 INFO L475 AbstractCegarLoop]: Abstraction has 1959 states and 3214 transitions. [2019-09-08 09:42:56,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3214 transitions. [2019-09-08 09:42:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 09:42:56,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:56,054 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] [2019-09-08 09:42:56,054 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1622346843, now seen corresponding path program 1 times [2019-09-08 09:42:56,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:56,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:56,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:56,199 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 09:42:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:56,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:42:56,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:42:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:42:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:42:56,202 INFO L87 Difference]: Start difference. First operand 1959 states and 3214 transitions. Second operand 6 states. [2019-09-08 09:42:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:57,018 INFO L93 Difference]: Finished difference Result 10215 states and 16890 transitions. [2019-09-08 09:42:57,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 09:42:57,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-09-08 09:42:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:57,075 INFO L225 Difference]: With dead ends: 10215 [2019-09-08 09:42:57,076 INFO L226 Difference]: Without dead ends: 8437 [2019-09-08 09:42:57,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:42:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2019-09-08 09:42:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 3617. [2019-09-08 09:42:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3617 states. [2019-09-08 09:42:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5929 transitions. [2019-09-08 09:42:57,599 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5929 transitions. Word has length 114 [2019-09-08 09:42:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:57,600 INFO L475 AbstractCegarLoop]: Abstraction has 3617 states and 5929 transitions. [2019-09-08 09:42:57,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:42:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5929 transitions. [2019-09-08 09:42:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 09:42:57,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:57,605 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] [2019-09-08 09:42:57,606 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1180687097, now seen corresponding path program 1 times [2019-09-08 09:42:57,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:57,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:57,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:57,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:57,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:57,768 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 09:42:57,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:57,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:57,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:57,769 INFO L87 Difference]: Start difference. First operand 3617 states and 5929 transitions. Second operand 4 states. [2019-09-08 09:42:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:58,415 INFO L93 Difference]: Finished difference Result 10699 states and 17633 transitions. [2019-09-08 09:42:58,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:58,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-08 09:42:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:58,455 INFO L225 Difference]: With dead ends: 10699 [2019-09-08 09:42:58,455 INFO L226 Difference]: Without dead ends: 7263 [2019-09-08 09:42:58,465 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 09:42:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7263 states. [2019-09-08 09:42:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7263 to 5372. [2019-09-08 09:42:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5372 states. [2019-09-08 09:42:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 8823 transitions. [2019-09-08 09:42:58,865 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 8823 transitions. Word has length 115 [2019-09-08 09:42:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:58,865 INFO L475 AbstractCegarLoop]: Abstraction has 5372 states and 8823 transitions. [2019-09-08 09:42:58,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 8823 transitions. [2019-09-08 09:42:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 09:42:58,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:58,872 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] [2019-09-08 09:42:58,872 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2115015956, now seen corresponding path program 1 times [2019-09-08 09:42:58,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:58,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:58,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:58,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:59,026 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 09:42:59,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:59,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:59,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:59,029 INFO L87 Difference]: Start difference. First operand 5372 states and 8823 transitions. Second operand 4 states. [2019-09-08 09:42:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:59,806 INFO L93 Difference]: Finished difference Result 15769 states and 25973 transitions. [2019-09-08 09:42:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:59,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 09:42:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:59,871 INFO L225 Difference]: With dead ends: 15769 [2019-09-08 09:42:59,871 INFO L226 Difference]: Without dead ends: 10578 [2019-09-08 09:42:59,888 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 09:42:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10578 states. [2019-09-08 09:43:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10578 to 7951. [2019-09-08 09:43:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7951 states. [2019-09-08 09:43:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7951 states to 7951 states and 13048 transitions. [2019-09-08 09:43:00,481 INFO L78 Accepts]: Start accepts. Automaton has 7951 states and 13048 transitions. Word has length 116 [2019-09-08 09:43:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:00,481 INFO L475 AbstractCegarLoop]: Abstraction has 7951 states and 13048 transitions. [2019-09-08 09:43:00,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7951 states and 13048 transitions. [2019-09-08 09:43:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:43:00,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:00,488 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] [2019-09-08 09:43:00,488 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash -69500361, now seen corresponding path program 1 times [2019-09-08 09:43:00,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:00,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:00,586 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 09:43:00,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:00,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:00,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:00,588 INFO L87 Difference]: Start difference. First operand 7951 states and 13048 transitions. Second operand 3 states. [2019-09-08 09:43:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:01,276 INFO L93 Difference]: Finished difference Result 15648 states and 25731 transitions. [2019-09-08 09:43:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:01,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 09:43:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:01,312 INFO L225 Difference]: With dead ends: 15648 [2019-09-08 09:43:01,312 INFO L226 Difference]: Without dead ends: 11372 [2019-09-08 09:43:01,327 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 09:43:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2019-09-08 09:43:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 11370. [2019-09-08 09:43:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2019-09-08 09:43:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 18621 transitions. [2019-09-08 09:43:02,140 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 18621 transitions. Word has length 117 [2019-09-08 09:43:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:02,140 INFO L475 AbstractCegarLoop]: Abstraction has 11370 states and 18621 transitions. [2019-09-08 09:43:02,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 18621 transitions. [2019-09-08 09:43:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:43:02,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:02,145 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] [2019-09-08 09:43:02,145 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash 284821087, now seen corresponding path program 1 times [2019-09-08 09:43:02,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:02,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:02,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:02,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:02,262 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 09:43:02,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:02,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:02,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:02,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:02,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:02,264 INFO L87 Difference]: Start difference. First operand 11370 states and 18621 transitions. Second operand 3 states. [2019-09-08 09:43:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:03,521 INFO L93 Difference]: Finished difference Result 22080 states and 36255 transitions. [2019-09-08 09:43:03,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:03,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 09:43:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:03,560 INFO L225 Difference]: With dead ends: 22080 [2019-09-08 09:43:03,560 INFO L226 Difference]: Without dead ends: 16088 [2019-09-08 09:43:03,575 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 09:43:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16088 states. [2019-09-08 09:43:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16088 to 16086. [2019-09-08 09:43:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2019-09-08 09:43:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 26289 transitions. [2019-09-08 09:43:04,452 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 26289 transitions. Word has length 117 [2019-09-08 09:43:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:04,452 INFO L475 AbstractCegarLoop]: Abstraction has 16086 states and 26289 transitions. [2019-09-08 09:43:04,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 26289 transitions. [2019-09-08 09:43:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:43:04,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:04,456 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] [2019-09-08 09:43:04,456 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1198037472, now seen corresponding path program 1 times [2019-09-08 09:43:04,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:04,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:04,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:04,571 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 09:43:04,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:04,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:04,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:04,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:04,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:04,574 INFO L87 Difference]: Start difference. First operand 16086 states and 26289 transitions. Second operand 4 states. [2019-09-08 09:43:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:06,191 INFO L93 Difference]: Finished difference Result 50952 states and 83564 transitions. [2019-09-08 09:43:06,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:06,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-08 09:43:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:06,288 INFO L225 Difference]: With dead ends: 50952 [2019-09-08 09:43:06,288 INFO L226 Difference]: Without dead ends: 35466 [2019-09-08 09:43:06,334 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 09:43:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35466 states. [2019-09-08 09:43:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35466 to 25724. [2019-09-08 09:43:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25724 states. [2019-09-08 09:43:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25724 states to 25724 states and 41999 transitions. [2019-09-08 09:43:07,570 INFO L78 Accepts]: Start accepts. Automaton has 25724 states and 41999 transitions. Word has length 117 [2019-09-08 09:43:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:07,570 INFO L475 AbstractCegarLoop]: Abstraction has 25724 states and 41999 transitions. [2019-09-08 09:43:07,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25724 states and 41999 transitions. [2019-09-08 09:43:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:43:07,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:07,574 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] [2019-09-08 09:43:07,574 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:07,575 INFO L82 PathProgramCache]: Analyzing trace with hash -820325105, now seen corresponding path program 1 times [2019-09-08 09:43:07,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:07,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:07,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:07,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:07,662 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 09:43:07,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:07,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:07,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:07,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:07,664 INFO L87 Difference]: Start difference. First operand 25724 states and 41999 transitions. Second operand 3 states. [2019-09-08 09:43:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:09,584 INFO L93 Difference]: Finished difference Result 55902 states and 91577 transitions. [2019-09-08 09:43:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:09,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 09:43:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:09,663 INFO L225 Difference]: With dead ends: 55902 [2019-09-08 09:43:09,663 INFO L226 Difference]: Without dead ends: 38179 [2019-09-08 09:43:09,713 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 09:43:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38179 states. [2019-09-08 09:43:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38179 to 38177. [2019-09-08 09:43:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38177 states. [2019-09-08 09:43:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38177 states to 38177 states and 62242 transitions. [2019-09-08 09:43:11,328 INFO L78 Accepts]: Start accepts. Automaton has 38177 states and 62242 transitions. Word has length 117 [2019-09-08 09:43:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:11,329 INFO L475 AbstractCegarLoop]: Abstraction has 38177 states and 62242 transitions. [2019-09-08 09:43:11,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38177 states and 62242 transitions. [2019-09-08 09:43:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:43:11,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:11,331 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] [2019-09-08 09:43:11,332 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:11,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:11,332 INFO L82 PathProgramCache]: Analyzing trace with hash 226754279, now seen corresponding path program 1 times [2019-09-08 09:43:11,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:11,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:11,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:11,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:11,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:11,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:11,440 INFO L87 Difference]: Start difference. First operand 38177 states and 62242 transitions. Second operand 3 states. [2019-09-08 09:43:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:14,630 INFO L93 Difference]: Finished difference Result 83684 states and 137531 transitions. [2019-09-08 09:43:14,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:14,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 09:43:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:14,740 INFO L225 Difference]: With dead ends: 83684 [2019-09-08 09:43:14,741 INFO L226 Difference]: Without dead ends: 56803 [2019-09-08 09:43:14,789 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 09:43:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56803 states. [2019-09-08 09:43:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56803 to 56801. [2019-09-08 09:43:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56801 states. [2019-09-08 09:43:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56801 states to 56801 states and 92710 transitions. [2019-09-08 09:43:17,192 INFO L78 Accepts]: Start accepts. Automaton has 56801 states and 92710 transitions. Word has length 117 [2019-09-08 09:43:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:17,192 INFO L475 AbstractCegarLoop]: Abstraction has 56801 states and 92710 transitions. [2019-09-08 09:43:17,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 56801 states and 92710 transitions. [2019-09-08 09:43:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:43:17,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:17,194 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] [2019-09-08 09:43:17,194 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1463049779, now seen corresponding path program 1 times [2019-09-08 09:43:17,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:17,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:17,293 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 09:43:17,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:17,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:17,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:17,295 INFO L87 Difference]: Start difference. First operand 56801 states and 92710 transitions. Second operand 4 states. [2019-09-08 09:43:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:23,710 INFO L93 Difference]: Finished difference Result 182054 states and 297975 transitions. [2019-09-08 09:43:23,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:23,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-08 09:43:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:24,031 INFO L225 Difference]: With dead ends: 182054 [2019-09-08 09:43:24,032 INFO L226 Difference]: Without dead ends: 125489 [2019-09-08 09:43:24,127 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 09:43:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125489 states. [2019-09-08 09:43:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125489 to 90920. [2019-09-08 09:43:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90920 states. [2019-09-08 09:43:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90920 states to 90920 states and 148063 transitions. [2019-09-08 09:43:28,841 INFO L78 Accepts]: Start accepts. Automaton has 90920 states and 148063 transitions. Word has length 118 [2019-09-08 09:43:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:28,841 INFO L475 AbstractCegarLoop]: Abstraction has 90920 states and 148063 transitions. [2019-09-08 09:43:28,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 90920 states and 148063 transitions. [2019-09-08 09:43:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 09:43:28,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:28,842 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] [2019-09-08 09:43:28,843 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash 46901475, now seen corresponding path program 1 times [2019-09-08 09:43:28,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:28,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:28,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:29,078 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 09:43:29,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:29,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:43:29,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:43:29,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:43:29,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:43:29,081 INFO L87 Difference]: Start difference. First operand 90920 states and 148063 transitions. Second operand 6 states. [2019-09-08 09:43:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:35,708 INFO L93 Difference]: Finished difference Result 181606 states and 295744 transitions. [2019-09-08 09:43:35,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:43:35,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-08 09:43:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:35,853 INFO L225 Difference]: With dead ends: 181606 [2019-09-08 09:43:35,853 INFO L226 Difference]: Without dead ends: 90922 [2019-09-08 09:43:35,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:43:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90922 states. [2019-09-08 09:43:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90922 to 90920. [2019-09-08 09:43:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90920 states. [2019-09-08 09:43:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90920 states to 90920 states and 147438 transitions. [2019-09-08 09:43:39,790 INFO L78 Accepts]: Start accepts. Automaton has 90920 states and 147438 transitions. Word has length 120 [2019-09-08 09:43:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:39,790 INFO L475 AbstractCegarLoop]: Abstraction has 90920 states and 147438 transitions. [2019-09-08 09:43:39,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:43:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 90920 states and 147438 transitions. [2019-09-08 09:43:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 09:43:39,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:39,791 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] [2019-09-08 09:43:39,791 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash -671873135, now seen corresponding path program 1 times [2019-09-08 09:43:39,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:39,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:39,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:40,034 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 09:43:40,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:40,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:43:40,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:43:40,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:43:40,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:43:40,036 INFO L87 Difference]: Start difference. First operand 90920 states and 147438 transitions. Second operand 6 states. [2019-09-08 09:43:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:50,940 INFO L93 Difference]: Finished difference Result 296134 states and 481641 transitions. [2019-09-08 09:43:50,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:43:50,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-09-08 09:43:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:51,304 INFO L225 Difference]: With dead ends: 296134 [2019-09-08 09:43:51,304 INFO L226 Difference]: Without dead ends: 205450 [2019-09-08 09:43:51,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:43:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205450 states. [2019-09-08 09:44:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205450 to 205446. [2019-09-08 09:44:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205446 states. [2019-09-08 09:44:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205446 states to 205446 states and 332567 transitions. [2019-09-08 09:44:04,637 INFO L78 Accepts]: Start accepts. Automaton has 205446 states and 332567 transitions. Word has length 123 [2019-09-08 09:44:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:04,637 INFO L475 AbstractCegarLoop]: Abstraction has 205446 states and 332567 transitions. [2019-09-08 09:44:04,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:44:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 205446 states and 332567 transitions. [2019-09-08 09:44:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:44:04,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:04,639 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] [2019-09-08 09:44:04,639 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 644860160, now seen corresponding path program 1 times [2019-09-08 09:44:04,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:04,772 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 09:44:04,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:04,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:44:04,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:44:04,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:44:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:44:04,774 INFO L87 Difference]: Start difference. First operand 205446 states and 332567 transitions. Second operand 5 states. [2019-09-08 09:44:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:25,101 INFO L93 Difference]: Finished difference Result 394468 states and 636506 transitions. [2019-09-08 09:44:25,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:44:25,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-09-08 09:44:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:25,817 INFO L225 Difference]: With dead ends: 394468 [2019-09-08 09:44:25,818 INFO L226 Difference]: Without dead ends: 394466 [2019-09-08 09:44:25,921 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 09:44:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394466 states. [2019-09-08 09:44:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394466 to 210102. [2019-09-08 09:44:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210102 states. [2019-09-08 09:44:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210102 states to 210102 states and 337196 transitions. [2019-09-08 09:44:45,333 INFO L78 Accepts]: Start accepts. Automaton has 210102 states and 337196 transitions. Word has length 124 [2019-09-08 09:44:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:45,334 INFO L475 AbstractCegarLoop]: Abstraction has 210102 states and 337196 transitions. [2019-09-08 09:44:45,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:44:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 210102 states and 337196 transitions. [2019-09-08 09:44:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:44:45,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:45,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:45,339 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash 71004762, now seen corresponding path program 1 times [2019-09-08 09:44:45,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:45,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:45,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:45,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:45,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 09:44:45,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:45,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:44:45,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:44:45,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:44:45,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:44:45,514 INFO L87 Difference]: Start difference. First operand 210102 states and 337196 transitions. Second operand 6 states. [2019-09-08 09:45:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:08,919 INFO L93 Difference]: Finished difference Result 468057 states and 753107 transitions. [2019-09-08 09:45:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:45:08,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-08 09:45:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:09,578 INFO L225 Difference]: With dead ends: 468057 [2019-09-08 09:45:09,578 INFO L226 Difference]: Without dead ends: 373565 [2019-09-08 09:45:09,722 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 09:45:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373565 states. [2019-09-08 09:45:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373565 to 291103. [2019-09-08 09:45:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291103 states. [2019-09-08 09:45:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291103 states to 291103 states and 466630 transitions. [2019-09-08 09:45:35,181 INFO L78 Accepts]: Start accepts. Automaton has 291103 states and 466630 transitions. Word has length 155 [2019-09-08 09:45:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:35,182 INFO L475 AbstractCegarLoop]: Abstraction has 291103 states and 466630 transitions. [2019-09-08 09:45:35,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:45:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 291103 states and 466630 transitions. [2019-09-08 09:45:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:45:35,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:35,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:35,188 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 425326210, now seen corresponding path program 1 times [2019-09-08 09:45:35,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:35,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:35,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:35,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 09:45:35,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:35,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:45:35,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:45:35,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:45:35,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:45:35,368 INFO L87 Difference]: Start difference. First operand 291103 states and 466630 transitions. Second operand 6 states. [2019-09-08 09:46:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:02,011 INFO L93 Difference]: Finished difference Result 493069 states and 793363 transitions. [2019-09-08 09:46:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:46:02,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-08 09:46:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:02,760 INFO L225 Difference]: With dead ends: 493069 [2019-09-08 09:46:02,761 INFO L226 Difference]: Without dead ends: 398577 [2019-09-08 09:46:02,953 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 09:46:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398577 states. [2019-09-08 09:46:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398577 to 368761. [2019-09-08 09:46:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368761 states. [2019-09-08 09:46:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368761 states to 368761 states and 591186 transitions. [2019-09-08 09:46:37,865 INFO L78 Accepts]: Start accepts. Automaton has 368761 states and 591186 transitions. Word has length 155 [2019-09-08 09:46:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:37,866 INFO L475 AbstractCegarLoop]: Abstraction has 368761 states and 591186 transitions. [2019-09-08 09:46:37,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:46:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 368761 states and 591186 transitions. [2019-09-08 09:46:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:46:37,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:37,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:37,871 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash -679819982, now seen corresponding path program 1 times [2019-09-08 09:46:37,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:37,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:37,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:37,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:46:38,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:38,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:46:38,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:46:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:46:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:46:38,047 INFO L87 Difference]: Start difference. First operand 368761 states and 591186 transitions. Second operand 6 states. [2019-09-08 09:47:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:11,630 INFO L93 Difference]: Finished difference Result 533165 states and 857987 transitions. [2019-09-08 09:47:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:47:11,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-08 09:47:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:12,437 INFO L225 Difference]: With dead ends: 533165 [2019-09-08 09:47:12,437 INFO L226 Difference]: Without dead ends: 438673 [2019-09-08 09:47:12,604 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 09:47:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438673 states. [2019-09-08 09:47:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438673 to 414689. [2019-09-08 09:47:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414689 states. [2019-09-08 09:47:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414689 states to 414689 states and 665302 transitions. [2019-09-08 09:47:49,844 INFO L78 Accepts]: Start accepts. Automaton has 414689 states and 665302 transitions. Word has length 155 [2019-09-08 09:47:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:49,845 INFO L475 AbstractCegarLoop]: Abstraction has 414689 states and 665302 transitions. [2019-09-08 09:47:49,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:47:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 414689 states and 665302 transitions. [2019-09-08 09:47:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:47:49,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:49,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:49,851 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash 367259402, now seen corresponding path program 1 times [2019-09-08 09:47:49,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:49,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:49,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:49,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:49,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:47:50,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:50,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:47:50,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:47:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:47:50,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:47:50,008 INFO L87 Difference]: Start difference. First operand 414689 states and 665302 transitions. Second operand 6 states. [2019-09-08 09:48:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:31,531 INFO L93 Difference]: Finished difference Result 675611 states and 1090199 transitions. [2019-09-08 09:48:31,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:48:31,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-08 09:48:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:32,552 INFO L225 Difference]: With dead ends: 675611 [2019-09-08 09:48:32,552 INFO L226 Difference]: Without dead ends: 564657 [2019-09-08 09:48:32,717 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 09:48:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564657 states. [2019-09-08 09:49:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564657 to 508145. [2019-09-08 09:49:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508145 states. [2019-09-08 09:49:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508145 states to 508145 states and 816714 transitions. [2019-09-08 09:49:18,166 INFO L78 Accepts]: Start accepts. Automaton has 508145 states and 816714 transitions. Word has length 155 [2019-09-08 09:49:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:18,166 INFO L475 AbstractCegarLoop]: Abstraction has 508145 states and 816714 transitions. [2019-09-08 09:49:18,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:49:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 508145 states and 816714 transitions. [2019-09-08 09:49:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:49:18,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:18,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:18,173 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1566028748, now seen corresponding path program 1 times [2019-09-08 09:49:18,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:18,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:18,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:49:18,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:49:18,376 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 09:49:18,405 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 09:49:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:18,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 09:49:18,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:49:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:49:18,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:49:18,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 09:49:18,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 09:49:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 09:49:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:49:18,791 INFO L87 Difference]: Start difference. First operand 508145 states and 816714 transitions. Second operand 12 states. [2019-09-08 09:53:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:58,353 INFO L93 Difference]: Finished difference Result 3282935 states and 5343580 transitions. [2019-09-08 09:53:58,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 09:53:58,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2019-09-08 09:53:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted.