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.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:51:25,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:51:25,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:51:25,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:51:25,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:51:25,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:51:25,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:51:25,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:51:25,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:51:25,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:51:25,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:51:25,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:51:25,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:51:25,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:51:25,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:51:25,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:51:25,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:51:25,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:51:25,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:51:25,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:51:25,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:51:25,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:51:25,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:51:25,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:51:25,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:51:25,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:51:25,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:51:25,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:51:25,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:51:25,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:51:25,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:51:25,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:51:25,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:51:25,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:51:25,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:51:25,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:51:25,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:51:25,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:51:25,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:51:25,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:51:25,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:51:25,317 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:51:25,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:51:25,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:51:25,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:51:25,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:51:25,333 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:51:25,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:51:25,333 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:51:25,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:51:25,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:51:25,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:51:25,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:51:25,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:51:25,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:51:25,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:51:25,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:51:25,335 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:51:25,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:51:25,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:51:25,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:51:25,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:51:25,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:51:25,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:51:25,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:51:25,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:51:25,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:51:25,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:51:25,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:51:25,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:51:25,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:51:25,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:51:25,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:51:25,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:51:25,389 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:51:25,390 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:51:25,390 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.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:51:25,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2423fa7/9879373b4cdc4ab690806fd56cd404d9/FLAG8027924c8 [2019-09-08 09:51:26,078 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:51:26,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:51:26,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2423fa7/9879373b4cdc4ab690806fd56cd404d9/FLAG8027924c8 [2019-09-08 09:51:26,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2423fa7/9879373b4cdc4ab690806fd56cd404d9 [2019-09-08 09:51:26,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:51:26,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:51:26,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:26,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:51:26,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:51:26,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:26" (1/1) ... [2019-09-08 09:51:26,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122e48ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:26, skipping insertion in model container [2019-09-08 09:51:26,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:26" (1/1) ... [2019-09-08 09:51:26,369 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:51:26,431 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:51:26,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:26,929 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:51:27,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:27,144 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:51:27,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27 WrapperNode [2019-09-08 09:51:27,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:27,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:51:27,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:51:27,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:51:27,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (1/1) ... [2019-09-08 09:51:27,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (1/1) ... [2019-09-08 09:51:27,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (1/1) ... [2019-09-08 09:51:27,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (1/1) ... [2019-09-08 09:51:27,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (1/1) ... [2019-09-08 09:51:27,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (1/1) ... [2019-09-08 09:51:27,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (1/1) ... [2019-09-08 09:51:27,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:51:27,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:51:27,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:51:27,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:51:27,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (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:51:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:51:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:51:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:51:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:51:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:51:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:51:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:51:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:51:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:51:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:51:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:51:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:51:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:51:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:51:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:51:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:51:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:51:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:51:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:51:28,940 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:51:28,942 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:51:28,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:28 BoogieIcfgContainer [2019-09-08 09:51:28,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:51:28,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:51:28,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:51:28,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:51:28,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:51:26" (1/3) ... [2019-09-08 09:51:28,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb917e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:28, skipping insertion in model container [2019-09-08 09:51:28,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:27" (2/3) ... [2019-09-08 09:51:28,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb917e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:28, skipping insertion in model container [2019-09-08 09:51:28,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:28" (3/3) ... [2019-09-08 09:51:28,955 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:51:28,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:51:28,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:51:29,004 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:51:29,051 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:51:29,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:51:29,052 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:51:29,052 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:51:29,052 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:51:29,052 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:51:29,053 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:51:29,053 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:51:29,053 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:51:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-08 09:51:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 09:51:29,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:29,113 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:51:29,115 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-08 09:51:29,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:29,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:29,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:29,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:29,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:29,756 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:51:29,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:29,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:29,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:29,784 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-08 09:51:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:29,952 INFO L93 Difference]: Finished difference Result 575 states and 998 transitions. [2019-09-08 09:51:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:29,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 09:51:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:29,979 INFO L225 Difference]: With dead ends: 575 [2019-09-08 09:51:29,980 INFO L226 Difference]: Without dead ends: 436 [2019-09-08 09:51:29,985 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:51:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-08 09:51:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-08 09:51:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 09:51:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-08 09:51:30,087 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-08 09:51:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:30,089 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-08 09:51:30,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-08 09:51:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:51:30,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:30,095 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:51:30,096 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-08 09:51:30,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:30,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:51:30,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:30,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:30,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:30,418 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-08 09:51:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:30,478 INFO L93 Difference]: Finished difference Result 664 states and 1109 transitions. [2019-09-08 09:51:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:30,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 09:51:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:30,486 INFO L225 Difference]: With dead ends: 664 [2019-09-08 09:51:30,486 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 09:51:30,491 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:51:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 09:51:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-08 09:51:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-08 09:51:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-08 09:51:30,537 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-08 09:51:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:30,538 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-08 09:51:30,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-08 09:51:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:51:30,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:30,542 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:51:30,542 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-08 09:51:30,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:30,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:30,717 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:51:30,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:30,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:30,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:30,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:30,720 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-08 09:51:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:30,782 INFO L93 Difference]: Finished difference Result 1188 states and 1989 transitions. [2019-09-08 09:51:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:30,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 09:51:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:30,796 INFO L225 Difference]: With dead ends: 1188 [2019-09-08 09:51:30,796 INFO L226 Difference]: Without dead ends: 848 [2019-09-08 09:51:30,800 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:51:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-08 09:51:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-08 09:51:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-08 09:51:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-08 09:51:30,852 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-08 09:51:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:30,853 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-08 09:51:30,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-08 09:51:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 09:51:30,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:30,859 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] [2019-09-08 09:51:30,859 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-08 09:51:30,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:30,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:30,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:30,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:51:30,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:30,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:30,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:30,992 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-08 09:51:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:31,084 INFO L93 Difference]: Finished difference Result 1466 states and 2456 transitions. [2019-09-08 09:51:31,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:31,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 09:51:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:31,093 INFO L225 Difference]: With dead ends: 1466 [2019-09-08 09:51:31,093 INFO L226 Difference]: Without dead ends: 1126 [2019-09-08 09:51:31,095 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:51:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-08 09:51:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-08 09:51:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-08 09:51:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-08 09:51:31,142 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-08 09:51:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:31,142 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-08 09:51:31,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-08 09:51:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 09:51:31,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:31,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, 1, 1, 1, 1] [2019-09-08 09:51:31,145 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-08 09:51:31,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:31,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:31,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:31,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:31,260 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:51:31,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:31,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:31,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:31,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:31,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:31,262 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-08 09:51:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:31,376 INFO L93 Difference]: Finished difference Result 2865 states and 4791 transitions. [2019-09-08 09:51:31,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:31,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 09:51:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:31,395 INFO L225 Difference]: With dead ends: 2865 [2019-09-08 09:51:31,395 INFO L226 Difference]: Without dead ends: 1954 [2019-09-08 09:51:31,399 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:51:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-08 09:51:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-08 09:51:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-08 09:51:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-08 09:51:31,514 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-08 09:51:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:31,515 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-08 09:51:31,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-08 09:51:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:51:31,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:31,518 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:51:31,518 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-08 09:51:31,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:31,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:31,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:31,716 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:51:31,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:31,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:31,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:31,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:31,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:31,718 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-08 09:51:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:31,841 INFO L93 Difference]: Finished difference Result 3558 states and 5947 transitions. [2019-09-08 09:51:31,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:31,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 09:51:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:31,858 INFO L225 Difference]: With dead ends: 3558 [2019-09-08 09:51:31,858 INFO L226 Difference]: Without dead ends: 2647 [2019-09-08 09:51:31,862 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:51:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-08 09:51:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-08 09:51:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-08 09:51:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-08 09:51:31,997 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-08 09:51:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:31,999 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-08 09:51:31,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-08 09:51:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:51:32,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:32,002 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:51:32,002 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-08 09:51:32,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:32,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:32,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:32,171 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:51:32,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:32,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:32,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:32,174 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-08 09:51:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:32,491 INFO L93 Difference]: Finished difference Result 7230 states and 12009 transitions. [2019-09-08 09:51:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:32,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 09:51:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:32,532 INFO L225 Difference]: With dead ends: 7230 [2019-09-08 09:51:32,532 INFO L226 Difference]: Without dead ends: 4816 [2019-09-08 09:51:32,543 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:51:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-08 09:51:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-08 09:51:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-08 09:51:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-08 09:51:32,869 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-08 09:51:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:32,870 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-08 09:51:32,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-08 09:51:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 09:51:32,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:32,873 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:32,873 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-08 09:51:32,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:32,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:33,110 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:51:33,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:33,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:51:33,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:51:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:51:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:51:33,112 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-08 09:51:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:34,786 INFO L93 Difference]: Finished difference Result 28885 states and 48038 transitions. [2019-09-08 09:51:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:51:34,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 09:51:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:34,925 INFO L225 Difference]: With dead ends: 28885 [2019-09-08 09:51:34,925 INFO L226 Difference]: Without dead ends: 24302 [2019-09-08 09:51:34,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:51:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-08 09:51:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-08 09:51:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-08 09:51:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-08 09:51:35,781 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-08 09:51:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:35,781 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-08 09:51:35,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:51:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-08 09:51:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:51:35,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:35,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:35,784 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-08 09:51:35,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:35,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:35,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:35,928 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:51:35,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:35,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:35,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:35,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:35,930 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-08 09:51:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:37,026 INFO L93 Difference]: Finished difference Result 27309 states and 45168 transitions. [2019-09-08 09:51:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:37,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 09:51:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:37,083 INFO L225 Difference]: With dead ends: 27309 [2019-09-08 09:51:37,083 INFO L226 Difference]: Without dead ends: 18232 [2019-09-08 09:51:37,109 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:51:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-08 09:51:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-08 09:51:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-08 09:51:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-08 09:51:38,580 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-08 09:51:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:38,580 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-08 09:51:38,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-08 09:51:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:51:38,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:38,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:38,583 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:38,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:38,583 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-08 09:51:38,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:38,683 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:51:38,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:38,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:38,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:38,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:38,685 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-08 09:51:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:39,895 INFO L93 Difference]: Finished difference Result 28841 states and 47657 transitions. [2019-09-08 09:51:39,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:39,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 09:51:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:39,950 INFO L225 Difference]: With dead ends: 28841 [2019-09-08 09:51:39,951 INFO L226 Difference]: Without dead ends: 20841 [2019-09-08 09:51:39,975 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:51:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-08 09:51:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-08 09:51:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-08 09:51:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-08 09:51:40,926 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-08 09:51:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:40,927 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-08 09:51:40,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-08 09:51:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:51:40,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:40,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:40,929 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-08 09:51:40,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:40,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:40,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:40,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:40,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:41,031 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:51:41,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:41,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:41,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:41,033 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-08 09:51:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:43,384 INFO L93 Difference]: Finished difference Result 60941 states and 100477 transitions. [2019-09-08 09:51:43,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:43,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 09:51:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:43,494 INFO L225 Difference]: With dead ends: 60941 [2019-09-08 09:51:43,494 INFO L226 Difference]: Without dead ends: 40351 [2019-09-08 09:51:43,543 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:51:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-08 09:51:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-08 09:51:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-08 09:51:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-08 09:51:45,239 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-08 09:51:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:45,239 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-08 09:51:45,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-08 09:51:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 09:51:45,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:45,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:45,242 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-08 09:51:45,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:45,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:45,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:45,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:45,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:51:45,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:45,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:45,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:45,339 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-08 09:51:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:48,801 INFO L93 Difference]: Finished difference Result 98585 states and 162103 transitions. [2019-09-08 09:51:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:48,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-08 09:51:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:48,932 INFO L225 Difference]: With dead ends: 98585 [2019-09-08 09:51:48,932 INFO L226 Difference]: Without dead ends: 64914 [2019-09-08 09:51:49,000 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:51:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-08 09:51:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-08 09:51:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-08 09:51:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-08 09:51:51,377 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-08 09:51:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:51,378 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-08 09:51:51,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-08 09:51:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 09:51:51,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:51,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:51,380 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-08 09:51:51,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:51,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:51,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:51,520 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:51:51,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:51,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 09:51:51,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:51:51,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:51:51,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:51:51,522 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-08 09:52:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:02,784 INFO L93 Difference]: Finished difference Result 266912 states and 437681 transitions. [2019-09-08 09:52:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 09:52:02,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-08 09:52:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:03,159 INFO L225 Difference]: With dead ends: 266912 [2019-09-08 09:52:03,160 INFO L226 Difference]: Without dead ends: 212252 [2019-09-08 09:52:03,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 09:52:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-08 09:52:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-08 09:52:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 09:52:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-08 09:52:13,542 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-08 09:52:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:13,543 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-08 09:52:13,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:52:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-08 09:52:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 09:52:13,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:13,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:13,544 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-08 09:52:13,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:13,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:13,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:13,838 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:52:13,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:13,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:52:13,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:52:13,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:52:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:52:13,840 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-08 09:52:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:26,716 INFO L93 Difference]: Finished difference Result 353665 states and 575236 transitions. [2019-09-08 09:52:26,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:52:26,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-08 09:52:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:27,053 INFO L225 Difference]: With dead ends: 353665 [2019-09-08 09:52:27,053 INFO L226 Difference]: Without dead ends: 205422 [2019-09-08 09:52:27,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:52:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-08 09:52:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-08 09:52:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 09:52:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-08 09:52:38,755 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-08 09:52:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:38,756 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-08 09:52:38,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:52:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-08 09:52:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 09:52:38,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:38,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:38,757 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:38,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-08 09:52:38,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:38,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:39,031 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:52:39,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:39,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:52:39,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:52:39,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:52:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:52:39,033 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-08 09:52:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:57,998 INFO L93 Difference]: Finished difference Result 436044 states and 707875 transitions. [2019-09-08 09:52:57,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:52:57,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-08 09:52:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:58,456 INFO L225 Difference]: With dead ends: 436044 [2019-09-08 09:52:58,456 INFO L226 Difference]: Without dead ends: 287801 [2019-09-08 09:52:58,592 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:52:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-08 09:53:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-08 09:53:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-08 09:53:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-08 09:53:20,955 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-08 09:53:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:20,955 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-08 09:53:20,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:53:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-08 09:53:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 09:53:20,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:20,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:53:20,957 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-08 09:53:20,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:20,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:20,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:20,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:20,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:21,100 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:53:21,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:21,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:53:21,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:53:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:53:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:53:21,101 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-08 09:53:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:51,536 INFO L93 Difference]: Finished difference Result 473705 states and 763150 transitions. [2019-09-08 09:53:51,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:53:51,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-08 09:53:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:52,403 INFO L225 Difference]: With dead ends: 473705 [2019-09-08 09:53:52,404 INFO L226 Difference]: Without dead ends: 473703 [2019-09-08 09:53:52,505 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:53:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-08 09:54:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-08 09:54:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-08 09:54:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-08 09:54:26,056 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-08 09:54:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:26,057 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-08 09:54:26,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:54:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-08 09:54:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:54:26,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:26,068 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:26,069 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash 470040001, now seen corresponding path program 1 times [2019-09-08 09:54:26,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:26,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:26,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:26,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:26,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:54:26,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:26,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:26,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:26,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:26,179 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 3 states. [2019-09-08 09:55:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:01,627 INFO L93 Difference]: Finished difference Result 566313 states and 915402 transitions. [2019-09-08 09:55:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:01,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 09:55:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:02,402 INFO L225 Difference]: With dead ends: 566313 [2019-09-08 09:55:02,402 INFO L226 Difference]: Without dead ends: 461227 [2019-09-08 09:55:02,560 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:55:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461227 states. [2019-09-08 09:55:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461227 to 460488. [2019-09-08 09:55:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460488 states. [2019-09-08 09:55:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460488 states to 460488 states and 741577 transitions. [2019-09-08 09:55:42,404 INFO L78 Accepts]: Start accepts. Automaton has 460488 states and 741577 transitions. Word has length 167 [2019-09-08 09:55:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:42,404 INFO L475 AbstractCegarLoop]: Abstraction has 460488 states and 741577 transitions. [2019-09-08 09:55:42,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 460488 states and 741577 transitions. [2019-09-08 09:55:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:55:42,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:42,417 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:42,418 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-08 09:55:42,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:42,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:55:42,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:42,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:42,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:42,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:42,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:42,720 INFO L87 Difference]: Start difference. First operand 460488 states and 741577 transitions. Second operand 4 states. [2019-09-08 09:56:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:40,587 INFO L93 Difference]: Finished difference Result 924150 states and 1495845 transitions. [2019-09-08 09:56:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:56:40,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-08 09:56:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:41,953 INFO L225 Difference]: With dead ends: 924150 [2019-09-08 09:56:41,954 INFO L226 Difference]: Without dead ends: 730440 [2019-09-08 09:56:42,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730440 states. [2019-09-08 09:57:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730440 to 648322. [2019-09-08 09:57:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648322 states. [2019-09-08 09:57:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648322 states to 648322 states and 1046877 transitions. [2019-09-08 09:57:49,425 INFO L78 Accepts]: Start accepts. Automaton has 648322 states and 1046877 transitions. Word has length 167 [2019-09-08 09:57:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:49,425 INFO L475 AbstractCegarLoop]: Abstraction has 648322 states and 1046877 transitions. [2019-09-08 09:57:49,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 648322 states and 1046877 transitions. [2019-09-08 09:57:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:57:49,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:49,433 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:49,433 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-08 09:57:49,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:49,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:57:49,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:49,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:57:49,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:57:49,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:57:49,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:57:49,624 INFO L87 Difference]: Start difference. First operand 648322 states and 1046877 transitions. Second operand 6 states. [2019-09-08 09:59:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:20,380 INFO L93 Difference]: Finished difference Result 1304494 states and 2119152 transitions. [2019-09-08 09:59:20,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:59:20,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 09:59:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:22,123 INFO L225 Difference]: With dead ends: 1304494 [2019-09-08 09:59:22,123 INFO L226 Difference]: Without dead ends: 954587 [2019-09-08 09:59:22,532 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:59:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954587 states. [2019-09-08 10:00:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954587 to 803425. [2019-09-08 10:00:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803425 states. [2019-09-08 10:00:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803425 states to 803425 states and 1297607 transitions. [2019-09-08 10:00:51,985 INFO L78 Accepts]: Start accepts. Automaton has 803425 states and 1297607 transitions. Word has length 167 [2019-09-08 10:00:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:51,986 INFO L475 AbstractCegarLoop]: Abstraction has 803425 states and 1297607 transitions. [2019-09-08 10:00:51,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:00:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 803425 states and 1297607 transitions. [2019-09-08 10:00:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 10:00:51,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:51,993 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:00:51,993 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1361288056, now seen corresponding path program 1 times [2019-09-08 10:00:51,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:51,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:51,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:00:52,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:52,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:00:52,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:00:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:00:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:00:52,321 INFO L87 Difference]: Start difference. First operand 803425 states and 1297607 transitions. Second operand 4 states.