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/ssh-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:27,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:27,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:27,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:27,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:27,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:27,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:27,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:27,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:27,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:27,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:27,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:27,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:27,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:27,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:27,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:27,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:27,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:27,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:27,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:27,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:27,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:27,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:27,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:27,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:27,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:27,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:27,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:27,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:27,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:27,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:27,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:27,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:27,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:27,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:27,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:27,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:27,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:27,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:27,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:27,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:27,404 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-10-14 23:49:27,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:27,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:27,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:27,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:27,420 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:27,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:27,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:27,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:27,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:27,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:27,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:27,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:27,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:27,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:27,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:27,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:27,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:27,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:27,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:27,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:27,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:27,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:27,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:27,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:27,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:27,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:27,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:27,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:27,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:27,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:27,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:27,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:27,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:27,758 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:27,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-14 23:49:27,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59cf30a81/a49fe41d390148aaa272cc5da8da712e/FLAG8abb5bdbf [2019-10-14 23:49:28,365 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:28,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-14 23:49:28,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59cf30a81/a49fe41d390148aaa272cc5da8da712e/FLAG8abb5bdbf [2019-10-14 23:49:28,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59cf30a81/a49fe41d390148aaa272cc5da8da712e [2019-10-14 23:49:28,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:28,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:28,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:28,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:28,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:28,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:28" (1/1) ... [2019-10-14 23:49:28,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175279dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:28, skipping insertion in model container [2019-10-14 23:49:28,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:28" (1/1) ... [2019-10-14 23:49:28,718 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:28,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:29,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:29,084 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:29,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:29,289 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:29,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29 WrapperNode [2019-10-14 23:49:29,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:29,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:29,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:29,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:29,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (1/1) ... [2019-10-14 23:49:29,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (1/1) ... [2019-10-14 23:49:29,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (1/1) ... [2019-10-14 23:49:29,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (1/1) ... [2019-10-14 23:49:29,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (1/1) ... [2019-10-14 23:49:29,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (1/1) ... [2019-10-14 23:49:29,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (1/1) ... [2019-10-14 23:49:29,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:29,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:29,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:29,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:29,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (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-10-14 23:49:29,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:29,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-14 23:49:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-10-14 23:49:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:29,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:29,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:29,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-10-14 23:49:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-14 23:49:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:29,662 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:30,198 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-14 23:49:30,199 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-14 23:49:30,202 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:30,202 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:30,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:30 BoogieIcfgContainer [2019-10-14 23:49:30,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:30,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:30,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:30,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:30,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:28" (1/3) ... [2019-10-14 23:49:30,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1f5194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:30, skipping insertion in model container [2019-10-14 23:49:30,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:29" (2/3) ... [2019-10-14 23:49:30,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1f5194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:30, skipping insertion in model container [2019-10-14 23:49:30,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:30" (3/3) ... [2019-10-14 23:49:30,220 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-10-14 23:49:30,233 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:30,243 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:30,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:30,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:30,289 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:30,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:30,289 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:30,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:30,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:30,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:30,290 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-14 23:49:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:49:30,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:30,322 INFO L380 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] [2019-10-14 23:49:30,324 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1696698376, now seen corresponding path program 1 times [2019-10-14 23:49:30,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:30,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275175526] [2019-10-14 23:49:30,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:30,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275175526] [2019-10-14 23:49:30,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:30,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:30,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712137212] [2019-10-14 23:49:30,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:30,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:30,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:30,657 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-14 23:49:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:31,155 INFO L93 Difference]: Finished difference Result 345 states and 585 transitions. [2019-10-14 23:49:31,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:31,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-14 23:49:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:31,179 INFO L225 Difference]: With dead ends: 345 [2019-10-14 23:49:31,179 INFO L226 Difference]: Without dead ends: 183 [2019-10-14 23:49:31,188 INFO L600 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-10-14 23:49:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-14 23:49:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2019-10-14 23:49:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-14 23:49:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 284 transitions. [2019-10-14 23:49:31,284 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 284 transitions. Word has length 51 [2019-10-14 23:49:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:31,285 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 284 transitions. [2019-10-14 23:49:31,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 284 transitions. [2019-10-14 23:49:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 23:49:31,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:31,289 INFO L380 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] [2019-10-14 23:49:31,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 742008338, now seen corresponding path program 1 times [2019-10-14 23:49:31,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:31,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975596092] [2019-10-14 23:49:31,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:31,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975596092] [2019-10-14 23:49:31,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:31,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:31,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188586255] [2019-10-14 23:49:31,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:31,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:31,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:31,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:31,441 INFO L87 Difference]: Start difference. First operand 178 states and 284 transitions. Second operand 5 states. [2019-10-14 23:49:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:31,767 INFO L93 Difference]: Finished difference Result 391 states and 639 transitions. [2019-10-14 23:49:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:31,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-14 23:49:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:31,771 INFO L225 Difference]: With dead ends: 391 [2019-10-14 23:49:31,771 INFO L226 Difference]: Without dead ends: 224 [2019-10-14 23:49:31,774 INFO L600 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-10-14 23:49:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-14 23:49:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-10-14 23:49:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-14 23:49:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 361 transitions. [2019-10-14 23:49:31,814 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 361 transitions. Word has length 52 [2019-10-14 23:49:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:31,815 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 361 transitions. [2019-10-14 23:49:31,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 361 transitions. [2019-10-14 23:49:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-14 23:49:31,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:31,822 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:49:31,822 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:31,829 INFO L82 PathProgramCache]: Analyzing trace with hash 201696029, now seen corresponding path program 1 times [2019-10-14 23:49:31,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:31,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704181348] [2019-10-14 23:49:31,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:31,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704181348] [2019-10-14 23:49:31,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:31,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:31,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914537751] [2019-10-14 23:49:31,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:31,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:31,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:31,983 INFO L87 Difference]: Start difference. First operand 219 states and 361 transitions. Second operand 5 states. [2019-10-14 23:49:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:32,406 INFO L93 Difference]: Finished difference Result 456 states and 763 transitions. [2019-10-14 23:49:32,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:32,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-14 23:49:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:32,409 INFO L225 Difference]: With dead ends: 456 [2019-10-14 23:49:32,409 INFO L226 Difference]: Without dead ends: 250 [2019-10-14 23:49:32,415 INFO L600 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-10-14 23:49:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-14 23:49:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-10-14 23:49:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-14 23:49:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-10-14 23:49:32,450 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 80 [2019-10-14 23:49:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:32,451 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-10-14 23:49:32,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-10-14 23:49:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:49:32,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:32,460 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-14 23:49:32,460 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1556256498, now seen corresponding path program 1 times [2019-10-14 23:49:32,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:32,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356806518] [2019-10-14 23:49:32,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:32,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:32,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:32,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356806518] [2019-10-14 23:49:32,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:32,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:32,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155516054] [2019-10-14 23:49:32,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:32,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:32,577 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 5 states. [2019-10-14 23:49:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:32,816 INFO L93 Difference]: Finished difference Result 533 states and 899 transitions. [2019-10-14 23:49:32,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:32,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-14 23:49:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:32,819 INFO L225 Difference]: With dead ends: 533 [2019-10-14 23:49:32,820 INFO L226 Difference]: Without dead ends: 296 [2019-10-14 23:49:32,821 INFO L600 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-10-14 23:49:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-14 23:49:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-10-14 23:49:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-14 23:49:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-10-14 23:49:32,836 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 91 [2019-10-14 23:49:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:32,836 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-10-14 23:49:32,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-10-14 23:49:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:49:32,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:32,838 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-14 23:49:32,838 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1933322156, now seen corresponding path program 1 times [2019-10-14 23:49:32,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:32,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123313505] [2019-10-14 23:49:32,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:32,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:32,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:32,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123313505] [2019-10-14 23:49:32,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:32,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:32,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918360767] [2019-10-14 23:49:32,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:32,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:32,938 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 5 states. [2019-10-14 23:49:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:33,204 INFO L93 Difference]: Finished difference Result 575 states and 972 transitions. [2019-10-14 23:49:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:33,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-14 23:49:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:33,207 INFO L225 Difference]: With dead ends: 575 [2019-10-14 23:49:33,207 INFO L226 Difference]: Without dead ends: 294 [2019-10-14 23:49:33,208 INFO L600 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-10-14 23:49:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-14 23:49:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2019-10-14 23:49:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-14 23:49:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 487 transitions. [2019-10-14 23:49:33,222 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 487 transitions. Word has length 92 [2019-10-14 23:49:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:33,222 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 487 transitions. [2019-10-14 23:49:33,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 487 transitions. [2019-10-14 23:49:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:49:33,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:33,224 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:33,224 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:33,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1585840345, now seen corresponding path program 1 times [2019-10-14 23:49:33,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:33,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5485200] [2019-10-14 23:49:33,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:33,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5485200] [2019-10-14 23:49:33,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:33,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:33,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896439508] [2019-10-14 23:49:33,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:33,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:33,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:33,294 INFO L87 Difference]: Start difference. First operand 290 states and 487 transitions. Second operand 5 states. [2019-10-14 23:49:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:33,483 INFO L93 Difference]: Finished difference Result 584 states and 985 transitions. [2019-10-14 23:49:33,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:33,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-14 23:49:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:33,490 INFO L225 Difference]: With dead ends: 584 [2019-10-14 23:49:33,491 INFO L226 Difference]: Without dead ends: 307 [2019-10-14 23:49:33,492 INFO L600 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-10-14 23:49:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-14 23:49:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-14 23:49:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-14 23:49:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 509 transitions. [2019-10-14 23:49:33,506 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 509 transitions. Word has length 92 [2019-10-14 23:49:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:33,507 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 509 transitions. [2019-10-14 23:49:33,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 509 transitions. [2019-10-14 23:49:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-14 23:49:33,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:33,509 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:33,509 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash 6376232, now seen corresponding path program 1 times [2019-10-14 23:49:33,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:33,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636342773] [2019-10-14 23:49:33,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:33,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636342773] [2019-10-14 23:49:33,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:33,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:33,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786573330] [2019-10-14 23:49:33,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:33,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:33,570 INFO L87 Difference]: Start difference. First operand 305 states and 509 transitions. Second operand 5 states. [2019-10-14 23:49:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:33,758 INFO L93 Difference]: Finished difference Result 599 states and 1003 transitions. [2019-10-14 23:49:33,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:33,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-14 23:49:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:33,761 INFO L225 Difference]: With dead ends: 599 [2019-10-14 23:49:33,761 INFO L226 Difference]: Without dead ends: 307 [2019-10-14 23:49:33,762 INFO L600 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-10-14 23:49:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-14 23:49:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-14 23:49:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-14 23:49:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 505 transitions. [2019-10-14 23:49:33,776 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 505 transitions. Word has length 93 [2019-10-14 23:49:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:33,776 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 505 transitions. [2019-10-14 23:49:33,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 505 transitions. [2019-10-14 23:49:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:49:33,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:33,779 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:33,779 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash -854791455, now seen corresponding path program 1 times [2019-10-14 23:49:33,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:33,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273759928] [2019-10-14 23:49:33,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-14 23:49:33,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273759928] [2019-10-14 23:49:33,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:33,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:33,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710431326] [2019-10-14 23:49:33,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:33,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:33,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:33,841 INFO L87 Difference]: Start difference. First operand 305 states and 505 transitions. Second operand 5 states. [2019-10-14 23:49:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:33,993 INFO L93 Difference]: Finished difference Result 606 states and 1005 transitions. [2019-10-14 23:49:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:33,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:49:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:33,996 INFO L225 Difference]: With dead ends: 606 [2019-10-14 23:49:33,996 INFO L226 Difference]: Without dead ends: 314 [2019-10-14 23:49:33,997 INFO L600 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-10-14 23:49:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-14 23:49:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-10-14 23:49:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-14 23:49:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 511 transitions. [2019-10-14 23:49:34,011 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 511 transitions. Word has length 106 [2019-10-14 23:49:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:34,012 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 511 transitions. [2019-10-14 23:49:34,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 511 transitions. [2019-10-14 23:49:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:49:34,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:34,014 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:34,014 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1777100668, now seen corresponding path program 1 times [2019-10-14 23:49:34,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:34,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911915392] [2019-10-14 23:49:34,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:34,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911915392] [2019-10-14 23:49:34,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:34,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:34,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537716875] [2019-10-14 23:49:34,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:34,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:34,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:34,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:34,077 INFO L87 Difference]: Start difference. First operand 314 states and 511 transitions. Second operand 5 states. [2019-10-14 23:49:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:34,273 INFO L93 Difference]: Finished difference Result 646 states and 1058 transitions. [2019-10-14 23:49:34,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:34,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:49:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:34,276 INFO L225 Difference]: With dead ends: 646 [2019-10-14 23:49:34,276 INFO L226 Difference]: Without dead ends: 345 [2019-10-14 23:49:34,277 INFO L600 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-10-14 23:49:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-14 23:49:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-10-14 23:49:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-14 23:49:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 558 transitions. [2019-10-14 23:49:34,293 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 558 transitions. Word has length 106 [2019-10-14 23:49:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:34,297 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 558 transitions. [2019-10-14 23:49:34,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 558 transitions. [2019-10-14 23:49:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:49:34,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:34,301 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:34,302 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1284309403, now seen corresponding path program 1 times [2019-10-14 23:49:34,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:34,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988602387] [2019-10-14 23:49:34,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:34,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988602387] [2019-10-14 23:49:34,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:34,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:34,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959907599] [2019-10-14 23:49:34,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:34,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:34,368 INFO L87 Difference]: Start difference. First operand 343 states and 558 transitions. Second operand 5 states. [2019-10-14 23:49:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:34,575 INFO L93 Difference]: Finished difference Result 675 states and 1101 transitions. [2019-10-14 23:49:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:34,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-14 23:49:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:34,577 INFO L225 Difference]: With dead ends: 675 [2019-10-14 23:49:34,577 INFO L226 Difference]: Without dead ends: 345 [2019-10-14 23:49:34,578 INFO L600 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-10-14 23:49:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-14 23:49:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-10-14 23:49:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-14 23:49:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 554 transitions. [2019-10-14 23:49:34,593 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 554 transitions. Word has length 107 [2019-10-14 23:49:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:34,593 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 554 transitions. [2019-10-14 23:49:34,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 554 transitions. [2019-10-14 23:49:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:49:34,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:34,595 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:34,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:34,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1845761004, now seen corresponding path program 1 times [2019-10-14 23:49:34,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:34,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404831362] [2019-10-14 23:49:34,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:34,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404831362] [2019-10-14 23:49:34,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:34,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:34,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746192965] [2019-10-14 23:49:34,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:34,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:34,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:34,657 INFO L87 Difference]: Start difference. First operand 343 states and 554 transitions. Second operand 5 states. [2019-10-14 23:49:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:34,870 INFO L93 Difference]: Finished difference Result 708 states and 1151 transitions. [2019-10-14 23:49:34,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:34,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-14 23:49:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:34,874 INFO L225 Difference]: With dead ends: 708 [2019-10-14 23:49:34,874 INFO L226 Difference]: Without dead ends: 378 [2019-10-14 23:49:34,876 INFO L600 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-10-14 23:49:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-14 23:49:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-14 23:49:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-14 23:49:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 596 transitions. [2019-10-14 23:49:34,896 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 596 transitions. Word has length 108 [2019-10-14 23:49:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:34,897 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 596 transitions. [2019-10-14 23:49:34,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 596 transitions. [2019-10-14 23:49:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:49:34,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:34,899 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:34,900 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2036530603, now seen corresponding path program 1 times [2019-10-14 23:49:34,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:34,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35460795] [2019-10-14 23:49:34,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:34,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,955 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:34,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35460795] [2019-10-14 23:49:34,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:34,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:34,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072059574] [2019-10-14 23:49:34,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:34,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:34,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:34,958 INFO L87 Difference]: Start difference. First operand 370 states and 596 transitions. Second operand 5 states. [2019-10-14 23:49:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:35,166 INFO L93 Difference]: Finished difference Result 735 states and 1188 transitions. [2019-10-14 23:49:35,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:35,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-14 23:49:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:35,169 INFO L225 Difference]: With dead ends: 735 [2019-10-14 23:49:35,169 INFO L226 Difference]: Without dead ends: 378 [2019-10-14 23:49:35,170 INFO L600 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-10-14 23:49:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-14 23:49:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-14 23:49:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-14 23:49:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 591 transitions. [2019-10-14 23:49:35,187 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 591 transitions. Word has length 109 [2019-10-14 23:49:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:35,188 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 591 transitions. [2019-10-14 23:49:35,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 591 transitions. [2019-10-14 23:49:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-14 23:49:35,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:35,190 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:35,190 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash -346552109, now seen corresponding path program 1 times [2019-10-14 23:49:35,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:35,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930381954] [2019-10-14 23:49:35,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:35,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930381954] [2019-10-14 23:49:35,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:35,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:35,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709283014] [2019-10-14 23:49:35,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:35,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:35,263 INFO L87 Difference]: Start difference. First operand 370 states and 591 transitions. Second operand 5 states. [2019-10-14 23:49:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:35,476 INFO L93 Difference]: Finished difference Result 752 states and 1206 transitions. [2019-10-14 23:49:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:35,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-14 23:49:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:35,479 INFO L225 Difference]: With dead ends: 752 [2019-10-14 23:49:35,479 INFO L226 Difference]: Without dead ends: 395 [2019-10-14 23:49:35,481 INFO L600 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-10-14 23:49:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-14 23:49:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-10-14 23:49:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-14 23:49:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2019-10-14 23:49:35,508 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 112 [2019-10-14 23:49:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:35,508 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2019-10-14 23:49:35,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2019-10-14 23:49:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-14 23:49:35,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:35,512 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:35,512 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash 768287860, now seen corresponding path program 1 times [2019-10-14 23:49:35,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:35,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439879540] [2019-10-14 23:49:35,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:35,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439879540] [2019-10-14 23:49:35,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:35,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:35,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005237585] [2019-10-14 23:49:35,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:35,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:35,580 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 5 states. [2019-10-14 23:49:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:35,851 INFO L93 Difference]: Finished difference Result 773 states and 1229 transitions. [2019-10-14 23:49:35,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:35,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-10-14 23:49:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:35,854 INFO L225 Difference]: With dead ends: 773 [2019-10-14 23:49:35,855 INFO L226 Difference]: Without dead ends: 395 [2019-10-14 23:49:35,857 INFO L600 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-10-14 23:49:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-14 23:49:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-10-14 23:49:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-14 23:49:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 614 transitions. [2019-10-14 23:49:35,878 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 614 transitions. Word has length 113 [2019-10-14 23:49:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:35,878 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 614 transitions. [2019-10-14 23:49:35,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 614 transitions. [2019-10-14 23:49:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-14 23:49:35,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:35,881 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:35,881 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:35,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -105487368, now seen corresponding path program 1 times [2019-10-14 23:49:35,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:35,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476614393] [2019-10-14 23:49:35,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-14 23:49:35,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476614393] [2019-10-14 23:49:35,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:35,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:35,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2192399] [2019-10-14 23:49:35,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:35,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:35,948 INFO L87 Difference]: Start difference. First operand 391 states and 614 transitions. Second operand 3 states. [2019-10-14 23:49:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:36,008 INFO L93 Difference]: Finished difference Result 1144 states and 1806 transitions. [2019-10-14 23:49:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:36,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-14 23:49:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:36,013 INFO L225 Difference]: With dead ends: 1144 [2019-10-14 23:49:36,014 INFO L226 Difference]: Without dead ends: 766 [2019-10-14 23:49:36,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:49:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-10-14 23:49:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-10-14 23:49:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-14 23:49:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1207 transitions. [2019-10-14 23:49:36,054 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1207 transitions. Word has length 128 [2019-10-14 23:49:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:36,054 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1207 transitions. [2019-10-14 23:49:36,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1207 transitions. [2019-10-14 23:49:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-14 23:49:36,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:36,058 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:36,058 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1228256447, now seen corresponding path program 1 times [2019-10-14 23:49:36,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:36,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282089349] [2019-10-14 23:49:36,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:36,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282089349] [2019-10-14 23:49:36,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:36,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:36,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380826242] [2019-10-14 23:49:36,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:36,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:36,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:36,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:36,153 INFO L87 Difference]: Start difference. First operand 766 states and 1207 transitions. Second operand 5 states. [2019-10-14 23:49:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:36,407 INFO L93 Difference]: Finished difference Result 1603 states and 2533 transitions. [2019-10-14 23:49:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:36,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-14 23:49:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:36,413 INFO L225 Difference]: With dead ends: 1603 [2019-10-14 23:49:36,413 INFO L226 Difference]: Without dead ends: 850 [2019-10-14 23:49:36,415 INFO L600 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-10-14 23:49:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-10-14 23:49:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 842. [2019-10-14 23:49:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-10-14 23:49:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1325 transitions. [2019-10-14 23:49:36,453 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1325 transitions. Word has length 129 [2019-10-14 23:49:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:36,453 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1325 transitions. [2019-10-14 23:49:36,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1325 transitions. [2019-10-14 23:49:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-14 23:49:36,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:36,457 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:36,457 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 998366491, now seen corresponding path program 1 times [2019-10-14 23:49:36,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:36,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850817192] [2019-10-14 23:49:36,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:36,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850817192] [2019-10-14 23:49:36,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:36,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:36,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540967996] [2019-10-14 23:49:36,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:36,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:36,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:36,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:36,523 INFO L87 Difference]: Start difference. First operand 842 states and 1325 transitions. Second operand 5 states. [2019-10-14 23:49:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:36,829 INFO L93 Difference]: Finished difference Result 1679 states and 2645 transitions. [2019-10-14 23:49:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:36,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-14 23:49:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:36,835 INFO L225 Difference]: With dead ends: 1679 [2019-10-14 23:49:36,835 INFO L226 Difference]: Without dead ends: 846 [2019-10-14 23:49:36,839 INFO L600 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-10-14 23:49:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-14 23:49:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 838. [2019-10-14 23:49:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-14 23:49:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1313 transitions. [2019-10-14 23:49:36,897 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1313 transitions. Word has length 130 [2019-10-14 23:49:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:36,897 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1313 transitions. [2019-10-14 23:49:36,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1313 transitions. [2019-10-14 23:49:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-14 23:49:36,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:36,902 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-10-14 23:49:36,902 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:36,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:36,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1190868920, now seen corresponding path program 1 times [2019-10-14 23:49:36,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:36,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89454376] [2019-10-14 23:49:36,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-14 23:49:36,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89454376] [2019-10-14 23:49:36,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:36,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:36,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21175951] [2019-10-14 23:49:36,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:36,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:37,000 INFO L87 Difference]: Start difference. First operand 838 states and 1313 transitions. Second operand 5 states. [2019-10-14 23:49:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:37,309 INFO L93 Difference]: Finished difference Result 1739 states and 2729 transitions. [2019-10-14 23:49:37,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:37,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-10-14 23:49:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:37,314 INFO L225 Difference]: With dead ends: 1739 [2019-10-14 23:49:37,314 INFO L226 Difference]: Without dead ends: 914 [2019-10-14 23:49:37,316 INFO L600 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-10-14 23:49:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-14 23:49:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2019-10-14 23:49:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-10-14 23:49:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1421 transitions. [2019-10-14 23:49:37,362 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1421 transitions. Word has length 162 [2019-10-14 23:49:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:37,362 INFO L462 AbstractCegarLoop]: Abstraction has 910 states and 1421 transitions. [2019-10-14 23:49:37,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1421 transitions. [2019-10-14 23:49:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-14 23:49:37,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:37,367 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-14 23:49:37,367 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash -618678002, now seen corresponding path program 1 times [2019-10-14 23:49:37,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:37,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729795128] [2019-10-14 23:49:37,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:37,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:37,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-14 23:49:37,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729795128] [2019-10-14 23:49:37,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:37,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:37,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349643668] [2019-10-14 23:49:37,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:37,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:37,438 INFO L87 Difference]: Start difference. First operand 910 states and 1421 transitions. Second operand 5 states. [2019-10-14 23:49:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:37,693 INFO L93 Difference]: Finished difference Result 1811 states and 2829 transitions. [2019-10-14 23:49:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:37,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-10-14 23:49:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:37,699 INFO L225 Difference]: With dead ends: 1811 [2019-10-14 23:49:37,699 INFO L226 Difference]: Without dead ends: 910 [2019-10-14 23:49:37,701 INFO L600 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-10-14 23:49:37,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-10-14 23:49:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 906. [2019-10-14 23:49:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-14 23:49:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1407 transitions. [2019-10-14 23:49:37,741 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1407 transitions. Word has length 163 [2019-10-14 23:49:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:37,742 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1407 transitions. [2019-10-14 23:49:37,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1407 transitions. [2019-10-14 23:49:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-14 23:49:37,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:37,746 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2019-10-14 23:49:37,747 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1613187866, now seen corresponding path program 1 times [2019-10-14 23:49:37,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:37,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501252136] [2019-10-14 23:49:37,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:37,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:37,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-14 23:49:37,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501252136] [2019-10-14 23:49:37,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:37,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:37,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559116627] [2019-10-14 23:49:37,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:37,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:37,835 INFO L87 Difference]: Start difference. First operand 906 states and 1407 transitions. Second operand 5 states. [2019-10-14 23:49:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:38,087 INFO L93 Difference]: Finished difference Result 1871 states and 2909 transitions. [2019-10-14 23:49:38,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:38,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-14 23:49:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:38,093 INFO L225 Difference]: With dead ends: 1871 [2019-10-14 23:49:38,094 INFO L226 Difference]: Without dead ends: 978 [2019-10-14 23:49:38,096 INFO L600 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-10-14 23:49:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-14 23:49:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-10-14 23:49:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-14 23:49:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1505 transitions. [2019-10-14 23:49:38,141 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1505 transitions. Word has length 193 [2019-10-14 23:49:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:38,141 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1505 transitions. [2019-10-14 23:49:38,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1505 transitions. [2019-10-14 23:49:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-14 23:49:38,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:38,145 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-10-14 23:49:38,146 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:38,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:38,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180736, now seen corresponding path program 1 times [2019-10-14 23:49:38,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:38,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536701737] [2019-10-14 23:49:38,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:38,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:38,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-14 23:49:38,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536701737] [2019-10-14 23:49:38,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:38,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:38,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917935099] [2019-10-14 23:49:38,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:38,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:38,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:38,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:38,223 INFO L87 Difference]: Start difference. First operand 974 states and 1505 transitions. Second operand 5 states. [2019-10-14 23:49:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:38,458 INFO L93 Difference]: Finished difference Result 1939 states and 2997 transitions. [2019-10-14 23:49:38,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:38,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2019-10-14 23:49:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:38,464 INFO L225 Difference]: With dead ends: 1939 [2019-10-14 23:49:38,464 INFO L226 Difference]: Without dead ends: 974 [2019-10-14 23:49:38,467 INFO L600 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-10-14 23:49:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-14 23:49:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 970. [2019-10-14 23:49:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-14 23:49:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1489 transitions. [2019-10-14 23:49:38,515 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1489 transitions. Word has length 194 [2019-10-14 23:49:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:38,515 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1489 transitions. [2019-10-14 23:49:38,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1489 transitions. [2019-10-14 23:49:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-14 23:49:38,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:38,520 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:38,520 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:38,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:38,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1741358840, now seen corresponding path program 1 times [2019-10-14 23:49:38,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:38,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875598580] [2019-10-14 23:49:38,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:38,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:38,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-14 23:49:38,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875598580] [2019-10-14 23:49:38,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:38,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:38,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197209086] [2019-10-14 23:49:38,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:38,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:38,632 INFO L87 Difference]: Start difference. First operand 970 states and 1489 transitions. Second operand 5 states. [2019-10-14 23:49:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:38,865 INFO L93 Difference]: Finished difference Result 2003 states and 3085 transitions. [2019-10-14 23:49:38,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:38,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-14 23:49:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:38,871 INFO L225 Difference]: With dead ends: 2003 [2019-10-14 23:49:38,871 INFO L226 Difference]: Without dead ends: 1046 [2019-10-14 23:49:38,874 INFO L600 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-10-14 23:49:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-10-14 23:49:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-10-14 23:49:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-14 23:49:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1553 transitions. [2019-10-14 23:49:38,916 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1553 transitions. Word has length 212 [2019-10-14 23:49:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:38,917 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1553 transitions. [2019-10-14 23:49:38,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1553 transitions. [2019-10-14 23:49:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-14 23:49:38,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:38,921 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:38,921 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:38,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1179693335, now seen corresponding path program 1 times [2019-10-14 23:49:38,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:38,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247864673] [2019-10-14 23:49:38,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:38,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:38,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-14 23:49:38,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247864673] [2019-10-14 23:49:38,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:38,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:38,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330377428] [2019-10-14 23:49:38,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:38,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:38,997 INFO L87 Difference]: Start difference. First operand 1020 states and 1553 transitions. Second operand 5 states. [2019-10-14 23:49:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:39,268 INFO L93 Difference]: Finished difference Result 2053 states and 3131 transitions. [2019-10-14 23:49:39,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:39,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-14 23:49:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:39,276 INFO L225 Difference]: With dead ends: 2053 [2019-10-14 23:49:39,276 INFO L226 Difference]: Without dead ends: 1046 [2019-10-14 23:49:39,279 INFO L600 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-10-14 23:49:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-10-14 23:49:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-10-14 23:49:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-14 23:49:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1535 transitions. [2019-10-14 23:49:39,341 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1535 transitions. Word has length 213 [2019-10-14 23:49:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:39,341 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1535 transitions. [2019-10-14 23:49:39,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1535 transitions. [2019-10-14 23:49:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-14 23:49:39,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:39,346 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-10-14 23:49:39,346 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2078256648, now seen corresponding path program 1 times [2019-10-14 23:49:39,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:39,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225340722] [2019-10-14 23:49:39,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:39,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:39,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-14 23:49:39,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225340722] [2019-10-14 23:49:39,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:39,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:39,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490413808] [2019-10-14 23:49:39,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:39,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:39,466 INFO L87 Difference]: Start difference. First operand 1020 states and 1535 transitions. Second operand 5 states. [2019-10-14 23:49:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:39,708 INFO L93 Difference]: Finished difference Result 2035 states and 3063 transitions. [2019-10-14 23:49:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:39,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-10-14 23:49:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:39,715 INFO L225 Difference]: With dead ends: 2035 [2019-10-14 23:49:39,715 INFO L226 Difference]: Without dead ends: 1028 [2019-10-14 23:49:39,720 INFO L600 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-10-14 23:49:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-10-14 23:49:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1020. [2019-10-14 23:49:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-14 23:49:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1523 transitions. [2019-10-14 23:49:39,766 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1523 transitions. Word has length 224 [2019-10-14 23:49:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:39,766 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1523 transitions. [2019-10-14 23:49:39,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1523 transitions. [2019-10-14 23:49:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-14 23:49:39,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:39,770 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2019-10-14 23:49:39,771 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -836415730, now seen corresponding path program 1 times [2019-10-14 23:49:39,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:39,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575631852] [2019-10-14 23:49:39,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:39,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:39,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-14 23:49:39,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575631852] [2019-10-14 23:49:39,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:39,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:39,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218232325] [2019-10-14 23:49:39,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:39,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:39,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:39,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:39,850 INFO L87 Difference]: Start difference. First operand 1020 states and 1523 transitions. Second operand 5 states. [2019-10-14 23:49:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:40,092 INFO L93 Difference]: Finished difference Result 2035 states and 3039 transitions. [2019-10-14 23:49:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:40,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-14 23:49:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:40,098 INFO L225 Difference]: With dead ends: 2035 [2019-10-14 23:49:40,098 INFO L226 Difference]: Without dead ends: 1010 [2019-10-14 23:49:40,101 INFO L600 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-10-14 23:49:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-10-14 23:49:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002. [2019-10-14 23:49:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-10-14 23:49:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1485 transitions. [2019-10-14 23:49:40,146 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1485 transitions. Word has length 225 [2019-10-14 23:49:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:40,146 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1485 transitions. [2019-10-14 23:49:40,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1485 transitions. [2019-10-14 23:49:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-14 23:49:40,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:40,151 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:40,152 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1494389851, now seen corresponding path program 1 times [2019-10-14 23:49:40,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:40,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345170789] [2019-10-14 23:49:40,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:40,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:40,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-14 23:49:40,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345170789] [2019-10-14 23:49:40,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:40,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:40,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078217770] [2019-10-14 23:49:40,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:40,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:40,284 INFO L87 Difference]: Start difference. First operand 1002 states and 1485 transitions. Second operand 5 states. [2019-10-14 23:49:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:40,509 INFO L93 Difference]: Finished difference Result 2045 states and 3037 transitions. [2019-10-14 23:49:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:40,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-10-14 23:49:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:40,515 INFO L225 Difference]: With dead ends: 2045 [2019-10-14 23:49:40,515 INFO L226 Difference]: Without dead ends: 1056 [2019-10-14 23:49:40,518 INFO L600 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-10-14 23:49:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-14 23:49:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1048. [2019-10-14 23:49:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-14 23:49:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1539 transitions. [2019-10-14 23:49:40,566 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1539 transitions. Word has length 233 [2019-10-14 23:49:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:40,567 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1539 transitions. [2019-10-14 23:49:40,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1539 transitions. [2019-10-14 23:49:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-14 23:49:40,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:40,571 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:40,571 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1829546886, now seen corresponding path program 1 times [2019-10-14 23:49:40,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:40,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276021003] [2019-10-14 23:49:40,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:40,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:40,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-14 23:49:40,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276021003] [2019-10-14 23:49:40,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:40,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:40,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516783051] [2019-10-14 23:49:40,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:40,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:40,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:40,656 INFO L87 Difference]: Start difference. First operand 1048 states and 1539 transitions. Second operand 5 states. [2019-10-14 23:49:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:40,893 INFO L93 Difference]: Finished difference Result 2091 states and 3071 transitions. [2019-10-14 23:49:40,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:40,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-10-14 23:49:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:40,900 INFO L225 Difference]: With dead ends: 2091 [2019-10-14 23:49:40,900 INFO L226 Difference]: Without dead ends: 1048 [2019-10-14 23:49:40,902 INFO L600 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-10-14 23:49:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-10-14 23:49:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1040. [2019-10-14 23:49:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-10-14 23:49:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1507 transitions. [2019-10-14 23:49:40,952 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1507 transitions. Word has length 234 [2019-10-14 23:49:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:40,952 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1507 transitions. [2019-10-14 23:49:40,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1507 transitions. [2019-10-14 23:49:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-14 23:49:40,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:40,957 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:40,958 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash 678328095, now seen corresponding path program 1 times [2019-10-14 23:49:40,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:40,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310948381] [2019-10-14 23:49:40,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:40,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:40,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-14 23:49:41,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310948381] [2019-10-14 23:49:41,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560932124] [2019-10-14 23:49:41,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:41,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:49:41,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-14 23:49:41,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:41,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:41,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799724530] [2019-10-14 23:49:41,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:41,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:41,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:41,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:41,317 INFO L87 Difference]: Start difference. First operand 1040 states and 1507 transitions. Second operand 3 states. [2019-10-14 23:49:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:41,443 INFO L93 Difference]: Finished difference Result 2579 states and 3740 transitions. [2019-10-14 23:49:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:41,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-14 23:49:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:41,452 INFO L225 Difference]: With dead ends: 2579 [2019-10-14 23:49:41,452 INFO L226 Difference]: Without dead ends: 1552 [2019-10-14 23:49:41,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-10-14 23:49:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2019-10-14 23:49:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-10-14 23:49:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2249 transitions. [2019-10-14 23:49:41,563 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2249 transitions. Word has length 270 [2019-10-14 23:49:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:41,564 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 2249 transitions. [2019-10-14 23:49:41,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2249 transitions. [2019-10-14 23:49:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-14 23:49:41,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:41,568 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-14 23:49:41,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:41,773 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash -230386138, now seen corresponding path program 1 times [2019-10-14 23:49:41,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:41,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881518040] [2019-10-14 23:49:41,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:41,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:41,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-14 23:49:41,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881518040] [2019-10-14 23:49:41,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:41,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:41,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009375007] [2019-10-14 23:49:41,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:41,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:41,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:41,930 INFO L87 Difference]: Start difference. First operand 1552 states and 2249 transitions. Second operand 3 states. [2019-10-14 23:49:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:42,113 INFO L93 Difference]: Finished difference Result 4547 states and 6592 transitions. [2019-10-14 23:49:42,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:42,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-10-14 23:49:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:42,129 INFO L225 Difference]: With dead ends: 4547 [2019-10-14 23:49:42,129 INFO L226 Difference]: Without dead ends: 3008 [2019-10-14 23:49:42,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:49:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-10-14 23:49:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3007. [2019-10-14 23:49:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-10-14 23:49:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4350 transitions. [2019-10-14 23:49:42,299 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4350 transitions. Word has length 278 [2019-10-14 23:49:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:42,300 INFO L462 AbstractCegarLoop]: Abstraction has 3007 states and 4350 transitions. [2019-10-14 23:49:42,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4350 transitions. [2019-10-14 23:49:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-14 23:49:42,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:42,312 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:42,312 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash -860287162, now seen corresponding path program 1 times [2019-10-14 23:49:42,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:42,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083362324] [2019-10-14 23:49:42,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:42,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:42,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-14 23:49:42,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083362324] [2019-10-14 23:49:42,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:42,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:42,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915282974] [2019-10-14 23:49:42,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:42,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:42,442 INFO L87 Difference]: Start difference. First operand 3007 states and 4350 transitions. Second operand 3 states. [2019-10-14 23:49:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:42,709 INFO L93 Difference]: Finished difference Result 6121 states and 8875 transitions. [2019-10-14 23:49:42,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:42,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-10-14 23:49:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:42,722 INFO L225 Difference]: With dead ends: 6121 [2019-10-14 23:49:42,722 INFO L226 Difference]: Without dead ends: 2006 [2019-10-14 23:49:42,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:49:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-10-14 23:49:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1986. [2019-10-14 23:49:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-10-14 23:49:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2824 transitions. [2019-10-14 23:49:42,912 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2824 transitions. Word has length 315 [2019-10-14 23:49:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:42,912 INFO L462 AbstractCegarLoop]: Abstraction has 1986 states and 2824 transitions. [2019-10-14 23:49:42,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2824 transitions. [2019-10-14 23:49:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-14 23:49:42,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:42,918 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-14 23:49:42,918 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:42,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:42,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2044603392, now seen corresponding path program 1 times [2019-10-14 23:49:42,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:42,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956056239] [2019-10-14 23:49:42,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:42,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:42,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-10-14 23:49:43,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956056239] [2019-10-14 23:49:43,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45518832] [2019-10-14 23:49:43,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:43,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:43,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-10-14 23:49:43,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:43,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:43,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660249207] [2019-10-14 23:49:43,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:43,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:43,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:43,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:43,351 INFO L87 Difference]: Start difference. First operand 1986 states and 2824 transitions. Second operand 3 states. [2019-10-14 23:49:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:43,474 INFO L93 Difference]: Finished difference Result 4612 states and 6551 transitions. [2019-10-14 23:49:43,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:43,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-10-14 23:49:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:43,489 INFO L225 Difference]: With dead ends: 4612 [2019-10-14 23:49:43,490 INFO L226 Difference]: Without dead ends: 2639 [2019-10-14 23:49:43,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-10-14 23:49:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2019-10-14 23:49:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-10-14 23:49:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3738 transitions. [2019-10-14 23:49:43,670 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3738 transitions. Word has length 382 [2019-10-14 23:49:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:43,671 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 3738 transitions. [2019-10-14 23:49:43,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3738 transitions. [2019-10-14 23:49:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-14 23:49:43,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:43,684 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:43,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:43,899 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash 134700959, now seen corresponding path program 1 times [2019-10-14 23:49:43,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:43,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579899676] [2019-10-14 23:49:43,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:43,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:43,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-14 23:49:44,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579899676] [2019-10-14 23:49:44,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519273851] [2019-10-14 23:49:44,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:44,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:44,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-10-14 23:49:44,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:44,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:44,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9192591] [2019-10-14 23:49:44,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:44,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:44,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:44,870 INFO L87 Difference]: Start difference. First operand 2639 states and 3738 transitions. Second operand 3 states. [2019-10-14 23:49:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:44,966 INFO L93 Difference]: Finished difference Result 2700 states and 3825 transitions. [2019-10-14 23:49:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:44,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-10-14 23:49:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:44,994 INFO L225 Difference]: With dead ends: 2700 [2019-10-14 23:49:44,997 INFO L226 Difference]: Without dead ends: 2106 [2019-10-14 23:49:44,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-10-14 23:49:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2048. [2019-10-14 23:49:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-10-14 23:49:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2908 transitions. [2019-10-14 23:49:45,118 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2908 transitions. Word has length 453 [2019-10-14 23:49:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:45,119 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 2908 transitions. [2019-10-14 23:49:45,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2908 transitions. [2019-10-14 23:49:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-14 23:49:45,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:45,126 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:45,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:45,331 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1776341599, now seen corresponding path program 1 times [2019-10-14 23:49:45,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:45,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882798674] [2019-10-14 23:49:45,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:45,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:45,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-14 23:49:45,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882798674] [2019-10-14 23:49:45,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007903506] [2019-10-14 23:49:45,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:45,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:45,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-14 23:49:45,836 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:45,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:45,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675755638] [2019-10-14 23:49:45,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:45,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:45,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:45,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:45,839 INFO L87 Difference]: Start difference. First operand 2048 states and 2908 transitions. Second operand 4 states. [2019-10-14 23:49:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:46,247 INFO L93 Difference]: Finished difference Result 4236 states and 6005 transitions. [2019-10-14 23:49:46,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:46,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 453 [2019-10-14 23:49:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:46,252 INFO L225 Difference]: With dead ends: 4236 [2019-10-14 23:49:46,253 INFO L226 Difference]: Without dead ends: 2157 [2019-10-14 23:49:46,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-10-14 23:49:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1910. [2019-10-14 23:49:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-14 23:49:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2609 transitions. [2019-10-14 23:49:46,334 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2609 transitions. Word has length 453 [2019-10-14 23:49:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:46,335 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2609 transitions. [2019-10-14 23:49:46,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2609 transitions. [2019-10-14 23:49:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-10-14 23:49:46,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:46,345 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:46,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:46,557 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1812552048, now seen corresponding path program 1 times [2019-10-14 23:49:46,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:46,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819653709] [2019-10-14 23:49:46,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:46,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:46,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-14 23:49:47,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819653709] [2019-10-14 23:49:47,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409829502] [2019-10-14 23:49:47,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:47,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-14 23:49:47,787 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:47,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:47,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098092828] [2019-10-14 23:49:47,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:47,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:47,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:47,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:47,790 INFO L87 Difference]: Start difference. First operand 1910 states and 2609 transitions. Second operand 4 states. [2019-10-14 23:49:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:48,084 INFO L93 Difference]: Finished difference Result 4572 states and 6296 transitions. [2019-10-14 23:49:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:48,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 854 [2019-10-14 23:49:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:48,091 INFO L225 Difference]: With dead ends: 4572 [2019-10-14 23:49:48,091 INFO L226 Difference]: Without dead ends: 2540 [2019-10-14 23:49:48,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2019-10-14 23:49:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 1910. [2019-10-14 23:49:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-14 23:49:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2609 transitions. [2019-10-14 23:49:48,182 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2609 transitions. Word has length 854 [2019-10-14 23:49:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:48,183 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2609 transitions. [2019-10-14 23:49:48,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2609 transitions. [2019-10-14 23:49:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2019-10-14 23:49:48,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:48,196 INFO L380 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:48,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:48,402 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1607522492, now seen corresponding path program 1 times [2019-10-14 23:49:48,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:48,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835474361] [2019-10-14 23:49:48,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-10-14 23:49:49,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835474361] [2019-10-14 23:49:49,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:49,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:49,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621088235] [2019-10-14 23:49:49,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:49,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:49,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:49,069 INFO L87 Difference]: Start difference. First operand 1910 states and 2609 transitions. Second operand 3 states. [2019-10-14 23:49:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,266 INFO L93 Difference]: Finished difference Result 3841 states and 5240 transitions. [2019-10-14 23:49:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:49,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1035 [2019-10-14 23:49:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,270 INFO L225 Difference]: With dead ends: 3841 [2019-10-14 23:49:49,271 INFO L226 Difference]: Without dead ends: 1950 [2019-10-14 23:49:49,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:49:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-10-14 23:49:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1910. [2019-10-14 23:49:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-14 23:49:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2589 transitions. [2019-10-14 23:49:49,380 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2589 transitions. Word has length 1035 [2019-10-14 23:49:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:49,386 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2589 transitions. [2019-10-14 23:49:49,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2589 transitions. [2019-10-14 23:49:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-10-14 23:49:49,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:49,409 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:49,410 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:49,411 INFO L82 PathProgramCache]: Analyzing trace with hash 123556935, now seen corresponding path program 1 times [2019-10-14 23:49:49,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:49,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060823573] [2019-10-14 23:49:49,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-10-14 23:49:50,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060823573] [2019-10-14 23:49:50,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:50,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378491511] [2019-10-14 23:49:50,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:50,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:50,143 INFO L87 Difference]: Start difference. First operand 1910 states and 2589 transitions. Second operand 3 states. [2019-10-14 23:49:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,336 INFO L93 Difference]: Finished difference Result 3818 states and 5174 transitions. [2019-10-14 23:49:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:50,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1050 [2019-10-14 23:49:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,341 INFO L225 Difference]: With dead ends: 3818 [2019-10-14 23:49:50,341 INFO L226 Difference]: Without dead ends: 1927 [2019-10-14 23:49:50,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:49:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2019-10-14 23:49:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1910. [2019-10-14 23:49:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-14 23:49:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2549 transitions. [2019-10-14 23:49:50,417 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2549 transitions. Word has length 1050 [2019-10-14 23:49:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,418 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2549 transitions. [2019-10-14 23:49:50,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2549 transitions. [2019-10-14 23:49:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2019-10-14 23:49:50,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,431 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:50,431 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 860689758, now seen corresponding path program 1 times [2019-10-14 23:49:50,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427817839] [2019-10-14 23:49:50,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-10-14 23:49:51,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427817839] [2019-10-14 23:49:51,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:51,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703637717] [2019-10-14 23:49:51,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:51,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,085 INFO L87 Difference]: Start difference. First operand 1910 states and 2549 transitions. Second operand 3 states. [2019-10-14 23:49:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,314 INFO L93 Difference]: Finished difference Result 3871 states and 5171 transitions. [2019-10-14 23:49:51,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:51,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1078 [2019-10-14 23:49:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,320 INFO L225 Difference]: With dead ends: 3871 [2019-10-14 23:49:51,320 INFO L226 Difference]: Without dead ends: 1962 [2019-10-14 23:49:51,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:49:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-10-14 23:49:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1952. [2019-10-14 23:49:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-10-14 23:49:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2597 transitions. [2019-10-14 23:49:51,408 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2597 transitions. Word has length 1078 [2019-10-14 23:49:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,409 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2597 transitions. [2019-10-14 23:49:51,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2597 transitions. [2019-10-14 23:49:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-10-14 23:49:51,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,422 INFO L380 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,423 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1775510994, now seen corresponding path program 1 times [2019-10-14 23:49:51,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182541803] [2019-10-14 23:49:51,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-10-14 23:49:52,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182541803] [2019-10-14 23:49:52,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:52,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654276280] [2019-10-14 23:49:52,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:52,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:52,183 INFO L87 Difference]: Start difference. First operand 1952 states and 2597 transitions. Second operand 3 states. [2019-10-14 23:49:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,314 INFO L93 Difference]: Finished difference Result 2520 states and 3342 transitions. [2019-10-14 23:49:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:52,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2019-10-14 23:49:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,315 INFO L225 Difference]: With dead ends: 2520 [2019-10-14 23:49:52,315 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:49:52,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:49:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:49:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:49:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:49:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:49:52,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2019-10-14 23:49:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,321 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:49:52,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:49:52,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:49:52,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:49:53,170 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 183 [2019-10-14 23:49:54,193 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 180 [2019-10-14 23:49:55,817 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-14 23:49:57,067 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-14 23:49:57,945 WARN L191 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-10-14 23:49:59,808 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 175 DAG size of output: 107 [2019-10-14 23:50:00,684 WARN L191 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 121