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/systemc/toy.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:30,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:30,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:30,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:30,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:30,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:30,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:30,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:30,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:30,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:30,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:30,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:30,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:30,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:30,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:30,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:30,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:30,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:30,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:30,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:30,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:30,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:30,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:30,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:30,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:30,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:30,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:30,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:30,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:30,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:30,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:30,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:30,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:30,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:30,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:30,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:30,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:30,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:30,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:30,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:30,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:30,314 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:50:30,328 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:30,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:30,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:30,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:30,330 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:30,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:30,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:30,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:30,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:30,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:30,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:30,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:30,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:30,332 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:30,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:30,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:30,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:30,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:30,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:30,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:30,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:30,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:30,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:30,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:30,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:30,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:30,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:30,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:30,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:30,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:30,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:30,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:30,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:30,719 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:30,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy.cil.c [2019-10-14 23:50:30,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad067be0/7a73ca6cafa34c97811df6d8b41dc5ca/FLAGd5402caf2 [2019-10-14 23:50:31,317 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:31,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy.cil.c [2019-10-14 23:50:31,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad067be0/7a73ca6cafa34c97811df6d8b41dc5ca/FLAGd5402caf2 [2019-10-14 23:50:31,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad067be0/7a73ca6cafa34c97811df6d8b41dc5ca [2019-10-14 23:50:31,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:31,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:31,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:31,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:31,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:31,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:31" (1/1) ... [2019-10-14 23:50:31,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6bd7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:31, skipping insertion in model container [2019-10-14 23:50:31,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:31" (1/1) ... [2019-10-14 23:50:31,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:31,716 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:31,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:31,953 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:32,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:32,112 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:32,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32 WrapperNode [2019-10-14 23:50:32,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:32,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:32,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:32,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:32,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:32,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:32,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:32,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:32,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (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:50:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-14 23:50:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-14 23:50:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-14 23:50:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-14 23:50:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-14 23:50:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-14 23:50:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-14 23:50:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-14 23:50:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-14 23:50:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:50:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:32,908 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:32,909 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:50:32,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:32 BoogieIcfgContainer [2019-10-14 23:50:32,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:32,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:32,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:32,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:32,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:31" (1/3) ... [2019-10-14 23:50:32,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b25811c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:32, skipping insertion in model container [2019-10-14 23:50:32,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32" (2/3) ... [2019-10-14 23:50:32,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b25811c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:32, skipping insertion in model container [2019-10-14 23:50:32,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:32" (3/3) ... [2019-10-14 23:50:32,920 INFO L109 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2019-10-14 23:50:32,931 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:32,940 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:32,954 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:32,983 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:32,983 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:32,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:32,984 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:32,984 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:32,984 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:32,985 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:32,985 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-10-14 23:50:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:33,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:33,022 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] [2019-10-14 23:50:33,024 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2004131150, now seen corresponding path program 1 times [2019-10-14 23:50:33,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:33,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673548532] [2019-10-14 23:50:33,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:33,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:33,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,447 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 23:50:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:33,497 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:50:33,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673548532] [2019-10-14 23:50:33,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:33,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:33,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267384857] [2019-10-14 23:50:33,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:33,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:33,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:33,525 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 4 states. [2019-10-14 23:50:33,675 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-14 23:50:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:34,426 INFO L93 Difference]: Finished difference Result 326 states and 563 transitions. [2019-10-14 23:50:34,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:34,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:34,444 INFO L225 Difference]: With dead ends: 326 [2019-10-14 23:50:34,445 INFO L226 Difference]: Without dead ends: 176 [2019-10-14 23:50:34,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-14 23:50:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 150. [2019-10-14 23:50:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-14 23:50:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 243 transitions. [2019-10-14 23:50:34,558 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 243 transitions. Word has length 47 [2019-10-14 23:50:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:34,573 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 243 transitions. [2019-10-14 23:50:34,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 243 transitions. [2019-10-14 23:50:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:34,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:34,576 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] [2019-10-14 23:50:34,577 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash 46852848, now seen corresponding path program 1 times [2019-10-14 23:50:34,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:34,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146138121] [2019-10-14 23:50:34,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,794 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:50:34,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146138121] [2019-10-14 23:50:34,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:34,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:34,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156833279] [2019-10-14 23:50:34,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:34,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:34,803 INFO L87 Difference]: Start difference. First operand 150 states and 243 transitions. Second operand 5 states. [2019-10-14 23:50:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:36,324 INFO L93 Difference]: Finished difference Result 451 states and 743 transitions. [2019-10-14 23:50:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:50:36,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:36,329 INFO L225 Difference]: With dead ends: 451 [2019-10-14 23:50:36,329 INFO L226 Difference]: Without dead ends: 319 [2019-10-14 23:50:36,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-10-14 23:50:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 283. [2019-10-14 23:50:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-14 23:50:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 471 transitions. [2019-10-14 23:50:36,374 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 471 transitions. Word has length 47 [2019-10-14 23:50:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:36,374 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 471 transitions. [2019-10-14 23:50:36,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 471 transitions. [2019-10-14 23:50:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:36,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:36,379 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] [2019-10-14 23:50:36,379 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash -227906766, now seen corresponding path program 1 times [2019-10-14 23:50:36,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:36,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126671803] [2019-10-14 23:50:36,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,647 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:50:36,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126671803] [2019-10-14 23:50:36,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:36,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:36,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893459217] [2019-10-14 23:50:36,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:36,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:36,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:36,651 INFO L87 Difference]: Start difference. First operand 283 states and 471 transitions. Second operand 5 states. [2019-10-14 23:50:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:37,935 INFO L93 Difference]: Finished difference Result 863 states and 1445 transitions. [2019-10-14 23:50:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:37,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:37,942 INFO L225 Difference]: With dead ends: 863 [2019-10-14 23:50:37,942 INFO L226 Difference]: Without dead ends: 600 [2019-10-14 23:50:37,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-14 23:50:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 539. [2019-10-14 23:50:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-10-14 23:50:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 901 transitions. [2019-10-14 23:50:38,002 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 901 transitions. Word has length 47 [2019-10-14 23:50:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:38,003 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 901 transitions. [2019-10-14 23:50:38,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 901 transitions. [2019-10-14 23:50:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:38,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:38,007 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] [2019-10-14 23:50:38,007 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2901456, now seen corresponding path program 1 times [2019-10-14 23:50:38,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:38,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485124560] [2019-10-14 23:50:38,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,146 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:50:38,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485124560] [2019-10-14 23:50:38,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:38,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:38,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743219735] [2019-10-14 23:50:38,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:38,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:38,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:38,149 INFO L87 Difference]: Start difference. First operand 539 states and 901 transitions. Second operand 5 states. [2019-10-14 23:50:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:39,586 INFO L93 Difference]: Finished difference Result 1573 states and 2625 transitions. [2019-10-14 23:50:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:39,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:39,596 INFO L225 Difference]: With dead ends: 1573 [2019-10-14 23:50:39,596 INFO L226 Difference]: Without dead ends: 1064 [2019-10-14 23:50:39,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-10-14 23:50:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 979. [2019-10-14 23:50:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-10-14 23:50:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1637 transitions. [2019-10-14 23:50:39,689 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1637 transitions. Word has length 47 [2019-10-14 23:50:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:39,689 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1637 transitions. [2019-10-14 23:50:39,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1637 transitions. [2019-10-14 23:50:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:39,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:39,693 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] [2019-10-14 23:50:39,694 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 698698418, now seen corresponding path program 1 times [2019-10-14 23:50:39,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:39,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439908780] [2019-10-14 23:50:39,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,826 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:50:39,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439908780] [2019-10-14 23:50:39,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:39,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:39,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768363407] [2019-10-14 23:50:39,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:39,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:39,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:39,829 INFO L87 Difference]: Start difference. First operand 979 states and 1637 transitions. Second operand 4 states. [2019-10-14 23:50:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:40,680 INFO L93 Difference]: Finished difference Result 2560 states and 4211 transitions. [2019-10-14 23:50:40,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:40,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:40,691 INFO L225 Difference]: With dead ends: 2560 [2019-10-14 23:50:40,691 INFO L226 Difference]: Without dead ends: 1619 [2019-10-14 23:50:40,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2019-10-14 23:50:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1507. [2019-10-14 23:50:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2019-10-14 23:50:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2476 transitions. [2019-10-14 23:50:40,832 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2476 transitions. Word has length 47 [2019-10-14 23:50:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:40,833 INFO L462 AbstractCegarLoop]: Abstraction has 1507 states and 2476 transitions. [2019-10-14 23:50:40,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2476 transitions. [2019-10-14 23:50:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:40,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:40,837 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] [2019-10-14 23:50:40,837 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2084901812, now seen corresponding path program 1 times [2019-10-14 23:50:40,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:40,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251317395] [2019-10-14 23:50:40,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,983 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:50:40,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251317395] [2019-10-14 23:50:40,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:40,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:40,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812811421] [2019-10-14 23:50:40,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:40,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:40,986 INFO L87 Difference]: Start difference. First operand 1507 states and 2476 transitions. Second operand 4 states. [2019-10-14 23:50:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:42,231 INFO L93 Difference]: Finished difference Result 4237 states and 7082 transitions. [2019-10-14 23:50:42,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:42,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:42,253 INFO L225 Difference]: With dead ends: 4237 [2019-10-14 23:50:42,254 INFO L226 Difference]: Without dead ends: 2772 [2019-10-14 23:50:42,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-10-14 23:50:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2569. [2019-10-14 23:50:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-10-14 23:50:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4274 transitions. [2019-10-14 23:50:42,493 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4274 transitions. Word has length 47 [2019-10-14 23:50:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:42,494 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 4274 transitions. [2019-10-14 23:50:42,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4274 transitions. [2019-10-14 23:50:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:42,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:42,497 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] [2019-10-14 23:50:42,498 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:42,498 INFO L82 PathProgramCache]: Analyzing trace with hash -785421443, now seen corresponding path program 1 times [2019-10-14 23:50:42,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:42,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088318274] [2019-10-14 23:50:42,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,626 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:50:42,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088318274] [2019-10-14 23:50:42,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:42,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:42,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415473993] [2019-10-14 23:50:42,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:42,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:42,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:42,629 INFO L87 Difference]: Start difference. First operand 2569 states and 4274 transitions. Second operand 4 states. [2019-10-14 23:50:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:43,493 INFO L93 Difference]: Finished difference Result 5407 states and 8974 transitions. [2019-10-14 23:50:43,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:43,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:43,514 INFO L225 Difference]: With dead ends: 5407 [2019-10-14 23:50:43,514 INFO L226 Difference]: Without dead ends: 2916 [2019-10-14 23:50:43,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2019-10-14 23:50:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2731. [2019-10-14 23:50:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2019-10-14 23:50:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 4538 transitions. [2019-10-14 23:50:43,769 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 4538 transitions. Word has length 47 [2019-10-14 23:50:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:43,770 INFO L462 AbstractCegarLoop]: Abstraction has 2731 states and 4538 transitions. [2019-10-14 23:50:43,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 4538 transitions. [2019-10-14 23:50:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:43,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:43,773 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] [2019-10-14 23:50:43,774 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:43,774 INFO L82 PathProgramCache]: Analyzing trace with hash 15163777, now seen corresponding path program 1 times [2019-10-14 23:50:43,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:43,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291694586] [2019-10-14 23:50:43,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,936 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:50:43,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291694586] [2019-10-14 23:50:43,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:43,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:43,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345024302] [2019-10-14 23:50:43,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:43,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:43,939 INFO L87 Difference]: Start difference. First operand 2731 states and 4538 transitions. Second operand 5 states. [2019-10-14 23:50:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:45,070 INFO L93 Difference]: Finished difference Result 5992 states and 9886 transitions. [2019-10-14 23:50:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:45,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:45,097 INFO L225 Difference]: With dead ends: 5992 [2019-10-14 23:50:45,097 INFO L226 Difference]: Without dead ends: 3319 [2019-10-14 23:50:45,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2019-10-14 23:50:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3061. [2019-10-14 23:50:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-10-14 23:50:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 5029 transitions. [2019-10-14 23:50:45,440 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 5029 transitions. Word has length 47 [2019-10-14 23:50:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:45,441 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 5029 transitions. [2019-10-14 23:50:45,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 5029 transitions. [2019-10-14 23:50:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:45,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:45,444 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] [2019-10-14 23:50:45,445 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash 234018495, now seen corresponding path program 1 times [2019-10-14 23:50:45,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:45,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669305869] [2019-10-14 23:50:45,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,582 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:50:45,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669305869] [2019-10-14 23:50:45,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:45,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:45,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388673964] [2019-10-14 23:50:45,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:45,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:45,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:45,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:45,587 INFO L87 Difference]: Start difference. First operand 3061 states and 5029 transitions. Second operand 5 states. [2019-10-14 23:50:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:46,945 INFO L93 Difference]: Finished difference Result 7267 states and 11876 transitions. [2019-10-14 23:50:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:46,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:46,976 INFO L225 Difference]: With dead ends: 7267 [2019-10-14 23:50:46,977 INFO L226 Difference]: Without dead ends: 4312 [2019-10-14 23:50:46,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2019-10-14 23:50:47,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 4030. [2019-10-14 23:50:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4030 states. [2019-10-14 23:50:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 6586 transitions. [2019-10-14 23:50:47,298 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 6586 transitions. Word has length 47 [2019-10-14 23:50:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:47,299 INFO L462 AbstractCegarLoop]: Abstraction has 4030 states and 6586 transitions. [2019-10-14 23:50:47,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 6586 transitions. [2019-10-14 23:50:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:47,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:47,303 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] [2019-10-14 23:50:47,303 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:47,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:47,303 INFO L82 PathProgramCache]: Analyzing trace with hash -583629955, now seen corresponding path program 1 times [2019-10-14 23:50:47,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:47,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128831886] [2019-10-14 23:50:47,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,503 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 23:50:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,513 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:50:47,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128831886] [2019-10-14 23:50:47,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:47,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:47,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074560383] [2019-10-14 23:50:47,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:47,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:47,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:47,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:47,520 INFO L87 Difference]: Start difference. First operand 4030 states and 6586 transitions. Second operand 4 states. [2019-10-14 23:50:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:48,276 INFO L93 Difference]: Finished difference Result 8742 states and 14409 transitions. [2019-10-14 23:50:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:48,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:48,304 INFO L225 Difference]: With dead ends: 8742 [2019-10-14 23:50:48,305 INFO L226 Difference]: Without dead ends: 4866 [2019-10-14 23:50:48,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2019-10-14 23:50:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 4623. [2019-10-14 23:50:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4623 states. [2019-10-14 23:50:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 7484 transitions. [2019-10-14 23:50:48,743 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 7484 transitions. Word has length 47 [2019-10-14 23:50:48,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:48,743 INFO L462 AbstractCegarLoop]: Abstraction has 4623 states and 7484 transitions. [2019-10-14 23:50:48,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 7484 transitions. [2019-10-14 23:50:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:48,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:48,746 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] [2019-10-14 23:50:48,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1717192635, now seen corresponding path program 1 times [2019-10-14 23:50:48,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:48,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570137843] [2019-10-14 23:50:48,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,913 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 23:50:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,922 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:50:48,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570137843] [2019-10-14 23:50:48,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:48,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:48,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336199609] [2019-10-14 23:50:48,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:48,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:48,924 INFO L87 Difference]: Start difference. First operand 4623 states and 7484 transitions. Second operand 4 states. [2019-10-14 23:50:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:50,044 INFO L93 Difference]: Finished difference Result 10187 states and 16730 transitions. [2019-10-14 23:50:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:50,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:50,074 INFO L225 Difference]: With dead ends: 10187 [2019-10-14 23:50:50,074 INFO L226 Difference]: Without dead ends: 5616 [2019-10-14 23:50:50,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2019-10-14 23:50:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 5255. [2019-10-14 23:50:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5255 states. [2019-10-14 23:50:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 8438 transitions. [2019-10-14 23:50:50,418 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 8438 transitions. Word has length 47 [2019-10-14 23:50:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:50,418 INFO L462 AbstractCegarLoop]: Abstraction has 5255 states and 8438 transitions. [2019-10-14 23:50:50,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8438 transitions. [2019-10-14 23:50:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-14 23:50:50,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:50,432 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:50:50,432 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash -683599016, now seen corresponding path program 1 times [2019-10-14 23:50:50,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:50,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243551078] [2019-10-14 23:50:50,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:50,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243551078] [2019-10-14 23:50:50,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653976829] [2019-10-14 23:50:50,605 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:50:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:50,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:50:50,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:50,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-10-14 23:50:50,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234637788] [2019-10-14 23:50:50,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:50,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:50,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:50,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:50,800 INFO L87 Difference]: Start difference. First operand 5255 states and 8438 transitions. Second operand 3 states. [2019-10-14 23:50:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:51,625 INFO L93 Difference]: Finished difference Result 12608 states and 20647 transitions. [2019-10-14 23:50:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:51,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-14 23:50:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:51,660 INFO L225 Difference]: With dead ends: 12608 [2019-10-14 23:50:51,660 INFO L226 Difference]: Without dead ends: 4407 [2019-10-14 23:50:51,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2019-10-14 23:50:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 4407. [2019-10-14 23:50:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4407 states. [2019-10-14 23:50:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 6888 transitions. [2019-10-14 23:50:52,055 INFO L78 Accepts]: Start accepts. Automaton has 4407 states and 6888 transitions. Word has length 81 [2019-10-14 23:50:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:52,056 INFO L462 AbstractCegarLoop]: Abstraction has 4407 states and 6888 transitions. [2019-10-14 23:50:52,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4407 states and 6888 transitions. [2019-10-14 23:50:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-14 23:50:52,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:52,080 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:52,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:52,284 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1614311007, now seen corresponding path program 1 times [2019-10-14 23:50:52,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:52,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510578135] [2019-10-14 23:50:52,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,611 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-10-14 23:50:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 23:50:52,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510578135] [2019-10-14 23:50:52,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:52,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:52,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867569233] [2019-10-14 23:50:52,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:52,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:52,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:52,720 INFO L87 Difference]: Start difference. First operand 4407 states and 6888 transitions. Second operand 8 states. [2019-10-14 23:50:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:55,157 INFO L93 Difference]: Finished difference Result 13983 states and 22705 transitions. [2019-10-14 23:50:55,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:55,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-10-14 23:50:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:55,209 INFO L225 Difference]: With dead ends: 13983 [2019-10-14 23:50:55,209 INFO L226 Difference]: Without dead ends: 9585 [2019-10-14 23:50:55,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:50:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9585 states. [2019-10-14 23:50:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9585 to 7424. [2019-10-14 23:50:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7424 states. [2019-10-14 23:50:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7424 states to 7424 states and 11975 transitions. [2019-10-14 23:50:55,960 INFO L78 Accepts]: Start accepts. Automaton has 7424 states and 11975 transitions. Word has length 124 [2019-10-14 23:50:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:55,961 INFO L462 AbstractCegarLoop]: Abstraction has 7424 states and 11975 transitions. [2019-10-14 23:50:55,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:50:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7424 states and 11975 transitions. [2019-10-14 23:50:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:50:56,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:56,469 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:56,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:56,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2009036392, now seen corresponding path program 1 times [2019-10-14 23:50:56,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:56,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774025421] [2019-10-14 23:50:56,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-14 23:50:56,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774025421] [2019-10-14 23:50:56,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:56,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:56,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719513993] [2019-10-14 23:50:56,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:56,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:56,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:56,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:56,742 INFO L87 Difference]: Start difference. First operand 7424 states and 11975 transitions. Second operand 8 states. [2019-10-14 23:50:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:58,633 INFO L93 Difference]: Finished difference Result 14721 states and 24025 transitions. [2019-10-14 23:50:58,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:58,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-14 23:50:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:58,663 INFO L225 Difference]: With dead ends: 14721 [2019-10-14 23:50:58,663 INFO L226 Difference]: Without dead ends: 7327 [2019-10-14 23:50:58,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7327 states. [2019-10-14 23:50:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7327 to 6511. [2019-10-14 23:50:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6511 states. [2019-10-14 23:50:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 10285 transitions. [2019-10-14 23:50:59,245 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 10285 transitions. Word has length 122 [2019-10-14 23:50:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:59,245 INFO L462 AbstractCegarLoop]: Abstraction has 6511 states and 10285 transitions. [2019-10-14 23:50:59,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:50:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 10285 transitions. [2019-10-14 23:50:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:50:59,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:59,269 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:59,270 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash -446075030, now seen corresponding path program 1 times [2019-10-14 23:50:59,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:59,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648539130] [2019-10-14 23:50:59,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:59,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:59,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 23:50:59,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648539130] [2019-10-14 23:50:59,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:59,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:59,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471384489] [2019-10-14 23:50:59,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:59,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:59,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:59,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:59,544 INFO L87 Difference]: Start difference. First operand 6511 states and 10285 transitions. Second operand 9 states. [2019-10-14 23:51:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:01,789 INFO L93 Difference]: Finished difference Result 11613 states and 18871 transitions. [2019-10-14 23:51:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:51:01,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-10-14 23:51:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:01,829 INFO L225 Difference]: With dead ends: 11613 [2019-10-14 23:51:01,829 INFO L226 Difference]: Without dead ends: 8258 [2019-10-14 23:51:01,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:51:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-10-14 23:51:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 7200. [2019-10-14 23:51:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7200 states. [2019-10-14 23:51:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 11735 transitions. [2019-10-14 23:51:02,639 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 11735 transitions. Word has length 122 [2019-10-14 23:51:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:02,639 INFO L462 AbstractCegarLoop]: Abstraction has 7200 states and 11735 transitions. [2019-10-14 23:51:02,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:51:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 11735 transitions. [2019-10-14 23:51:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:51:02,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:02,658 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:02,658 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:02,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash -247883034, now seen corresponding path program 1 times [2019-10-14 23:51:02,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:02,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739401677] [2019-10-14 23:51:02,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:02,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:02,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:51:02,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739401677] [2019-10-14 23:51:02,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925783652] [2019-10-14 23:51:02,892 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:51:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:03,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:51:03,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:51:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:51:03,168 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:51:03,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-14 23:51:03,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385159736] [2019-10-14 23:51:03,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:51:03,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:03,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:51:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:51:03,171 INFO L87 Difference]: Start difference. First operand 7200 states and 11735 transitions. Second operand 9 states.