java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:51:17,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:51:17,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:51:17,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:51:17,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:51:17,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:51:17,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:51:17,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:51:17,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:51:17,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:51:17,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:51:17,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:51:17,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:51:17,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:51:17,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:51:17,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:51:17,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:51:17,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:51:17,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:51:17,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:51:17,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:51:17,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:51:17,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:51:17,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:51:17,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:51:17,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:51:17,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:51:17,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:51:17,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:51:17,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:51:17,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:51:17,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:51:17,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:51:17,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:51:17,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:51:17,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:51:17,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:51:17,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:51:17,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:51:17,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:51:17,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:51:17,387 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 12:51:17,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:51:17,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:51:17,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:51:17,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:51:17,409 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:51:17,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:51:17,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:51:17,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:51:17,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:51:17,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:51:17,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:51:17,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:51:17,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:51:17,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:51:17,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:51:17,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:51:17,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:51:17,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:51:17,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:51:17,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:51:17,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:51:17,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:51:17,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:51:17,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:51:17,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:51:17,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:51:17,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:51:17,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:51:17,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:51:17,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:51:17,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:51:17,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:51:17,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:51:17,474 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:51:17,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:51:17,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02676a436/3a2b1367ab614de6a38a79007650d399/FLAG1f1b72e96 [2019-09-08 12:51:18,055 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:51:18,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:51:18,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02676a436/3a2b1367ab614de6a38a79007650d399/FLAG1f1b72e96 [2019-09-08 12:51:18,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02676a436/3a2b1367ab614de6a38a79007650d399 [2019-09-08 12:51:18,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:51:18,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:51:18,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:51:18,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:51:18,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:51:18,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:51:18" (1/1) ... [2019-09-08 12:51:18,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb79357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:18, skipping insertion in model container [2019-09-08 12:51:18,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:51:18" (1/1) ... [2019-09-08 12:51:18,384 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:51:18,438 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:51:18,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:51:18,895 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:51:19,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:51:19,047 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:51:19,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19 WrapperNode [2019-09-08 12:51:19,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:51:19,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:51:19,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:51:19,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:51:19,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (1/1) ... [2019-09-08 12:51:19,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (1/1) ... [2019-09-08 12:51:19,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (1/1) ... [2019-09-08 12:51:19,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (1/1) ... [2019-09-08 12:51:19,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (1/1) ... [2019-09-08 12:51:19,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (1/1) ... [2019-09-08 12:51:19,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (1/1) ... [2019-09-08 12:51:19,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:51:19,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:51:19,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:51:19,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:51:19,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (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 12:51:19,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:51:19,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:51:19,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:51:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:51:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:51:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:51:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:51:19,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:51:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:51:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:51:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:51:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:51:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:51:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:51:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:51:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:51:19,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:51:19,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:51:20,212 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:51:20,212 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:51:20,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:51:20 BoogieIcfgContainer [2019-09-08 12:51:20,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:51:20,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:51:20,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:51:20,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:51:20,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:51:18" (1/3) ... [2019-09-08 12:51:20,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4b863e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:51:20, skipping insertion in model container [2019-09-08 12:51:20,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:51:19" (2/3) ... [2019-09-08 12:51:20,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4b863e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:51:20, skipping insertion in model container [2019-09-08 12:51:20,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:51:20" (3/3) ... [2019-09-08 12:51:20,226 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:51:20,237 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:51:20,256 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:51:20,275 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:51:20,307 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:51:20,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:51:20,308 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:51:20,308 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:51:20,309 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:51:20,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:51:20,309 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:51:20,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:51:20,310 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:51:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-09-08 12:51:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 12:51:20,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:20,340 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] [2019-09-08 12:51:20,342 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 586489149, now seen corresponding path program 1 times [2019-09-08 12:51:20,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:20,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:20,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:20,771 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 12:51:20,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:20,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:20,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:20,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:20,797 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-09-08 12:51:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:20,971 INFO L93 Difference]: Finished difference Result 324 states and 542 transitions. [2019-09-08 12:51:20,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:20,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 12:51:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:20,987 INFO L225 Difference]: With dead ends: 324 [2019-09-08 12:51:20,987 INFO L226 Difference]: Without dead ends: 223 [2019-09-08 12:51:20,991 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 12:51:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-08 12:51:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-08 12:51:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 12:51:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2019-09-08 12:51:21,058 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 60 [2019-09-08 12:51:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:21,059 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2019-09-08 12:51:21,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2019-09-08 12:51:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 12:51:21,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:21,063 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] [2019-09-08 12:51:21,063 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash 960046910, now seen corresponding path program 1 times [2019-09-08 12:51:21,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:21,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:21,202 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 12:51:21,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:21,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:21,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:21,206 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2019-09-08 12:51:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:21,298 INFO L93 Difference]: Finished difference Result 537 states and 867 transitions. [2019-09-08 12:51:21,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:21,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 12:51:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:21,307 INFO L225 Difference]: With dead ends: 537 [2019-09-08 12:51:21,307 INFO L226 Difference]: Without dead ends: 371 [2019-09-08 12:51:21,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 12:51:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-08 12:51:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2019-09-08 12:51:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-08 12:51:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 590 transitions. [2019-09-08 12:51:21,361 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 590 transitions. Word has length 62 [2019-09-08 12:51:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:21,361 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 590 transitions. [2019-09-08 12:51:21,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 590 transitions. [2019-09-08 12:51:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 12:51:21,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:21,366 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] [2019-09-08 12:51:21,366 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 319322495, now seen corresponding path program 1 times [2019-09-08 12:51:21,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:21,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:21,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:21,517 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 12:51:21,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:21,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:21,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:21,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:21,519 INFO L87 Difference]: Start difference. First operand 369 states and 590 transitions. Second operand 3 states. [2019-09-08 12:51:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:21,564 INFO L93 Difference]: Finished difference Result 965 states and 1568 transitions. [2019-09-08 12:51:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:21,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 12:51:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:21,570 INFO L225 Difference]: With dead ends: 965 [2019-09-08 12:51:21,570 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 12:51:21,572 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 12:51:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 12:51:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2019-09-08 12:51:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-09-08 12:51:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1046 transitions. [2019-09-08 12:51:21,609 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1046 transitions. Word has length 64 [2019-09-08 12:51:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:21,609 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1046 transitions. [2019-09-08 12:51:21,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1046 transitions. [2019-09-08 12:51:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:51:21,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:21,613 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] [2019-09-08 12:51:21,613 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:21,613 INFO L82 PathProgramCache]: Analyzing trace with hash -694013056, now seen corresponding path program 1 times [2019-09-08 12:51:21,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:21,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:21,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:21,798 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 12:51:21,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:21,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:21,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:21,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:21,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:21,800 INFO L87 Difference]: Start difference. First operand 649 states and 1046 transitions. Second operand 5 states. [2019-09-08 12:51:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:22,103 INFO L93 Difference]: Finished difference Result 2487 states and 4083 transitions. [2019-09-08 12:51:22,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:51:22,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 12:51:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:22,119 INFO L225 Difference]: With dead ends: 2487 [2019-09-08 12:51:22,119 INFO L226 Difference]: Without dead ends: 1893 [2019-09-08 12:51:22,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-09-08 12:51:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1413. [2019-09-08 12:51:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-09-08 12:51:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2310 transitions. [2019-09-08 12:51:22,226 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2310 transitions. Word has length 66 [2019-09-08 12:51:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:22,228 INFO L475 AbstractCegarLoop]: Abstraction has 1413 states and 2310 transitions. [2019-09-08 12:51:22,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2310 transitions. [2019-09-08 12:51:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 12:51:22,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:22,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:22,236 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:22,236 INFO L82 PathProgramCache]: Analyzing trace with hash -101178732, now seen corresponding path program 1 times [2019-09-08 12:51:22,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:22,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:22,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:22,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:22,369 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 12:51:22,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:22,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:51:22,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:51:22,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:51:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:51:22,372 INFO L87 Difference]: Start difference. First operand 1413 states and 2310 transitions. Second operand 6 states. [2019-09-08 12:51:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:22,844 INFO L93 Difference]: Finished difference Result 6353 states and 10423 transitions. [2019-09-08 12:51:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:51:22,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-08 12:51:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:22,872 INFO L225 Difference]: With dead ends: 6353 [2019-09-08 12:51:22,872 INFO L226 Difference]: Without dead ends: 4995 [2019-09-08 12:51:22,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-09-08 12:51:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4888. [2019-09-08 12:51:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-09-08 12:51:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 7991 transitions. [2019-09-08 12:51:23,160 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 7991 transitions. Word has length 67 [2019-09-08 12:51:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:23,162 INFO L475 AbstractCegarLoop]: Abstraction has 4888 states and 7991 transitions. [2019-09-08 12:51:23,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:51:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 7991 transitions. [2019-09-08 12:51:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:51:23,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:23,164 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] [2019-09-08 12:51:23,165 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:23,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:23,165 INFO L82 PathProgramCache]: Analyzing trace with hash 497091130, now seen corresponding path program 1 times [2019-09-08 12:51:23,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:23,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:23,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:23,233 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 12:51:23,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:23,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:23,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:23,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:23,235 INFO L87 Difference]: Start difference. First operand 4888 states and 7991 transitions. Second operand 3 states. [2019-09-08 12:51:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:23,633 INFO L93 Difference]: Finished difference Result 10864 states and 17837 transitions. [2019-09-08 12:51:23,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:23,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:51:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:23,671 INFO L225 Difference]: With dead ends: 10864 [2019-09-08 12:51:23,671 INFO L226 Difference]: Without dead ends: 7331 [2019-09-08 12:51:23,681 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 12:51:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-09-08 12:51:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7329. [2019-09-08 12:51:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7329 states. [2019-09-08 12:51:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 11952 transitions. [2019-09-08 12:51:24,161 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 11952 transitions. Word has length 68 [2019-09-08 12:51:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:24,162 INFO L475 AbstractCegarLoop]: Abstraction has 7329 states and 11952 transitions. [2019-09-08 12:51:24,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 11952 transitions. [2019-09-08 12:51:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:51:24,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:24,164 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] [2019-09-08 12:51:24,164 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash -440955688, now seen corresponding path program 1 times [2019-09-08 12:51:24,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:24,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:24,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:24,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:24,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:24,250 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 12:51:24,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:24,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:24,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:24,253 INFO L87 Difference]: Start difference. First operand 7329 states and 11952 transitions. Second operand 3 states. [2019-09-08 12:51:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:24,747 INFO L93 Difference]: Finished difference Result 15243 states and 24893 transitions. [2019-09-08 12:51:24,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:24,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:51:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:24,845 INFO L225 Difference]: With dead ends: 15243 [2019-09-08 12:51:24,846 INFO L226 Difference]: Without dead ends: 10449 [2019-09-08 12:51:24,864 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 12:51:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10449 states. [2019-09-08 12:51:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10449 to 10447. [2019-09-08 12:51:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10447 states. [2019-09-08 12:51:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10447 states to 10447 states and 16947 transitions. [2019-09-08 12:51:25,697 INFO L78 Accepts]: Start accepts. Automaton has 10447 states and 16947 transitions. Word has length 68 [2019-09-08 12:51:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:25,698 INFO L475 AbstractCegarLoop]: Abstraction has 10447 states and 16947 transitions. [2019-09-08 12:51:25,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 10447 states and 16947 transitions. [2019-09-08 12:51:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:51:25,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:25,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:25,701 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1101374151, now seen corresponding path program 1 times [2019-09-08 12:51:25,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:25,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:25,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:25,849 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 12:51:25,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:25,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:51:25,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:51:25,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:51:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:51:25,852 INFO L87 Difference]: Start difference. First operand 10447 states and 16947 transitions. Second operand 4 states. [2019-09-08 12:51:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:26,767 INFO L93 Difference]: Finished difference Result 25147 states and 40843 transitions. [2019-09-08 12:51:26,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:51:26,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-08 12:51:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:26,821 INFO L225 Difference]: With dead ends: 25147 [2019-09-08 12:51:26,822 INFO L226 Difference]: Without dead ends: 15089 [2019-09-08 12:51:26,853 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 12:51:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15089 states. [2019-09-08 12:51:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15089 to 15045. [2019-09-08 12:51:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15045 states. [2019-09-08 12:51:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15045 states to 15045 states and 24350 transitions. [2019-09-08 12:51:28,186 INFO L78 Accepts]: Start accepts. Automaton has 15045 states and 24350 transitions. Word has length 68 [2019-09-08 12:51:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:28,186 INFO L475 AbstractCegarLoop]: Abstraction has 15045 states and 24350 transitions. [2019-09-08 12:51:28,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:51:28,187 INFO L276 IsEmpty]: Start isEmpty. Operand 15045 states and 24350 transitions. [2019-09-08 12:51:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:51:28,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:28,188 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] [2019-09-08 12:51:28,188 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1261589494, now seen corresponding path program 1 times [2019-09-08 12:51:28,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:28,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:28,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:28,241 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 12:51:28,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:28,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:28,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:28,243 INFO L87 Difference]: Start difference. First operand 15045 states and 24350 transitions. Second operand 3 states. [2019-09-08 12:51:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:28,998 INFO L93 Difference]: Finished difference Result 29969 states and 48560 transitions. [2019-09-08 12:51:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:28,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:51:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:29,052 INFO L225 Difference]: With dead ends: 29969 [2019-09-08 12:51:29,052 INFO L226 Difference]: Without dead ends: 20464 [2019-09-08 12:51:29,076 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 12:51:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20464 states. [2019-09-08 12:51:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20464 to 20462. [2019-09-08 12:51:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20462 states. [2019-09-08 12:51:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 32894 transitions. [2019-09-08 12:51:29,965 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 32894 transitions. Word has length 68 [2019-09-08 12:51:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:29,966 INFO L475 AbstractCegarLoop]: Abstraction has 20462 states and 32894 transitions. [2019-09-08 12:51:29,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 32894 transitions. [2019-09-08 12:51:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 12:51:29,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:29,968 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] [2019-09-08 12:51:29,968 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash -269634117, now seen corresponding path program 1 times [2019-09-08 12:51:29,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:29,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:29,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:29,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:29,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:30,063 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 12:51:30,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:30,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:51:30,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:51:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:51:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:51:30,066 INFO L87 Difference]: Start difference. First operand 20462 states and 32894 transitions. Second operand 4 states. [2019-09-08 12:51:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:32,511 INFO L93 Difference]: Finished difference Result 66043 states and 106323 transitions. [2019-09-08 12:51:32,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:51:32,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 12:51:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:32,627 INFO L225 Difference]: With dead ends: 66043 [2019-09-08 12:51:32,628 INFO L226 Difference]: Without dead ends: 45670 [2019-09-08 12:51:32,671 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 12:51:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45670 states. [2019-09-08 12:51:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45670 to 30643. [2019-09-08 12:51:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30643 states. [2019-09-08 12:51:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30643 states to 30643 states and 49101 transitions. [2019-09-08 12:51:34,033 INFO L78 Accepts]: Start accepts. Automaton has 30643 states and 49101 transitions. Word has length 69 [2019-09-08 12:51:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:34,034 INFO L475 AbstractCegarLoop]: Abstraction has 30643 states and 49101 transitions. [2019-09-08 12:51:34,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:51:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 30643 states and 49101 transitions. [2019-09-08 12:51:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 12:51:34,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:34,035 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] [2019-09-08 12:51:34,035 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1384982603, now seen corresponding path program 1 times [2019-09-08 12:51:34,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:34,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:34,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:34,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:34,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:34,154 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 12:51:34,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:34,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:34,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:34,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:34,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:34,156 INFO L87 Difference]: Start difference. First operand 30643 states and 49101 transitions. Second operand 5 states. [2019-09-08 12:51:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:35,302 INFO L93 Difference]: Finished difference Result 61203 states and 98082 transitions. [2019-09-08 12:51:35,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:35,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 12:51:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:35,384 INFO L225 Difference]: With dead ends: 61203 [2019-09-08 12:51:35,385 INFO L226 Difference]: Without dead ends: 30649 [2019-09-08 12:51:35,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30649 states. [2019-09-08 12:51:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30649 to 30643. [2019-09-08 12:51:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30643 states. [2019-09-08 12:51:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30643 states to 30643 states and 48966 transitions. [2019-09-08 12:51:37,337 INFO L78 Accepts]: Start accepts. Automaton has 30643 states and 48966 transitions. Word has length 71 [2019-09-08 12:51:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:37,338 INFO L475 AbstractCegarLoop]: Abstraction has 30643 states and 48966 transitions. [2019-09-08 12:51:37,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30643 states and 48966 transitions. [2019-09-08 12:51:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:51:37,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:37,339 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] [2019-09-08 12:51:37,339 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:37,340 INFO L82 PathProgramCache]: Analyzing trace with hash 511361176, now seen corresponding path program 1 times [2019-09-08 12:51:37,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:37,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:37,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:37,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:37,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:37,493 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 12:51:37,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:37,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:37,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:37,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:37,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:37,495 INFO L87 Difference]: Start difference. First operand 30643 states and 48966 transitions. Second operand 5 states. [2019-09-08 12:51:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:39,382 INFO L93 Difference]: Finished difference Result 99869 states and 159985 transitions. [2019-09-08 12:51:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:39,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 12:51:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:39,563 INFO L225 Difference]: With dead ends: 99869 [2019-09-08 12:51:39,564 INFO L226 Difference]: Without dead ends: 69315 [2019-09-08 12:51:39,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69315 states. [2019-09-08 12:51:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69315 to 43971. [2019-09-08 12:51:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43971 states. [2019-09-08 12:51:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43971 states to 43971 states and 70017 transitions. [2019-09-08 12:51:42,630 INFO L78 Accepts]: Start accepts. Automaton has 43971 states and 70017 transitions. Word has length 74 [2019-09-08 12:51:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:42,630 INFO L475 AbstractCegarLoop]: Abstraction has 43971 states and 70017 transitions. [2019-09-08 12:51:42,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 43971 states and 70017 transitions. [2019-09-08 12:51:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:51:42,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:42,631 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] [2019-09-08 12:51:42,631 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1329582040, now seen corresponding path program 1 times [2019-09-08 12:51:42,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:42,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:42,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:42,724 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 12:51:42,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:42,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:42,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:42,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:42,726 INFO L87 Difference]: Start difference. First operand 43971 states and 70017 transitions. Second operand 5 states. [2019-09-08 12:51:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:46,968 INFO L93 Difference]: Finished difference Result 77784 states and 123191 transitions. [2019-09-08 12:51:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:51:46,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 12:51:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:47,094 INFO L225 Difference]: With dead ends: 77784 [2019-09-08 12:51:47,094 INFO L226 Difference]: Without dead ends: 77782 [2019-09-08 12:51:47,115 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 12:51:47,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77782 states. [2019-09-08 12:51:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77782 to 44987. [2019-09-08 12:51:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44987 states. [2019-09-08 12:51:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44987 states to 44987 states and 71024 transitions. [2019-09-08 12:51:49,091 INFO L78 Accepts]: Start accepts. Automaton has 44987 states and 71024 transitions. Word has length 75 [2019-09-08 12:51:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:49,092 INFO L475 AbstractCegarLoop]: Abstraction has 44987 states and 71024 transitions. [2019-09-08 12:51:49,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 44987 states and 71024 transitions. [2019-09-08 12:51:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:51:49,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:49,096 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:49,096 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash 933476449, now seen corresponding path program 1 times [2019-09-08 12:51:49,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:49,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:49,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:49,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:49,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:49,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:51:49,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:51:49,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:51:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:51:49,167 INFO L87 Difference]: Start difference. First operand 44987 states and 71024 transitions. Second operand 3 states. [2019-09-08 12:51:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:50,712 INFO L93 Difference]: Finished difference Result 82010 states and 129618 transitions. [2019-09-08 12:51:50,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:51:50,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 12:51:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:50,761 INFO L225 Difference]: With dead ends: 82010 [2019-09-08 12:51:50,761 INFO L226 Difference]: Without dead ends: 37112 [2019-09-08 12:51:50,803 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 12:51:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37112 states. [2019-09-08 12:51:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37112 to 37049. [2019-09-08 12:51:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37049 states. [2019-09-08 12:51:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37049 states to 37049 states and 58270 transitions. [2019-09-08 12:51:53,360 INFO L78 Accepts]: Start accepts. Automaton has 37049 states and 58270 transitions. Word has length 99 [2019-09-08 12:51:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:53,360 INFO L475 AbstractCegarLoop]: Abstraction has 37049 states and 58270 transitions. [2019-09-08 12:51:53,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:51:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 37049 states and 58270 transitions. [2019-09-08 12:51:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:51:53,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:53,362 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:53,363 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash -4570369, now seen corresponding path program 1 times [2019-09-08 12:51:53,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:53,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:53,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:53,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:53,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:51:53,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:53,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:51:53,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:51:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:51:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:53,456 INFO L87 Difference]: Start difference. First operand 37049 states and 58270 transitions. Second operand 5 states. [2019-09-08 12:51:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:55,437 INFO L93 Difference]: Finished difference Result 54485 states and 85744 transitions. [2019-09-08 12:51:55,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:51:55,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 12:51:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:55,486 INFO L225 Difference]: With dead ends: 54485 [2019-09-08 12:51:55,486 INFO L226 Difference]: Without dead ends: 42027 [2019-09-08 12:51:55,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:51:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42027 states. [2019-09-08 12:51:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42027 to 42021. [2019-09-08 12:51:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42021 states. [2019-09-08 12:51:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42021 states to 42021 states and 66022 transitions. [2019-09-08 12:51:57,249 INFO L78 Accepts]: Start accepts. Automaton has 42021 states and 66022 transitions. Word has length 99 [2019-09-08 12:51:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:57,249 INFO L475 AbstractCegarLoop]: Abstraction has 42021 states and 66022 transitions. [2019-09-08 12:51:57,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:51:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 42021 states and 66022 transitions. [2019-09-08 12:51:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:51:57,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:57,252 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:57,252 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:57,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1524668658, now seen corresponding path program 1 times [2019-09-08 12:51:57,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:57,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:57,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:57,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:57,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:57,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:51:57,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:51:57,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:57,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:51:57,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:51:57,654 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 12:51:57,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:51:57,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:51:57,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:51:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:51:57,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:51:57,662 INFO L87 Difference]: Start difference. First operand 42021 states and 66022 transitions. Second operand 8 states. [2019-09-08 12:52:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:02,574 INFO L93 Difference]: Finished difference Result 66552 states and 105201 transitions. [2019-09-08 12:52:02,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:52:02,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-09-08 12:52:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:02,784 INFO L225 Difference]: With dead ends: 66552 [2019-09-08 12:52:02,784 INFO L226 Difference]: Without dead ends: 51812 [2019-09-08 12:52:02,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:52:02,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51812 states. [2019-09-08 12:52:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51812 to 48626. [2019-09-08 12:52:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48626 states. [2019-09-08 12:52:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48626 states to 48626 states and 76395 transitions. [2019-09-08 12:52:05,626 INFO L78 Accepts]: Start accepts. Automaton has 48626 states and 76395 transitions. Word has length 100 [2019-09-08 12:52:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:05,626 INFO L475 AbstractCegarLoop]: Abstraction has 48626 states and 76395 transitions. [2019-09-08 12:52:05,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:52:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 48626 states and 76395 transitions. [2019-09-08 12:52:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:52:05,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:05,629 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:05,629 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 804974626, now seen corresponding path program 1 times [2019-09-08 12:52:05,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:05,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:52:05,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:05,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:52:05,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:52:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:52:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:52:05,817 INFO L87 Difference]: Start difference. First operand 48626 states and 76395 transitions. Second operand 4 states. [2019-09-08 12:52:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:09,695 INFO L93 Difference]: Finished difference Result 118830 states and 187247 transitions. [2019-09-08 12:52:09,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:52:09,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-08 12:52:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:09,886 INFO L225 Difference]: With dead ends: 118830 [2019-09-08 12:52:09,886 INFO L226 Difference]: Without dead ends: 89370 [2019-09-08 12:52:09,931 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 12:52:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89370 states. [2019-09-08 12:52:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89370 to 76986. [2019-09-08 12:52:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76986 states. [2019-09-08 12:52:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76986 states to 76986 states and 120966 transitions. [2019-09-08 12:52:13,532 INFO L78 Accepts]: Start accepts. Automaton has 76986 states and 120966 transitions. Word has length 100 [2019-09-08 12:52:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:13,533 INFO L475 AbstractCegarLoop]: Abstraction has 76986 states and 120966 transitions. [2019-09-08 12:52:13,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:52:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76986 states and 120966 transitions. [2019-09-08 12:52:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:52:13,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:13,536 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:13,537 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash 208362873, now seen corresponding path program 1 times [2019-09-08 12:52:13,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:13,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:13,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:13,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:13,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:13,854 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 12:52:13,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:13,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:52:13,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:52:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:52:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:52:13,856 INFO L87 Difference]: Start difference. First operand 76986 states and 120966 transitions. Second operand 6 states. [2019-09-08 12:52:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:22,910 INFO L93 Difference]: Finished difference Result 218149 states and 340802 transitions. [2019-09-08 12:52:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:52:22,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-08 12:52:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:23,221 INFO L225 Difference]: With dead ends: 218149 [2019-09-08 12:52:23,221 INFO L226 Difference]: Without dead ends: 171466 [2019-09-08 12:52:23,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:52:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171466 states. [2019-09-08 12:52:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171466 to 120946. [2019-09-08 12:52:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120946 states. [2019-09-08 12:52:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120946 states to 120946 states and 189752 transitions. [2019-09-08 12:52:30,111 INFO L78 Accepts]: Start accepts. Automaton has 120946 states and 189752 transitions. Word has length 101 [2019-09-08 12:52:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:30,111 INFO L475 AbstractCegarLoop]: Abstraction has 120946 states and 189752 transitions. [2019-09-08 12:52:30,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:52:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 120946 states and 189752 transitions. [2019-09-08 12:52:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:52:30,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:30,113 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:30,113 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1822702067, now seen corresponding path program 1 times [2019-09-08 12:52:30,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:30,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:30,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:30,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:30,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:52:30,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:30,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:52:30,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:52:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:52:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:52:30,181 INFO L87 Difference]: Start difference. First operand 120946 states and 189752 transitions. Second operand 3 states. [2019-09-08 12:52:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:41,497 INFO L93 Difference]: Finished difference Result 278532 states and 439157 transitions. [2019-09-08 12:52:41,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:52:41,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 12:52:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:41,814 INFO L225 Difference]: With dead ends: 278532 [2019-09-08 12:52:41,814 INFO L226 Difference]: Without dead ends: 203380 [2019-09-08 12:52:41,900 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 12:52:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203380 states. [2019-09-08 12:52:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203380 to 203084. [2019-09-08 12:52:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203084 states. [2019-09-08 12:52:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203084 states to 203084 states and 319311 transitions. [2019-09-08 12:52:55,393 INFO L78 Accepts]: Start accepts. Automaton has 203084 states and 319311 transitions. Word has length 101 [2019-09-08 12:52:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:55,394 INFO L475 AbstractCegarLoop]: Abstraction has 203084 states and 319311 transitions. [2019-09-08 12:52:55,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:52:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 203084 states and 319311 transitions. [2019-09-08 12:52:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:52:55,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:55,396 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:55,396 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1773384172, now seen corresponding path program 1 times [2019-09-08 12:52:55,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:55,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:55,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:55,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:55,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:55,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:55,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:52:55,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:52:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:52:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:52:55,474 INFO L87 Difference]: Start difference. First operand 203084 states and 319311 transitions. Second operand 3 states. [2019-09-08 12:53:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:19,785 INFO L93 Difference]: Finished difference Result 596757 states and 937249 transitions. [2019-09-08 12:53:19,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:53:19,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 12:53:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:20,480 INFO L225 Difference]: With dead ends: 596757 [2019-09-08 12:53:20,481 INFO L226 Difference]: Without dead ends: 393764 [2019-09-08 12:53:21,321 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 12:53:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393764 states. [2019-09-08 12:53:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393764 to 393762. [2019-09-08 12:53:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393762 states. [2019-09-08 12:53:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393762 states to 393762 states and 614160 transitions. [2019-09-08 12:53:52,103 INFO L78 Accepts]: Start accepts. Automaton has 393762 states and 614160 transitions. Word has length 102 [2019-09-08 12:53:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:52,103 INFO L475 AbstractCegarLoop]: Abstraction has 393762 states and 614160 transitions. [2019-09-08 12:53:52,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:53:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 393762 states and 614160 transitions. [2019-09-08 12:53:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:53:52,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:52,106 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:52,106 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1305809290, now seen corresponding path program 1 times [2019-09-08 12:53:52,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:52,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:52,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:52,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:53:52,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:53:52,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:53:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:53:52,167 INFO L87 Difference]: Start difference. First operand 393762 states and 614160 transitions. Second operand 3 states. [2019-09-08 12:54:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:49,570 INFO L93 Difference]: Finished difference Result 1157984 states and 1803808 transitions. [2019-09-08 12:54:49,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:49,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 12:54:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:50,900 INFO L225 Difference]: With dead ends: 1157984 [2019-09-08 12:54:50,901 INFO L226 Difference]: Without dead ends: 764355 [2019-09-08 12:54:51,244 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 12:54:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764355 states. [2019-09-08 12:55:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764355 to 764353. [2019-09-08 12:55:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764353 states. [2019-09-08 12:55:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764353 states to 764353 states and 1182353 transitions. [2019-09-08 12:55:57,251 INFO L78 Accepts]: Start accepts. Automaton has 764353 states and 1182353 transitions. Word has length 102 [2019-09-08 12:55:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:57,251 INFO L475 AbstractCegarLoop]: Abstraction has 764353 states and 1182353 transitions. [2019-09-08 12:55:57,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 764353 states and 1182353 transitions. [2019-09-08 12:55:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:55:57,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:57,254 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:57,254 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:57,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash -691670394, now seen corresponding path program 1 times [2019-09-08 12:55:57,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:57,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 12:55:57,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:57,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:57,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:57,316 INFO L87 Difference]: Start difference. First operand 764353 states and 1182353 transitions. Second operand 3 states. [2019-09-08 12:57:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:27,240 INFO L93 Difference]: Finished difference Result 1893337 states and 2931155 transitions. [2019-09-08 12:57:27,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:27,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 12:57:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:29,291 INFO L225 Difference]: With dead ends: 1893337 [2019-09-08 12:57:29,292 INFO L226 Difference]: Without dead ends: 1129239 [2019-09-08 12:57:29,815 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 12:57:31,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129239 states. [2019-09-08 12:58:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129239 to 772169. [2019-09-08 12:58:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772169 states. [2019-09-08 12:58:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772169 states to 772169 states and 1194071 transitions. [2019-09-08 12:58:53,360 INFO L78 Accepts]: Start accepts. Automaton has 772169 states and 1194071 transitions. Word has length 103 [2019-09-08 12:58:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:53,360 INFO L475 AbstractCegarLoop]: Abstraction has 772169 states and 1194071 transitions. [2019-09-08 12:58:53,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 772169 states and 1194071 transitions. [2019-09-08 12:58:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:58:53,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:53,363 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:53,363 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 72277878, now seen corresponding path program 1 times [2019-09-08 12:58:53,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:53,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:53,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:58:53,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:53,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:53,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:53,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:53,425 INFO L87 Difference]: Start difference. First operand 772169 states and 1194071 transitions. Second operand 3 states. [2019-09-08 13:00:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:32,348 INFO L93 Difference]: Finished difference Result 1904015 states and 2958191 transitions. [2019-09-08 13:00:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:00:32,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 13:00:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:34,465 INFO L225 Difference]: With dead ends: 1904015 [2019-09-08 13:00:34,466 INFO L226 Difference]: Without dead ends: 1132155 [2019-09-08 13:00:35,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:00:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132155 states.