/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 03:10:17,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 03:10:17,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 03:10:17,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 03:10:17,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 03:10:17,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 03:10:17,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 03:10:17,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 03:10:17,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 03:10:17,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 03:10:17,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 03:10:17,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 03:10:17,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 03:10:17,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 03:10:17,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 03:10:17,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 03:10:17,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 03:10:18,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 03:10:18,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 03:10:18,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 03:10:18,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 03:10:18,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 03:10:18,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 03:10:18,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 03:10:18,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 03:10:18,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 03:10:18,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 03:10:18,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 03:10:18,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 03:10:18,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 03:10:18,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 03:10:18,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 03:10:18,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 03:10:18,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 03:10:18,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 03:10:18,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 03:10:18,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 03:10:18,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 03:10:18,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 03:10:18,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 03:10:18,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 03:10:18,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 03:10:18,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 03:10:18,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 03:10:18,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 03:10:18,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 03:10:18,126 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 03:10:18,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 03:10:18,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 03:10:18,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 03:10:18,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 03:10:18,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 03:10:18,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 03:10:18,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 03:10:18,130 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 03:10:18,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 03:10:18,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 03:10:18,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 03:10:18,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 03:10:18,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 03:10:18,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 03:10:18,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 03:10:18,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 03:10:18,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 03:10:18,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 03:10:18,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 03:10:18,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 03:10:18,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 03:10:18,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 03:10:18,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 03:10:18,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 03:10:18,586 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 03:10:18,588 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 03:10:18,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2020-12-22 03:10:18,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58dc0ff4c/5729ac81a1a6442c94e528e039515619/FLAG88e66bdd7 [2020-12-22 03:10:19,381 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 03:10:19,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2020-12-22 03:10:19,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58dc0ff4c/5729ac81a1a6442c94e528e039515619/FLAG88e66bdd7 [2020-12-22 03:10:19,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58dc0ff4c/5729ac81a1a6442c94e528e039515619 [2020-12-22 03:10:19,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 03:10:19,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 03:10:19,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 03:10:19,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 03:10:19,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 03:10:19,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:10:19" (1/1) ... [2020-12-22 03:10:19,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d39689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:19, skipping insertion in model container [2020-12-22 03:10:19,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:10:19" (1/1) ... [2020-12-22 03:10:19,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 03:10:19,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 03:10:20,137 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2020-12-22 03:10:20,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 03:10:20,178 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 03:10:20,259 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2020-12-22 03:10:20,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 03:10:20,281 INFO L208 MainTranslator]: Completed translation [2020-12-22 03:10:20,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20 WrapperNode [2020-12-22 03:10:20,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 03:10:20,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 03:10:20,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 03:10:20,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 03:10:20,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 03:10:20,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 03:10:20,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 03:10:20,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 03:10:20,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (1/1) ... [2020-12-22 03:10:20,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 03:10:20,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 03:10:20,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 03:10:20,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 03:10:20,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (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 [2020-12-22 03:10:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 03:10:20,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 03:10:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 03:10:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 03:10:21,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 03:10:21,848 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-22 03:10:21,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:10:21 BoogieIcfgContainer [2020-12-22 03:10:21,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 03:10:21,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 03:10:21,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 03:10:21,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 03:10:21,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 03:10:19" (1/3) ... [2020-12-22 03:10:21,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60896a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:10:21, skipping insertion in model container [2020-12-22 03:10:21,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:10:20" (2/3) ... [2020-12-22 03:10:21,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60896a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:10:21, skipping insertion in model container [2020-12-22 03:10:21,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:10:21" (3/3) ... [2020-12-22 03:10:21,861 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2020-12-22 03:10:21,868 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 03:10:21,874 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 03:10:21,893 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-22 03:10:21,923 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 03:10:21,924 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 03:10:21,924 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 03:10:21,924 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 03:10:21,924 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 03:10:21,925 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 03:10:21,925 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 03:10:21,925 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 03:10:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-12-22 03:10:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 03:10:21,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:21,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:21,953 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2020-12-22 03:10:21,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:21,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075978114] [2020-12-22 03:10:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:22,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075978114] [2020-12-22 03:10:22,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:22,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 03:10:22,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046737265] [2020-12-22 03:10:22,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-22 03:10:22,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:22,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-22 03:10:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 03:10:22,363 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2020-12-22 03:10:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:22,438 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2020-12-22 03:10:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-22 03:10:22,441 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-12-22 03:10:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:22,479 INFO L225 Difference]: With dead ends: 218 [2020-12-22 03:10:22,480 INFO L226 Difference]: Without dead ends: 106 [2020-12-22 03:10:22,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 03:10:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-12-22 03:10:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-12-22 03:10:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-22 03:10:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2020-12-22 03:10:22,583 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2020-12-22 03:10:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:22,584 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2020-12-22 03:10:22,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-22 03:10:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2020-12-22 03:10:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 03:10:22,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:22,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:22,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 03:10:22,591 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2020-12-22 03:10:22,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:22,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853484444] [2020-12-22 03:10:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:22,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853484444] [2020-12-22 03:10:22,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:22,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:22,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653257196] [2020-12-22 03:10:22,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:22,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:22,743 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2020-12-22 03:10:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:22,821 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2020-12-22 03:10:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:22,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-22 03:10:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:22,824 INFO L225 Difference]: With dead ends: 214 [2020-12-22 03:10:22,825 INFO L226 Difference]: Without dead ends: 110 [2020-12-22 03:10:22,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-22 03:10:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-12-22 03:10:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-22 03:10:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2020-12-22 03:10:22,851 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2020-12-22 03:10:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:22,852 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2020-12-22 03:10:22,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2020-12-22 03:10:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 03:10:22,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:22,856 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:22,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 03:10:22,856 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2020-12-22 03:10:22,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:22,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039315272] [2020-12-22 03:10:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:23,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039315272] [2020-12-22 03:10:23,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:23,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:23,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681339154] [2020-12-22 03:10:23,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:23,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:23,092 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 3 states. [2020-12-22 03:10:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:23,291 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2020-12-22 03:10:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:23,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-12-22 03:10:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:23,295 INFO L225 Difference]: With dead ends: 324 [2020-12-22 03:10:23,295 INFO L226 Difference]: Without dead ends: 195 [2020-12-22 03:10:23,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-12-22 03:10:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2020-12-22 03:10:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-12-22 03:10:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2020-12-22 03:10:23,314 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2020-12-22 03:10:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:23,315 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2020-12-22 03:10:23,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2020-12-22 03:10:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 03:10:23,316 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:23,317 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:23,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 03:10:23,317 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:23,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2020-12-22 03:10:23,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:23,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148719456] [2020-12-22 03:10:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:23,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148719456] [2020-12-22 03:10:23,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:23,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:23,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457598554] [2020-12-22 03:10:23,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:23,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:23,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:23,365 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2020-12-22 03:10:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:23,413 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2020-12-22 03:10:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:23,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-22 03:10:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:23,416 INFO L225 Difference]: With dead ends: 314 [2020-12-22 03:10:23,416 INFO L226 Difference]: Without dead ends: 133 [2020-12-22 03:10:23,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-22 03:10:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2020-12-22 03:10:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-12-22 03:10:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2020-12-22 03:10:23,428 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2020-12-22 03:10:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:23,429 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2020-12-22 03:10:23,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2020-12-22 03:10:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 03:10:23,430 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:23,431 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:23,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 03:10:23,435 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2020-12-22 03:10:23,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:23,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378356098] [2020-12-22 03:10:23,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-22 03:10:23,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378356098] [2020-12-22 03:10:23,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:23,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:23,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406374459] [2020-12-22 03:10:23,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:23,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:23,572 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2020-12-22 03:10:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:23,634 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2020-12-22 03:10:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:23,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-22 03:10:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:23,636 INFO L225 Difference]: With dead ends: 243 [2020-12-22 03:10:23,637 INFO L226 Difference]: Without dead ends: 115 [2020-12-22 03:10:23,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-22 03:10:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2020-12-22 03:10:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-22 03:10:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2020-12-22 03:10:23,646 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2020-12-22 03:10:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:23,646 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2020-12-22 03:10:23,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2020-12-22 03:10:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 03:10:23,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:23,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:23,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 03:10:23,649 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:23,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2020-12-22 03:10:23,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:23,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229319680] [2020-12-22 03:10:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:23,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229319680] [2020-12-22 03:10:23,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921336068] [2020-12-22 03:10:23,719 INFO L95 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 [2020-12-22 03:10:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:23,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-22 03:10:23,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:23,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:23,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-22 03:10:23,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338196790] [2020-12-22 03:10:23,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 03:10:23,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 03:10:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:10:23,957 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2020-12-22 03:10:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:24,215 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2020-12-22 03:10:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 03:10:24,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-12-22 03:10:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:24,218 INFO L225 Difference]: With dead ends: 204 [2020-12-22 03:10:24,218 INFO L226 Difference]: Without dead ends: 192 [2020-12-22 03:10:24,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:10:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-12-22 03:10:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2020-12-22 03:10:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-12-22 03:10:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2020-12-22 03:10:24,229 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2020-12-22 03:10:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:24,229 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2020-12-22 03:10:24,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 03:10:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2020-12-22 03:10:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 03:10:24,231 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:24,231 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:24,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-22 03:10:24,445 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2020-12-22 03:10:24,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:24,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932244303] [2020-12-22 03:10:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:24,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932244303] [2020-12-22 03:10:24,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105213976] [2020-12-22 03:10:24,706 INFO L95 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 [2020-12-22 03:10:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:24,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-22 03:10:24,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:24,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:24,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-12-22 03:10:24,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302600144] [2020-12-22 03:10:24,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 03:10:24,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:24,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 03:10:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 03:10:24,901 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 6 states. [2020-12-22 03:10:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:25,090 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2020-12-22 03:10:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:10:25,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-12-22 03:10:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:25,093 INFO L225 Difference]: With dead ends: 387 [2020-12-22 03:10:25,093 INFO L226 Difference]: Without dead ends: 230 [2020-12-22 03:10:25,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 03:10:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-12-22 03:10:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2020-12-22 03:10:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-12-22 03:10:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2020-12-22 03:10:25,106 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2020-12-22 03:10:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:25,106 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2020-12-22 03:10:25,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 03:10:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2020-12-22 03:10:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-22 03:10:25,108 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:25,108 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:25,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:25,322 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2020-12-22 03:10:25,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:25,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394613100] [2020-12-22 03:10:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-22 03:10:25,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394613100] [2020-12-22 03:10:25,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:25,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:25,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459338929] [2020-12-22 03:10:25,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:25,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:25,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:25,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:25,370 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2020-12-22 03:10:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:25,409 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2020-12-22 03:10:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:25,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-22 03:10:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:25,411 INFO L225 Difference]: With dead ends: 409 [2020-12-22 03:10:25,412 INFO L226 Difference]: Without dead ends: 211 [2020-12-22 03:10:25,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-12-22 03:10:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-12-22 03:10:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-22 03:10:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2020-12-22 03:10:25,421 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2020-12-22 03:10:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:25,422 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2020-12-22 03:10:25,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2020-12-22 03:10:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 03:10:25,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:25,424 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:25,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 03:10:25,424 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2020-12-22 03:10:25,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:25,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876923971] [2020-12-22 03:10:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:25,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876923971] [2020-12-22 03:10:25,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:25,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:25,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113522992] [2020-12-22 03:10:25,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:25,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:25,477 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2020-12-22 03:10:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:25,514 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2020-12-22 03:10:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:25,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-22 03:10:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:25,516 INFO L225 Difference]: With dead ends: 375 [2020-12-22 03:10:25,516 INFO L226 Difference]: Without dead ends: 211 [2020-12-22 03:10:25,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-12-22 03:10:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-12-22 03:10:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-22 03:10:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2020-12-22 03:10:25,524 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2020-12-22 03:10:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:25,525 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2020-12-22 03:10:25,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2020-12-22 03:10:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-22 03:10:25,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:25,527 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:25,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 03:10:25,527 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2020-12-22 03:10:25,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:25,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318874069] [2020-12-22 03:10:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:25,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318874069] [2020-12-22 03:10:25,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572657852] [2020-12-22 03:10:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:25,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-22 03:10:25,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:10:26,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:26,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-12-22 03:10:26,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96992366] [2020-12-22 03:10:26,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 03:10:26,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 03:10:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-22 03:10:26,052 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 8 states. [2020-12-22 03:10:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:26,559 INFO L93 Difference]: Finished difference Result 490 states and 766 transitions. [2020-12-22 03:10:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 03:10:26,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-12-22 03:10:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:26,562 INFO L225 Difference]: With dead ends: 490 [2020-12-22 03:10:26,562 INFO L226 Difference]: Without dead ends: 275 [2020-12-22 03:10:26,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-22 03:10:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-12-22 03:10:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2020-12-22 03:10:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-12-22 03:10:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2020-12-22 03:10:26,573 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2020-12-22 03:10:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:26,574 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2020-12-22 03:10:26,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 03:10:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2020-12-22 03:10:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-22 03:10:26,575 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:26,575 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:26,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-22 03:10:26,789 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2020-12-22 03:10:26,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:26,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027902095] [2020-12-22 03:10:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:10:26,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027902095] [2020-12-22 03:10:26,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542719864] [2020-12-22 03:10:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:27,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-22 03:10:27,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:10:27,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:27,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-22 03:10:27,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964019783] [2020-12-22 03:10:27,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 03:10:27,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 03:10:27,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:10:27,128 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2020-12-22 03:10:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:27,270 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2020-12-22 03:10:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:10:27,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-22 03:10:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:27,276 INFO L225 Difference]: With dead ends: 274 [2020-12-22 03:10:27,277 INFO L226 Difference]: Without dead ends: 262 [2020-12-22 03:10:27,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:10:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-12-22 03:10:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-12-22 03:10:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-12-22 03:10:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2020-12-22 03:10:27,292 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2020-12-22 03:10:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:27,292 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2020-12-22 03:10:27,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 03:10:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2020-12-22 03:10:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-22 03:10:27,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:27,294 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:27,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:27,509 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2020-12-22 03:10:27,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:27,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143460049] [2020-12-22 03:10:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:27,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143460049] [2020-12-22 03:10:27,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027579201] [2020-12-22 03:10:27,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:27,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-22 03:10:27,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:27,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:27,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-22 03:10:27,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854018721] [2020-12-22 03:10:27,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 03:10:27,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:27,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 03:10:27,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 03:10:27,910 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 6 states. [2020-12-22 03:10:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:28,097 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2020-12-22 03:10:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 03:10:28,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-12-22 03:10:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:28,100 INFO L225 Difference]: With dead ends: 271 [2020-12-22 03:10:28,100 INFO L226 Difference]: Without dead ends: 269 [2020-12-22 03:10:28,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 03:10:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-22 03:10:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2020-12-22 03:10:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2020-12-22 03:10:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2020-12-22 03:10:28,136 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2020-12-22 03:10:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:28,137 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2020-12-22 03:10:28,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 03:10:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2020-12-22 03:10:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 03:10:28,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:28,138 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:28,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-22 03:10:28,354 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2020-12-22 03:10:28,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:28,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530647160] [2020-12-22 03:10:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:28,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530647160] [2020-12-22 03:10:28,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:28,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:28,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852901865] [2020-12-22 03:10:28,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:28,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:28,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:28,409 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2020-12-22 03:10:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:28,457 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2020-12-22 03:10:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:28,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-12-22 03:10:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:28,460 INFO L225 Difference]: With dead ends: 461 [2020-12-22 03:10:28,460 INFO L226 Difference]: Without dead ends: 245 [2020-12-22 03:10:28,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-12-22 03:10:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2020-12-22 03:10:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-12-22 03:10:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2020-12-22 03:10:28,471 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2020-12-22 03:10:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:28,471 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2020-12-22 03:10:28,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2020-12-22 03:10:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-22 03:10:28,474 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:28,474 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:28,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 03:10:28,475 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2020-12-22 03:10:28,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:28,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118663678] [2020-12-22 03:10:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-22 03:10:28,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118663678] [2020-12-22 03:10:28,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:10:28,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:10:28,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301961137] [2020-12-22 03:10:28,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:10:28,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:10:28,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:28,595 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2020-12-22 03:10:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:28,661 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2020-12-22 03:10:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:10:28,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-22 03:10:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:28,665 INFO L225 Difference]: With dead ends: 333 [2020-12-22 03:10:28,665 INFO L226 Difference]: Without dead ends: 155 [2020-12-22 03:10:28,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:10:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-22 03:10:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-12-22 03:10:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-22 03:10:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2020-12-22 03:10:28,674 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2020-12-22 03:10:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:28,675 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2020-12-22 03:10:28,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:10:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2020-12-22 03:10:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-22 03:10:28,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:28,676 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2020-12-22 03:10:28,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 03:10:28,677 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2020-12-22 03:10:28,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:28,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449567937] [2020-12-22 03:10:28,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:10:28,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449567937] [2020-12-22 03:10:28,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669740293] [2020-12-22 03:10:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:28,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-22 03:10:28,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:10:29,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:29,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-12-22 03:10:29,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413644548] [2020-12-22 03:10:29,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 03:10:29,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 03:10:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:10:29,008 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2020-12-22 03:10:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:29,117 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2020-12-22 03:10:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 03:10:29,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-12-22 03:10:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:29,120 INFO L225 Difference]: With dead ends: 286 [2020-12-22 03:10:29,120 INFO L226 Difference]: Without dead ends: 194 [2020-12-22 03:10:29,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:10:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-22 03:10:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2020-12-22 03:10:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-12-22 03:10:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2020-12-22 03:10:29,132 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2020-12-22 03:10:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:29,132 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2020-12-22 03:10:29,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 03:10:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2020-12-22 03:10:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-22 03:10:29,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:29,133 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2020-12-22 03:10:29,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:29,340 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:29,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2020-12-22 03:10:29,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:29,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601996105] [2020-12-22 03:10:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:29,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601996105] [2020-12-22 03:10:29,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309976847] [2020-12-22 03:10:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:29,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-22 03:10:29,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:29,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:29,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-22 03:10:29,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888126380] [2020-12-22 03:10:29,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 03:10:29,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:29,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 03:10:29,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:10:29,898 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 7 states. [2020-12-22 03:10:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:30,023 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2020-12-22 03:10:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 03:10:30,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-12-22 03:10:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:30,025 INFO L225 Difference]: With dead ends: 193 [2020-12-22 03:10:30,025 INFO L226 Difference]: Without dead ends: 191 [2020-12-22 03:10:30,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:10:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-22 03:10:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-12-22 03:10:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-12-22 03:10:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2020-12-22 03:10:30,034 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2020-12-22 03:10:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:30,034 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2020-12-22 03:10:30,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 03:10:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2020-12-22 03:10:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-22 03:10:30,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:30,035 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:30,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-22 03:10:30,249 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2020-12-22 03:10:30,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:30,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12937800] [2020-12-22 03:10:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:30,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12937800] [2020-12-22 03:10:30,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867220076] [2020-12-22 03:10:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:30,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-22 03:10:30,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:30,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:30,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-22 03:10:30,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76707944] [2020-12-22 03:10:30,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 03:10:30,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 03:10:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 03:10:30,966 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 8 states. [2020-12-22 03:10:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:31,131 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2020-12-22 03:10:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 03:10:31,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-12-22 03:10:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:31,135 INFO L225 Difference]: With dead ends: 196 [2020-12-22 03:10:31,135 INFO L226 Difference]: Without dead ends: 194 [2020-12-22 03:10:31,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 03:10:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-22 03:10:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2020-12-22 03:10:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-22 03:10:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2020-12-22 03:10:31,151 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2020-12-22 03:10:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:31,152 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2020-12-22 03:10:31,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 03:10:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2020-12-22 03:10:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-22 03:10:31,154 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:31,155 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 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] [2020-12-22 03:10:31,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-22 03:10:31,368 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2020-12-22 03:10:31,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:31,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560893085] [2020-12-22 03:10:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:31,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560893085] [2020-12-22 03:10:31,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178156716] [2020-12-22 03:10:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:31,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-22 03:10:31,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:32,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:32,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-12-22 03:10:32,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168748455] [2020-12-22 03:10:32,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 03:10:32,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:32,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 03:10:32,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-22 03:10:32,038 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 13 states. [2020-12-22 03:10:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:32,330 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2020-12-22 03:10:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 03:10:32,331 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2020-12-22 03:10:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:32,333 INFO L225 Difference]: With dead ends: 301 [2020-12-22 03:10:32,333 INFO L226 Difference]: Without dead ends: 211 [2020-12-22 03:10:32,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-12-22 03:10:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-12-22 03:10:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-12-22 03:10:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-22 03:10:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2020-12-22 03:10:32,347 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2020-12-22 03:10:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:32,347 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2020-12-22 03:10:32,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 03:10:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2020-12-22 03:10:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-22 03:10:32,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:32,352 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 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] [2020-12-22 03:10:32,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-22 03:10:32,567 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2020-12-22 03:10:32,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:32,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048498882] [2020-12-22 03:10:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:32,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048498882] [2020-12-22 03:10:32,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881480090] [2020-12-22 03:10:32,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:33,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-22 03:10:33,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-22 03:10:33,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:33,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-12-22 03:10:33,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894512218] [2020-12-22 03:10:33,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 03:10:33,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 03:10:33,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-22 03:10:33,252 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 9 states. [2020-12-22 03:10:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:33,624 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2020-12-22 03:10:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 03:10:33,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2020-12-22 03:10:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:33,627 INFO L225 Difference]: With dead ends: 329 [2020-12-22 03:10:33,627 INFO L226 Difference]: Without dead ends: 239 [2020-12-22 03:10:33,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-22 03:10:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-22 03:10:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2020-12-22 03:10:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-22 03:10:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2020-12-22 03:10:33,641 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2020-12-22 03:10:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:33,641 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2020-12-22 03:10:33,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 03:10:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2020-12-22 03:10:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-22 03:10:33,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:33,643 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:33,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:33,857 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2020-12-22 03:10:33,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:33,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687334970] [2020-12-22 03:10:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:34,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687334970] [2020-12-22 03:10:34,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986855810] [2020-12-22 03:10:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:34,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-22 03:10:34,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:34,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:34,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2020-12-22 03:10:34,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228185663] [2020-12-22 03:10:34,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 03:10:34,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:34,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 03:10:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-22 03:10:34,705 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 13 states. [2020-12-22 03:10:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:34,987 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2020-12-22 03:10:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 03:10:34,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2020-12-22 03:10:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:34,990 INFO L225 Difference]: With dead ends: 233 [2020-12-22 03:10:34,990 INFO L226 Difference]: Without dead ends: 231 [2020-12-22 03:10:34,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-12-22 03:10:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-12-22 03:10:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2020-12-22 03:10:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-12-22 03:10:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2020-12-22 03:10:35,003 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2020-12-22 03:10:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:35,004 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2020-12-22 03:10:35,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 03:10:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2020-12-22 03:10:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-22 03:10:35,005 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:35,005 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:35,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:35,220 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2020-12-22 03:10:35,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:35,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501719536] [2020-12-22 03:10:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-22 03:10:35,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501719536] [2020-12-22 03:10:35,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876063842] [2020-12-22 03:10:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:35,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-22 03:10:35,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-22 03:10:35,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:35,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-12-22 03:10:35,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101634515] [2020-12-22 03:10:35,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 03:10:35,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:35,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 03:10:35,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:10:35,836 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2020-12-22 03:10:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:36,029 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2020-12-22 03:10:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 03:10:36,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2020-12-22 03:10:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:36,032 INFO L225 Difference]: With dead ends: 364 [2020-12-22 03:10:36,032 INFO L226 Difference]: Without dead ends: 272 [2020-12-22 03:10:36,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:10:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-22 03:10:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2020-12-22 03:10:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-12-22 03:10:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2020-12-22 03:10:36,044 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2020-12-22 03:10:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:36,044 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2020-12-22 03:10:36,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 03:10:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2020-12-22 03:10:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-22 03:10:36,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:36,046 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:36,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:36,255 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2020-12-22 03:10:36,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:36,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831500991] [2020-12-22 03:10:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:36,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831500991] [2020-12-22 03:10:36,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579458528] [2020-12-22 03:10:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:36,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-22 03:10:36,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:37,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:37,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-12-22 03:10:37,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065811796] [2020-12-22 03:10:37,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 03:10:37,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:37,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 03:10:37,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-22 03:10:37,112 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 14 states. [2020-12-22 03:10:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:37,625 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2020-12-22 03:10:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 03:10:37,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2020-12-22 03:10:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:37,631 INFO L225 Difference]: With dead ends: 271 [2020-12-22 03:10:37,631 INFO L226 Difference]: Without dead ends: 269 [2020-12-22 03:10:37,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-12-22 03:10:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-22 03:10:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2020-12-22 03:10:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-12-22 03:10:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2020-12-22 03:10:37,644 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2020-12-22 03:10:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:37,645 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2020-12-22 03:10:37,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 03:10:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2020-12-22 03:10:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-22 03:10:37,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:37,647 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:37,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-22 03:10:37,860 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2020-12-22 03:10:37,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:37,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442326651] [2020-12-22 03:10:37,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 198 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:38,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442326651] [2020-12-22 03:10:38,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019762079] [2020-12-22 03:10:38,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:38,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:10:38,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:38,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-22 03:10:38,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:38,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:38,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2020-12-22 03:10:38,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917704445] [2020-12-22 03:10:38,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 03:10:38,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 03:10:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-12-22 03:10:38,893 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 16 states. [2020-12-22 03:10:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:39,330 INFO L93 Difference]: Finished difference Result 274 states and 383 transitions. [2020-12-22 03:10:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 03:10:39,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2020-12-22 03:10:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:39,333 INFO L225 Difference]: With dead ends: 274 [2020-12-22 03:10:39,333 INFO L226 Difference]: Without dead ends: 272 [2020-12-22 03:10:39,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-12-22 03:10:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-22 03:10:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2020-12-22 03:10:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-12-22 03:10:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2020-12-22 03:10:39,348 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2020-12-22 03:10:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:39,348 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2020-12-22 03:10:39,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 03:10:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2020-12-22 03:10:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-22 03:10:39,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:39,350 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:39,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:39,566 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2020-12-22 03:10:39,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:39,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534803921] [2020-12-22 03:10:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 03:10:39,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534803921] [2020-12-22 03:10:39,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663328722] [2020-12-22 03:10:39,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:40,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:10:40,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:40,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 43 conjunts are in the unsatisfiable core [2020-12-22 03:10:40,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:40,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:40,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2020-12-22 03:10:40,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9197143] [2020-12-22 03:10:40,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-22 03:10:40,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:40,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-22 03:10:40,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2020-12-22 03:10:40,554 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 20 states. [2020-12-22 03:10:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:41,050 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2020-12-22 03:10:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 03:10:41,051 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2020-12-22 03:10:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:41,053 INFO L225 Difference]: With dead ends: 379 [2020-12-22 03:10:41,054 INFO L226 Difference]: Without dead ends: 289 [2020-12-22 03:10:41,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2020-12-22 03:10:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-22 03:10:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2020-12-22 03:10:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2020-12-22 03:10:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2020-12-22 03:10:41,067 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2020-12-22 03:10:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:41,067 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2020-12-22 03:10:41,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-22 03:10:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2020-12-22 03:10:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-22 03:10:41,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:41,069 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:41,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-22 03:10:41,282 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2020-12-22 03:10:41,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:41,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955546452] [2020-12-22 03:10:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 304 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 03:10:41,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955546452] [2020-12-22 03:10:41,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439080879] [2020-12-22 03:10:41,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:41,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:10:41,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:41,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-22 03:10:41,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-22 03:10:42,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:42,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-12-22 03:10:42,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568385184] [2020-12-22 03:10:42,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 03:10:42,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 03:10:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-22 03:10:42,195 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 11 states. [2020-12-22 03:10:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:42,711 INFO L93 Difference]: Finished difference Result 408 states and 578 transitions. [2020-12-22 03:10:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 03:10:42,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2020-12-22 03:10:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:42,715 INFO L225 Difference]: With dead ends: 408 [2020-12-22 03:10:42,715 INFO L226 Difference]: Without dead ends: 318 [2020-12-22 03:10:42,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-12-22 03:10:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-12-22 03:10:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 308. [2020-12-22 03:10:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-22 03:10:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2020-12-22 03:10:42,728 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2020-12-22 03:10:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:42,728 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2020-12-22 03:10:42,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 03:10:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2020-12-22 03:10:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-22 03:10:42,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:42,730 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:42,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:42,945 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2020-12-22 03:10:42,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:42,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325278118] [2020-12-22 03:10:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 314 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 03:10:43,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325278118] [2020-12-22 03:10:43,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526647001] [2020-12-22 03:10:43,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:43,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:10:43,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:43,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-22 03:10:43,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:44,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:44,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2020-12-22 03:10:44,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528892325] [2020-12-22 03:10:44,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 03:10:44,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 03:10:44,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2020-12-22 03:10:44,273 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 19 states. [2020-12-22 03:10:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:44,688 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2020-12-22 03:10:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 03:10:44,689 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 132 [2020-12-22 03:10:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:44,691 INFO L225 Difference]: With dead ends: 311 [2020-12-22 03:10:44,692 INFO L226 Difference]: Without dead ends: 309 [2020-12-22 03:10:44,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2020-12-22 03:10:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-12-22 03:10:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2020-12-22 03:10:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-12-22 03:10:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2020-12-22 03:10:44,706 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2020-12-22 03:10:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:44,706 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2020-12-22 03:10:44,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 03:10:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2020-12-22 03:10:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-22 03:10:44,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:44,709 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:44,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-22 03:10:44,923 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:44,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2020-12-22 03:10:44,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:44,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118295721] [2020-12-22 03:10:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-22 03:10:45,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118295721] [2020-12-22 03:10:45,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071325744] [2020-12-22 03:10:45,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:45,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:10:45,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:45,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-22 03:10:45,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-22 03:10:45,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:45,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-12-22 03:10:45,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138145794] [2020-12-22 03:10:45,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 03:10:45,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 03:10:45,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-22 03:10:45,764 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2020-12-22 03:10:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:46,042 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2020-12-22 03:10:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 03:10:46,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2020-12-22 03:10:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:46,046 INFO L225 Difference]: With dead ends: 442 [2020-12-22 03:10:46,046 INFO L226 Difference]: Without dead ends: 350 [2020-12-22 03:10:46,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-22 03:10:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-12-22 03:10:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2020-12-22 03:10:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-12-22 03:10:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2020-12-22 03:10:46,060 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2020-12-22 03:10:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:46,061 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2020-12-22 03:10:46,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 03:10:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2020-12-22 03:10:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-22 03:10:46,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:46,063 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:46,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-22 03:10:46,278 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2020-12-22 03:10:46,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:46,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617470954] [2020-12-22 03:10:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 03:10:46,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617470954] [2020-12-22 03:10:46,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192199426] [2020-12-22 03:10:46,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:46,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:10:46,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:46,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 51 conjunts are in the unsatisfiable core [2020-12-22 03:10:46,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:10:47,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:47,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2020-12-22 03:10:47,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25596373] [2020-12-22 03:10:47,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-22 03:10:47,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:47,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-22 03:10:47,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2020-12-22 03:10:47,503 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 23 states. [2020-12-22 03:10:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:48,098 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2020-12-22 03:10:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 03:10:48,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 148 [2020-12-22 03:10:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:48,103 INFO L225 Difference]: With dead ends: 349 [2020-12-22 03:10:48,103 INFO L226 Difference]: Without dead ends: 347 [2020-12-22 03:10:48,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2020-12-22 03:10:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-12-22 03:10:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2020-12-22 03:10:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-12-22 03:10:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2020-12-22 03:10:48,120 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2020-12-22 03:10:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:48,120 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2020-12-22 03:10:48,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-22 03:10:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2020-12-22 03:10:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-22 03:10:48,122 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:48,123 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:48,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-22 03:10:48,337 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2020-12-22 03:10:48,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:48,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963491390] [2020-12-22 03:10:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 454 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 03:10:49,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963491390] [2020-12-22 03:10:49,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261656783] [2020-12-22 03:10:49,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:49,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-22 03:10:49,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:49,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-22 03:10:49,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 248 proven. 32 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2020-12-22 03:10:49,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:49,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2020-12-22 03:10:49,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221381191] [2020-12-22 03:10:49,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 03:10:49,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:49,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 03:10:49,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-12-22 03:10:49,700 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 16 states. [2020-12-22 03:10:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:51,432 INFO L93 Difference]: Finished difference Result 544 states and 765 transitions. [2020-12-22 03:10:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-22 03:10:51,433 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 155 [2020-12-22 03:10:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:51,436 INFO L225 Difference]: With dead ends: 544 [2020-12-22 03:10:51,436 INFO L226 Difference]: Without dead ends: 448 [2020-12-22 03:10:51,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=1330, Unknown=0, NotChecked=0, Total=1482 [2020-12-22 03:10:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-12-22 03:10:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2020-12-22 03:10:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-12-22 03:10:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2020-12-22 03:10:51,453 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2020-12-22 03:10:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:51,453 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2020-12-22 03:10:51,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 03:10:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2020-12-22 03:10:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-12-22 03:10:51,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:51,457 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:51,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-22 03:10:51,671 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:51,672 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2020-12-22 03:10:51,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:51,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162924807] [2020-12-22 03:10:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-22 03:10:51,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162924807] [2020-12-22 03:10:51,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815572456] [2020-12-22 03:10:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:52,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-22 03:10:52,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-22 03:10:52,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:52,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-12-22 03:10:52,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396356600] [2020-12-22 03:10:52,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 03:10:52,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:52,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 03:10:52,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-22 03:10:52,411 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 11 states. [2020-12-22 03:10:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:52,656 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2020-12-22 03:10:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 03:10:52,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2020-12-22 03:10:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:52,661 INFO L225 Difference]: With dead ends: 927 [2020-12-22 03:10:52,661 INFO L226 Difference]: Without dead ends: 760 [2020-12-22 03:10:52,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-22 03:10:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2020-12-22 03:10:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2020-12-22 03:10:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-12-22 03:10:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2020-12-22 03:10:52,694 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2020-12-22 03:10:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:52,694 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2020-12-22 03:10:52,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 03:10:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2020-12-22 03:10:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-22 03:10:52,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:52,697 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:52,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:52,913 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2020-12-22 03:10:52,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:52,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008890972] [2020-12-22 03:10:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:53,552 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2020-12-22 03:10:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 512 proven. 150 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-22 03:10:53,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008890972] [2020-12-22 03:10:53,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441535383] [2020-12-22 03:10:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:53,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-22 03:10:53,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-22 03:10:54,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 03:10:54,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 13 [2020-12-22 03:10:54,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249177590] [2020-12-22 03:10:54,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 03:10:54,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:54,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 03:10:54,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-12-22 03:10:54,149 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 10 states. [2020-12-22 03:10:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:54,325 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2020-12-22 03:10:54,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 03:10:54,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-12-22 03:10:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:54,331 INFO L225 Difference]: With dead ends: 860 [2020-12-22 03:10:54,331 INFO L226 Difference]: Without dead ends: 856 [2020-12-22 03:10:54,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-12-22 03:10:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2020-12-22 03:10:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2020-12-22 03:10:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-12-22 03:10:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2020-12-22 03:10:54,358 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2020-12-22 03:10:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:54,358 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2020-12-22 03:10:54,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 03:10:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2020-12-22 03:10:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-22 03:10:54,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:54,361 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:54,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:54,575 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2020-12-22 03:10:54,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:54,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360380560] [2020-12-22 03:10:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 626 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-22 03:10:55,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360380560] [2020-12-22 03:10:55,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34830590] [2020-12-22 03:10:55,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:55,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-12-22 03:10:55,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:10:55,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-22 03:10:55,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 554 proven. 137 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:10:56,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:56,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2020-12-22 03:10:56,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259465531] [2020-12-22 03:10:56,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-22 03:10:56,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-22 03:10:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2020-12-22 03:10:56,394 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 27 states. [2020-12-22 03:10:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:57,792 INFO L93 Difference]: Finished difference Result 867 states and 1213 transitions. [2020-12-22 03:10:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-22 03:10:57,793 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 178 [2020-12-22 03:10:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:57,798 INFO L225 Difference]: With dead ends: 867 [2020-12-22 03:10:57,798 INFO L226 Difference]: Without dead ends: 865 [2020-12-22 03:10:57,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=343, Invalid=1727, Unknown=0, NotChecked=0, Total=2070 [2020-12-22 03:10:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2020-12-22 03:10:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 852. [2020-12-22 03:10:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-12-22 03:10:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2020-12-22 03:10:57,825 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2020-12-22 03:10:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:57,826 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2020-12-22 03:10:57,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-22 03:10:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2020-12-22 03:10:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-22 03:10:57,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:57,829 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:58,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-12-22 03:10:58,044 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2020-12-22 03:10:58,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:58,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392222865] [2020-12-22 03:10:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-22 03:10:58,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392222865] [2020-12-22 03:10:58,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093757733] [2020-12-22 03:10:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:58,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-22 03:10:58,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:10:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-22 03:10:58,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:10:58,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-12-22 03:10:58,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444452179] [2020-12-22 03:10:58,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 03:10:58,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:10:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 03:10:58,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-12-22 03:10:58,808 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand 12 states. [2020-12-22 03:10:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:10:59,028 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2020-12-22 03:10:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 03:10:59,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 193 [2020-12-22 03:10:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:10:59,034 INFO L225 Difference]: With dead ends: 1435 [2020-12-22 03:10:59,034 INFO L226 Difference]: Without dead ends: 959 [2020-12-22 03:10:59,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-12-22 03:10:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-12-22 03:10:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2020-12-22 03:10:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-12-22 03:10:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2020-12-22 03:10:59,068 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2020-12-22 03:10:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:10:59,068 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2020-12-22 03:10:59,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 03:10:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2020-12-22 03:10:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-12-22 03:10:59,085 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:10:59,085 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:10:59,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:10:59,299 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:10:59,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:10:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2020-12-22 03:10:59,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:10:59,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828302684] [2020-12-22 03:10:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:10:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:10:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 742 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-22 03:10:59,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828302684] [2020-12-22 03:10:59,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273242751] [2020-12-22 03:10:59,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:11:00,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-12-22 03:11:00,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:11:00,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-22 03:11:00,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:11:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-22 03:11:00,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:11:00,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2020-12-22 03:11:00,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276884317] [2020-12-22 03:11:00,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-22 03:11:00,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:11:00,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-22 03:11:00,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-12-22 03:11:00,691 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand 24 states. [2020-12-22 03:11:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:11:01,448 INFO L93 Difference]: Finished difference Result 938 states and 1317 transitions. [2020-12-22 03:11:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-22 03:11:01,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 194 [2020-12-22 03:11:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:11:01,455 INFO L225 Difference]: With dead ends: 938 [2020-12-22 03:11:01,455 INFO L226 Difference]: Without dead ends: 936 [2020-12-22 03:11:01,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2020-12-22 03:11:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2020-12-22 03:11:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2020-12-22 03:11:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-12-22 03:11:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2020-12-22 03:11:01,491 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2020-12-22 03:11:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:11:01,491 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2020-12-22 03:11:01,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-22 03:11:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2020-12-22 03:11:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-22 03:11:01,493 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:11:01,493 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:11:01,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-22 03:11:01,707 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:11:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:11:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2020-12-22 03:11:01,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:11:01,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203797273] [2020-12-22 03:11:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:11:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:11:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-22 03:11:02,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203797273] [2020-12-22 03:11:02,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255629643] [2020-12-22 03:11:02,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:11:02,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:11:02,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:11:02,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-22 03:11:02,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:11:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-22 03:11:02,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:11:02,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-12-22 03:11:02,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644637749] [2020-12-22 03:11:02,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 03:11:02,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:11:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 03:11:02,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-12-22 03:11:02,639 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 13 states. [2020-12-22 03:11:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:11:02,925 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2020-12-22 03:11:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 03:11:02,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 211 [2020-12-22 03:11:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:11:02,932 INFO L225 Difference]: With dead ends: 1125 [2020-12-22 03:11:02,932 INFO L226 Difference]: Without dead ends: 1040 [2020-12-22 03:11:02,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-12-22 03:11:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2020-12-22 03:11:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2020-12-22 03:11:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2020-12-22 03:11:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2020-12-22 03:11:02,970 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2020-12-22 03:11:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:11:02,970 INFO L481 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2020-12-22 03:11:02,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 03:11:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2020-12-22 03:11:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-12-22 03:11:02,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:11:02,973 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:11:03,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-22 03:11:03,186 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:11:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:11:03,187 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2020-12-22 03:11:03,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:11:03,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118476808] [2020-12-22 03:11:03,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:11:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:11:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-22 03:11:03,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118476808] [2020-12-22 03:11:03,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106792971] [2020-12-22 03:11:03,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:11:03,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 03:11:03,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:11:03,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-22 03:11:03,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:11:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-22 03:11:04,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:11:04,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-12-22 03:11:04,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557520706] [2020-12-22 03:11:04,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 03:11:04,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:11:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 03:11:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-12-22 03:11:04,159 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand 14 states. [2020-12-22 03:11:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:11:04,472 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2020-12-22 03:11:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 03:11:04,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 239 [2020-12-22 03:11:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:11:04,479 INFO L225 Difference]: With dead ends: 1675 [2020-12-22 03:11:04,480 INFO L226 Difference]: Without dead ends: 1121 [2020-12-22 03:11:04,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-12-22 03:11:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2020-12-22 03:11:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2020-12-22 03:11:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2020-12-22 03:11:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2020-12-22 03:11:04,516 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2020-12-22 03:11:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:11:04,517 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2020-12-22 03:11:04,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 03:11:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2020-12-22 03:11:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-12-22 03:11:04,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:11:04,519 INFO L422 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:11:04,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-12-22 03:11:04,733 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:11:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:11:04,734 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2020-12-22 03:11:04,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:11:04,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008694532] [2020-12-22 03:11:04,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:11:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:11:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-22 03:11:05,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008694532] [2020-12-22 03:11:05,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047778101] [2020-12-22 03:11:05,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:11:05,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-12-22 03:11:05,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:11:05,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-22 03:11:05,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:11:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-22 03:11:05,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:11:05,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2020-12-22 03:11:05,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694074365] [2020-12-22 03:11:05,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 03:11:05,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:11:05,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 03:11:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-12-22 03:11:05,948 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand 15 states. [2020-12-22 03:11:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:11:06,291 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2020-12-22 03:11:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 03:11:06,292 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 257 [2020-12-22 03:11:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:11:06,299 INFO L225 Difference]: With dead ends: 1287 [2020-12-22 03:11:06,299 INFO L226 Difference]: Without dead ends: 1202 [2020-12-22 03:11:06,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-12-22 03:11:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-12-22 03:11:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2020-12-22 03:11:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2020-12-22 03:11:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2020-12-22 03:11:06,339 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2020-12-22 03:11:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:11:06,340 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2020-12-22 03:11:06,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 03:11:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2020-12-22 03:11:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2020-12-22 03:11:06,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:11:06,342 INFO L422 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:11:06,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-22 03:11:06,556 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:11:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:11:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2020-12-22 03:11:06,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:11:06,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344421869] [2020-12-22 03:11:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:11:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:11:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-22 03:11:07,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344421869] [2020-12-22 03:11:07,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572300242] [2020-12-22 03:11:07,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:11:07,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-12-22 03:11:07,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:11:07,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-22 03:11:07,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:11:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2020-12-22 03:11:07,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:11:07,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2020-12-22 03:11:07,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168448760] [2020-12-22 03:11:07,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 03:11:07,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:11:07,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 03:11:07,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2020-12-22 03:11:07,661 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand 19 states. [2020-12-22 03:11:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:11:08,734 INFO L93 Difference]: Finished difference Result 1316 states and 1835 transitions. [2020-12-22 03:11:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-22 03:11:08,736 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2020-12-22 03:11:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:11:08,740 INFO L225 Difference]: With dead ends: 1316 [2020-12-22 03:11:08,740 INFO L226 Difference]: Without dead ends: 684 [2020-12-22 03:11:08,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=514, Invalid=1208, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 03:11:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-12-22 03:11:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 659. [2020-12-22 03:11:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-12-22 03:11:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2020-12-22 03:11:08,769 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2020-12-22 03:11:08,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:11:08,770 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2020-12-22 03:11:08,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 03:11:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2020-12-22 03:11:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-12-22 03:11:08,774 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:11:08,774 INFO L422 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:11:08,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-22 03:11:08,988 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:11:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:11:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2020-12-22 03:11:08,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:11:08,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875645620] [2020-12-22 03:11:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:11:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:11:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-22 03:11:09,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875645620] [2020-12-22 03:11:09,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733573939] [2020-12-22 03:11:09,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:11:10,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-22 03:11:10,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 03:11:10,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-22 03:11:10,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:11:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-22 03:11:10,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:11:10,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2020-12-22 03:11:10,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194807711] [2020-12-22 03:11:10,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 03:11:10,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:11:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 03:11:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-12-22 03:11:10,682 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 19 states. [2020-12-22 03:11:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:11:10,970 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2020-12-22 03:11:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-22 03:11:10,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 349 [2020-12-22 03:11:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:11:10,976 INFO L225 Difference]: With dead ends: 865 [2020-12-22 03:11:10,976 INFO L226 Difference]: Without dead ends: 780 [2020-12-22 03:11:10,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-12-22 03:11:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-12-22 03:11:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2020-12-22 03:11:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2020-12-22 03:11:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2020-12-22 03:11:11,001 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2020-12-22 03:11:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:11:11,002 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2020-12-22 03:11:11,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 03:11:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2020-12-22 03:11:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2020-12-22 03:11:11,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:11:11,006 INFO L422 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:11:11,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:11:11,219 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:11:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:11:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2020-12-22 03:11:11,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:11:11,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827187800] [2020-12-22 03:11:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:11:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 03:11:12,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 03:11:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 03:11:14,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 03:11:14,612 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 03:11:14,613 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 03:11:14,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-22 03:11:14,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 03:11:14 BoogieIcfgContainer [2020-12-22 03:11:14,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 03:11:14,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 03:11:14,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 03:11:14,977 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 03:11:14,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:10:21" (3/4) ... [2020-12-22 03:11:14,980 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 03:11:15,277 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/psyco/psyco_abp_1-1.c-witness.graphml [2020-12-22 03:11:15,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 03:11:15,279 INFO L168 Benchmark]: Toolchain (without parser) took 55608.39 ms. Allocated memory was 152.0 MB in the beginning and 706.7 MB in the end (delta: 554.7 MB). Free memory was 126.9 MB in the beginning and 339.4 MB in the end (delta: -212.5 MB). Peak memory consumption was 342.8 MB. Max. memory is 8.0 GB. [2020-12-22 03:11:15,279 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 152.0 MB. Free memory was 124.6 MB in the beginning and 124.4 MB in the end (delta: 208.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 03:11:15,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.77 ms. Allocated memory is still 152.0 MB. Free memory was 126.7 MB in the beginning and 108.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2020-12-22 03:11:15,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.02 ms. Allocated memory is still 152.0 MB. Free memory was 108.5 MB in the beginning and 103.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-22 03:11:15,281 INFO L168 Benchmark]: Boogie Preprocessor took 118.72 ms. Allocated memory is still 152.0 MB. Free memory was 103.7 MB in the beginning and 100.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:11:15,281 INFO L168 Benchmark]: RCFGBuilder took 1353.76 ms. Allocated memory is still 152.0 MB. Free memory was 100.5 MB in the beginning and 84.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 8.0 GB. [2020-12-22 03:11:15,281 INFO L168 Benchmark]: TraceAbstraction took 53122.61 ms. Allocated memory was 152.0 MB in the beginning and 706.7 MB in the end (delta: 554.7 MB). Free memory was 83.8 MB in the beginning and 385.8 MB in the end (delta: -302.0 MB). Peak memory consumption was 252.7 MB. Max. memory is 8.0 GB. [2020-12-22 03:11:15,282 INFO L168 Benchmark]: Witness Printer took 301.40 ms. Allocated memory is still 706.7 MB. Free memory was 385.3 MB in the beginning and 339.4 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:11:15,284 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 152.0 MB. Free memory was 124.6 MB in the beginning and 124.4 MB in the end (delta: 208.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 610.77 ms. Allocated memory is still 152.0 MB. Free memory was 126.7 MB in the beginning and 108.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 92.02 ms. Allocated memory is still 152.0 MB. Free memory was 108.5 MB in the beginning and 103.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 118.72 ms. Allocated memory is still 152.0 MB. Free memory was 103.7 MB in the beginning and 100.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1353.76 ms. Allocated memory is still 152.0 MB. Free memory was 100.5 MB in the beginning and 84.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 53122.61 ms. Allocated memory was 152.0 MB in the beginning and 706.7 MB in the end (delta: 554.7 MB). Free memory was 83.8 MB in the beginning and 385.8 MB in the end (delta: -302.0 MB). Peak memory consumption was 252.7 MB. Max. memory is 8.0 GB. * Witness Printer took 301.40 ms. Allocated memory is still 706.7 MB. Free memory was 385.3 MB in the beginning and 339.4 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L571] reach_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 52.6s, OverallIterations: 40, TraceHistogramMax: 35, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8327 SDtfs, 14251 SDslu, 45750 SDs, 0 SdLazy, 7330 SolverSat, 787 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4486 GetRequests, 4046 SyntacticMatches, 24 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 389 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 8561 NumberOfCodeBlocks, 8239 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 6134186 SizeOfPredicates, 66 NumberOfNonLiveVariables, 22562 ConjunctsInSsa, 685 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 8881/31839 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...