/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:24:42,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:24:42,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:24:42,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:24:42,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:24:42,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:24:42,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:24:42,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:24:42,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:24:42,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:24:42,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:24:42,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:24:42,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:24:42,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:24:42,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:24:42,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:24:42,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:24:42,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:24:42,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:24:42,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:24:42,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:24:42,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:24:42,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:24:42,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:24:42,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:24:42,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:24:42,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:24:42,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:24:42,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:24:42,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:24:42,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:24:42,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:24:42,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:24:42,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:24:42,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:24:42,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:24:42,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:24:42,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:24:42,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:24:42,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:24:42,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:24:42,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:24:42,339 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:24:42,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:24:42,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:24:42,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:24:42,341 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:24:42,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:24:42,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:24:42,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:24:42,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:24:42,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:24:42,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:24:42,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:24:42,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:24:42,343 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:24:42,343 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:24:42,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:24:42,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:24:42,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:24:42,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:24:42,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:24:42,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:24:42,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:24:42,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:24:42,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:24:42,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:24:42,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:24:42,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:24:42,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:24:42,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:24:42,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:24:42,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:24:42,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:24:42,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:24:42,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:24:42,675 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:24:42,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-11-23 22:24:42,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cada231e7/ec2019500ee8475a82b949dacc746258/FLAG9a47fc999 [2019-11-23 22:24:43,277 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:24:43,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-11-23 22:24:43,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cada231e7/ec2019500ee8475a82b949dacc746258/FLAG9a47fc999 [2019-11-23 22:24:43,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cada231e7/ec2019500ee8475a82b949dacc746258 [2019-11-23 22:24:43,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:24:43,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:24:43,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:43,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:24:43,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:24:43,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:43" (1/1) ... [2019-11-23 22:24:43,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c1e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:43, skipping insertion in model container [2019-11-23 22:24:43,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:43" (1/1) ... [2019-11-23 22:24:43,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:24:43,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:24:44,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:44,019 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:24:44,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:44,240 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:24:44,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44 WrapperNode [2019-11-23 22:24:44,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:44,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:44,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:24:44,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:24:44,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:44,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:24:44,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:24:44,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:24:44,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:24:44,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:24:44,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:24:44,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:24:44,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:24:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:24:44,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:24:45,402 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:24:45,402 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-23 22:24:45,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:45 BoogieIcfgContainer [2019-11-23 22:24:45,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:24:45,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:24:45,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:24:45,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:24:45,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:24:43" (1/3) ... [2019-11-23 22:24:45,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c4d93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:45, skipping insertion in model container [2019-11-23 22:24:45,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (2/3) ... [2019-11-23 22:24:45,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c4d93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:45, skipping insertion in model container [2019-11-23 22:24:45,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:45" (3/3) ... [2019-11-23 22:24:45,412 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-11-23 22:24:45,421 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:24:45,428 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:24:45,436 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:24:45,463 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:24:45,463 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:24:45,463 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:24:45,463 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:24:45,464 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:24:45,464 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:24:45,464 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:24:45,464 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:24:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-23 22:24:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:24:45,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:45,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:45,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2019-11-23 22:24:45,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:45,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727952693] [2019-11-23 22:24:45,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:45,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727952693] [2019-11-23 22:24:45,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:45,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:24:45,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133364322] [2019-11-23 22:24:45,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:24:45,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:24:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:24:45,672 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-23 22:24:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:45,705 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2019-11-23 22:24:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:24:45,707 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-23 22:24:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:45,720 INFO L225 Difference]: With dead ends: 218 [2019-11-23 22:24:45,720 INFO L226 Difference]: Without dead ends: 106 [2019-11-23 22:24:45,723 INFO L630 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 [2019-11-23 22:24:45,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-23 22:24:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-23 22:24:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-23 22:24:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2019-11-23 22:24:45,769 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2019-11-23 22:24:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:45,769 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2019-11-23 22:24:45,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:24:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2019-11-23 22:24:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:24:45,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:45,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:45,771 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2019-11-23 22:24:45,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:45,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835928610] [2019-11-23 22:24:45,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:45,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835928610] [2019-11-23 22:24:45,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:45,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:45,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711197373] [2019-11-23 22:24:45,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:45,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:45,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:45,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:45,852 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2019-11-23 22:24:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:45,945 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2019-11-23 22:24:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:45,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:24:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:45,948 INFO L225 Difference]: With dead ends: 214 [2019-11-23 22:24:45,948 INFO L226 Difference]: Without dead ends: 110 [2019-11-23 22:24:45,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-23 22:24:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-23 22:24:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-23 22:24:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2019-11-23 22:24:45,968 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2019-11-23 22:24:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:45,968 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2019-11-23 22:24:45,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2019-11-23 22:24:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:24:45,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:45,973 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:45,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:45,974 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2019-11-23 22:24:45,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:45,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357204324] [2019-11-23 22:24:45,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:46,435 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2019-11-23 22:24:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:46,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357204324] [2019-11-23 22:24:46,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:46,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:24:46,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533232260] [2019-11-23 22:24:46,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:24:46,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:46,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:24:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:24:46,447 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 4 states. [2019-11-23 22:24:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:46,798 INFO L93 Difference]: Finished difference Result 326 states and 541 transitions. [2019-11-23 22:24:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:24:46,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 22:24:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:46,801 INFO L225 Difference]: With dead ends: 326 [2019-11-23 22:24:46,801 INFO L226 Difference]: Without dead ends: 197 [2019-11-23 22:24:46,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:24:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-23 22:24:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-11-23 22:24:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-23 22:24:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2019-11-23 22:24:46,835 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2019-11-23 22:24:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:46,835 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2019-11-23 22:24:46,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:24:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2019-11-23 22:24:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:24:46,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:46,838 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:46,838 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:46,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2019-11-23 22:24:46,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:46,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478225912] [2019-11-23 22:24:46,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:46,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478225912] [2019-11-23 22:24:46,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:46,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:46,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940205209] [2019-11-23 22:24:46,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:46,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:46,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:46,910 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2019-11-23 22:24:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:46,941 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2019-11-23 22:24:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:46,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:24:46,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:46,944 INFO L225 Difference]: With dead ends: 314 [2019-11-23 22:24:46,944 INFO L226 Difference]: Without dead ends: 133 [2019-11-23 22:24:46,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-23 22:24:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-11-23 22:24:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-23 22:24:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2019-11-23 22:24:46,955 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2019-11-23 22:24:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:46,955 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2019-11-23 22:24:46,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2019-11-23 22:24:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:24:46,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:46,957 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:46,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2019-11-23 22:24:46,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:46,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751004989] [2019-11-23 22:24:46,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:24:47,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751004989] [2019-11-23 22:24:47,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:47,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:47,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137911152] [2019-11-23 22:24:47,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:47,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:47,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:47,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:47,024 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2019-11-23 22:24:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:47,064 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2019-11-23 22:24:47,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:47,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:24:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:47,066 INFO L225 Difference]: With dead ends: 243 [2019-11-23 22:24:47,066 INFO L226 Difference]: Without dead ends: 115 [2019-11-23 22:24:47,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-23 22:24:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-11-23 22:24:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-23 22:24:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2019-11-23 22:24:47,089 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2019-11-23 22:24:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:47,089 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2019-11-23 22:24:47,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2019-11-23 22:24:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:24:47,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:47,091 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:47,092 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:47,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2019-11-23 22:24:47,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:47,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346141540] [2019-11-23 22:24:47,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:47,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346141540] [2019-11-23 22:24:47,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125533322] [2019-11-23 22:24:47,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:24:47,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:47,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:47,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 22:24:47,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362775378] [2019-11-23 22:24:47,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:24:47,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:47,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:24:47,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:24:47,352 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2019-11-23 22:24:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:47,552 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2019-11-23 22:24:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:24:47,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-23 22:24:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:47,554 INFO L225 Difference]: With dead ends: 204 [2019-11-23 22:24:47,555 INFO L226 Difference]: Without dead ends: 192 [2019-11-23 22:24:47,555 INFO L630 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 [2019-11-23 22:24:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-23 22:24:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2019-11-23 22:24:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-23 22:24:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2019-11-23 22:24:47,564 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2019-11-23 22:24:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:47,564 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2019-11-23 22:24:47,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:24:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2019-11-23 22:24:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:24:47,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:47,566 INFO L410 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] [2019-11-23 22:24:47,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:47,770 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2019-11-23 22:24:47,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:47,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737731696] [2019-11-23 22:24:47,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:47,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737731696] [2019-11-23 22:24:47,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261389558] [2019-11-23 22:24:47,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 22:24:47,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:48,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:48,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-23 22:24:48,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752915750] [2019-11-23 22:24:48,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:24:48,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:24:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:24:48,029 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 6 states. [2019-11-23 22:24:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,249 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2019-11-23 22:24:48,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:24:48,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-23 22:24:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,251 INFO L225 Difference]: With dead ends: 387 [2019-11-23 22:24:48,251 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:24:48,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:24:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:24:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-11-23 22:24:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-23 22:24:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2019-11-23 22:24:48,260 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2019-11-23 22:24:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,261 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2019-11-23 22:24:48,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:24:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2019-11-23 22:24:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:24:48,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,262 INFO L410 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] [2019-11-23 22:24:48,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:48,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2019-11-23 22:24:48,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828006746] [2019-11-23 22:24:48,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 22:24:48,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828006746] [2019-11-23 22:24:48,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136506426] [2019-11-23 22:24:48,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,520 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2019-11-23 22:24:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,557 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2019-11-23 22:24:48,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:24:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,561 INFO L225 Difference]: With dead ends: 409 [2019-11-23 22:24:48,561 INFO L226 Difference]: Without dead ends: 211 [2019-11-23 22:24:48,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-23 22:24:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-11-23 22:24:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-23 22:24:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2019-11-23 22:24:48,570 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2019-11-23 22:24:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,571 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2019-11-23 22:24:48,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2019-11-23 22:24:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:24:48,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,580 INFO L410 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] [2019-11-23 22:24:48,580 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2019-11-23 22:24:48,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076211276] [2019-11-23 22:24:48,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 22:24:48,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076211276] [2019-11-23 22:24:48,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:48,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:48,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653805884] [2019-11-23 22:24:48,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:48,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,651 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2019-11-23 22:24:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:48,681 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2019-11-23 22:24:48,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:48,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:24:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:48,684 INFO L225 Difference]: With dead ends: 375 [2019-11-23 22:24:48,685 INFO L226 Difference]: Without dead ends: 211 [2019-11-23 22:24:48,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-23 22:24:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-11-23 22:24:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-23 22:24:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2019-11-23 22:24:48,710 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2019-11-23 22:24:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:48,710 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2019-11-23 22:24:48,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2019-11-23 22:24:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:24:48,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:48,711 INFO L410 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] [2019-11-23 22:24:48,712 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2019-11-23 22:24:48,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:48,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505350030] [2019-11-23 22:24:48,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:24:48,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505350030] [2019-11-23 22:24:48,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380240503] [2019-11-23 22:24:48,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:48,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 22:24:48,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:24:48,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:48,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2019-11-23 22:24:48,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892599737] [2019-11-23 22:24:48,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:24:48,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:48,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:24:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:24:48,945 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 5 states. [2019-11-23 22:24:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,207 INFO L93 Difference]: Finished difference Result 485 states and 762 transitions. [2019-11-23 22:24:49,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:24:49,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-23 22:24:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,209 INFO L225 Difference]: With dead ends: 485 [2019-11-23 22:24:49,210 INFO L226 Difference]: Without dead ends: 270 [2019-11-23 22:24:49,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:24:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-23 22:24:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2019-11-23 22:24:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-23 22:24:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2019-11-23 22:24:49,219 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2019-11-23 22:24:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,219 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2019-11-23 22:24:49,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:24:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2019-11-23 22:24:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:24:49,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:49,221 INFO L410 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] [2019-11-23 22:24:49,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:49,425 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2019-11-23 22:24:49,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:49,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393193997] [2019-11-23 22:24:49,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:24:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393193997] [2019-11-23 22:24:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317076903] [2019-11-23 22:24:49,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:49,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 22:24:49,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:24:49,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:49,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:24:49,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517900478] [2019-11-23 22:24:49,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:24:49,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:24:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:24:49,599 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2019-11-23 22:24:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:49,731 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2019-11-23 22:24:49,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:24:49,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-23 22:24:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:49,734 INFO L225 Difference]: With dead ends: 274 [2019-11-23 22:24:49,735 INFO L226 Difference]: Without dead ends: 262 [2019-11-23 22:24:49,735 INFO L630 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 [2019-11-23 22:24:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-23 22:24:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-23 22:24:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-23 22:24:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-11-23 22:24:49,744 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2019-11-23 22:24:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:49,760 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-11-23 22:24:49,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:24:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-11-23 22:24:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:24:49,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:49,761 INFO L410 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] [2019-11-23 22:24:49,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:49,964 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2019-11-23 22:24:49,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:49,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45427709] [2019-11-23 22:24:49,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:50,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45427709] [2019-11-23 22:24:50,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451431642] [2019-11-23 22:24:50,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:50,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 22:24:50,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:50,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:50,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-23 22:24:50,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133920905] [2019-11-23 22:24:50,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:24:50,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:24:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:24:50,331 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 6 states. [2019-11-23 22:24:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:50,535 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2019-11-23 22:24:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:24:50,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-23 22:24:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:50,538 INFO L225 Difference]: With dead ends: 271 [2019-11-23 22:24:50,538 INFO L226 Difference]: Without dead ends: 269 [2019-11-23 22:24:50,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:24:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-23 22:24:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2019-11-23 22:24:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-23 22:24:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2019-11-23 22:24:50,561 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2019-11-23 22:24:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:50,563 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2019-11-23 22:24:50,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:24:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2019-11-23 22:24:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:24:50,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:50,565 INFO L410 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] [2019-11-23 22:24:50,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:50,771 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:50,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2019-11-23 22:24:50,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:50,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495030375] [2019-11-23 22:24:50,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 22:24:50,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495030375] [2019-11-23 22:24:50,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:50,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:50,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231295721] [2019-11-23 22:24:50,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:50,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:50,829 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2019-11-23 22:24:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:50,861 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2019-11-23 22:24:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:50,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-23 22:24:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:50,864 INFO L225 Difference]: With dead ends: 461 [2019-11-23 22:24:50,864 INFO L226 Difference]: Without dead ends: 245 [2019-11-23 22:24:50,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-23 22:24:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-11-23 22:24:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 22:24:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2019-11-23 22:24:50,873 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2019-11-23 22:24:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:50,873 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2019-11-23 22:24:50,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2019-11-23 22:24:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:24:50,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:50,874 INFO L410 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] [2019-11-23 22:24:50,875 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2019-11-23 22:24:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:50,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764473182] [2019-11-23 22:24:50,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 22:24:50,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764473182] [2019-11-23 22:24:50,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:50,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:50,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872209833] [2019-11-23 22:24:50,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:50,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:50,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:50,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:50,932 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2019-11-23 22:24:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:50,961 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2019-11-23 22:24:50,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:50,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-23 22:24:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:50,963 INFO L225 Difference]: With dead ends: 333 [2019-11-23 22:24:50,963 INFO L226 Difference]: Without dead ends: 155 [2019-11-23 22:24:50,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-23 22:24:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2019-11-23 22:24:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-23 22:24:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2019-11-23 22:24:50,969 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2019-11-23 22:24:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:50,970 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2019-11-23 22:24:50,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2019-11-23 22:24:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:24:50,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:50,971 INFO L410 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] [2019-11-23 22:24:50,971 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2019-11-23 22:24:50,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:50,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214666793] [2019-11-23 22:24:50,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:24:51,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214666793] [2019-11-23 22:24:51,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399212563] [2019-11-23 22:24:51,098 INFO L94 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 [2019-11-23 22:24:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:51,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 22:24:51,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:24:51,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:51,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-23 22:24:51,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745065879] [2019-11-23 22:24:51,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:24:51,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:24:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:24:51,263 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2019-11-23 22:24:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:51,395 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2019-11-23 22:24:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:24:51,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-23 22:24:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:51,397 INFO L225 Difference]: With dead ends: 286 [2019-11-23 22:24:51,398 INFO L226 Difference]: Without dead ends: 194 [2019-11-23 22:24:51,398 INFO L630 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 [2019-11-23 22:24:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-23 22:24:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-11-23 22:24:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-23 22:24:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2019-11-23 22:24:51,405 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2019-11-23 22:24:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:51,406 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2019-11-23 22:24:51,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:24:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2019-11-23 22:24:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:24:51,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:51,407 INFO L410 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] [2019-11-23 22:24:51,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:51,607 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2019-11-23 22:24:51,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:51,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009893001] [2019-11-23 22:24:51,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:51,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009893001] [2019-11-23 22:24:51,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442297268] [2019-11-23 22:24:51,800 INFO L94 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 [2019-11-23 22:24:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:51,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 22:24:51,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:51,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:51,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-23 22:24:51,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606404565] [2019-11-23 22:24:51,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:24:51,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:51,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:24:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:51,961 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 9 states. [2019-11-23 22:24:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:52,080 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2019-11-23 22:24:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:24:52,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-23 22:24:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:52,081 INFO L225 Difference]: With dead ends: 193 [2019-11-23 22:24:52,081 INFO L226 Difference]: Without dead ends: 191 [2019-11-23 22:24:52,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-23 22:24:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-11-23 22:24:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-23 22:24:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2019-11-23 22:24:52,089 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2019-11-23 22:24:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:52,089 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2019-11-23 22:24:52,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:24:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2019-11-23 22:24:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:24:52,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:52,090 INFO L410 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] [2019-11-23 22:24:52,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:52,295 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:52,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:52,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2019-11-23 22:24:52,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:52,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103799426] [2019-11-23 22:24:52,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:52,699 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 23 [2019-11-23 22:24:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:52,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103799426] [2019-11-23 22:24:52,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965443905] [2019-11-23 22:24:52,716 INFO L94 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 [2019-11-23 22:24:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:52,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 22:24:52,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:52,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:52,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-23 22:24:52,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061137259] [2019-11-23 22:24:52,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:24:52,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:24:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:52,881 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 9 states. [2019-11-23 22:24:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:53,220 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2019-11-23 22:24:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:24:53,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-11-23 22:24:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:53,222 INFO L225 Difference]: With dead ends: 194 [2019-11-23 22:24:53,222 INFO L226 Difference]: Without dead ends: 192 [2019-11-23 22:24:53,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-23 22:24:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-23 22:24:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-23 22:24:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2019-11-23 22:24:53,234 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2019-11-23 22:24:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:53,234 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2019-11-23 22:24:53,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:24:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2019-11-23 22:24:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:24:53,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:53,235 INFO L410 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] [2019-11-23 22:24:53,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:53,440 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2019-11-23 22:24:53,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:53,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447403716] [2019-11-23 22:24:53,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:53,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447403716] [2019-11-23 22:24:53,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215938273] [2019-11-23 22:24:53,713 INFO L94 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 [2019-11-23 22:24:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:53,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 22:24:53,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:53,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:53,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-23 22:24:53,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107630664] [2019-11-23 22:24:53,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 22:24:53,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:53,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 22:24:53,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:24:53,981 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 14 states. [2019-11-23 22:24:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:54,234 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2019-11-23 22:24:54,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:24:54,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-11-23 22:24:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:54,237 INFO L225 Difference]: With dead ends: 301 [2019-11-23 22:24:54,237 INFO L226 Difference]: Without dead ends: 211 [2019-11-23 22:24:54,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:24:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-23 22:24:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-23 22:24:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-23 22:24:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2019-11-23 22:24:54,246 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2019-11-23 22:24:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:54,246 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2019-11-23 22:24:54,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 22:24:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2019-11-23 22:24:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:24:54,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:54,248 INFO L410 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] [2019-11-23 22:24:54,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:54,461 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2019-11-23 22:24:54,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:54,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133873586] [2019-11-23 22:24:54,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:24:54,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133873586] [2019-11-23 22:24:54,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711046199] [2019-11-23 22:24:54,596 INFO L94 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 [2019-11-23 22:24:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:54,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 22:24:54,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:24:54,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:54,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2019-11-23 22:24:54,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719776804] [2019-11-23 22:24:54,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:24:54,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:54,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:24:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:24:54,823 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 7 states. [2019-11-23 22:24:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:54,977 INFO L93 Difference]: Finished difference Result 324 states and 466 transitions. [2019-11-23 22:24:54,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:24:54,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-11-23 22:24:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:54,979 INFO L225 Difference]: With dead ends: 324 [2019-11-23 22:24:54,979 INFO L226 Difference]: Without dead ends: 234 [2019-11-23 22:24:54,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:24:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-23 22:24:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-11-23 22:24:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-23 22:24:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2019-11-23 22:24:54,988 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2019-11-23 22:24:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:54,989 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2019-11-23 22:24:54,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:24:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2019-11-23 22:24:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 22:24:54,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:54,990 INFO L410 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] [2019-11-23 22:24:55,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:55,202 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2019-11-23 22:24:55,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:55,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997727264] [2019-11-23 22:24:55,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:55,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997727264] [2019-11-23 22:24:55,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933864195] [2019-11-23 22:24:55,515 INFO L94 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 [2019-11-23 22:24:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:55,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 22:24:55,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:55,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:55,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-23 22:24:55,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993071111] [2019-11-23 22:24:55,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:24:55,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:24:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:55,748 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 9 states. [2019-11-23 22:24:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:55,932 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2019-11-23 22:24:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:24:55,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-11-23 22:24:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:55,934 INFO L225 Difference]: With dead ends: 233 [2019-11-23 22:24:55,934 INFO L226 Difference]: Without dead ends: 231 [2019-11-23 22:24:55,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-23 22:24:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-23 22:24:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-23 22:24:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-11-23 22:24:55,941 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2019-11-23 22:24:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:55,942 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-11-23 22:24:55,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:24:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-11-23 22:24:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:24:55,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:55,943 INFO L410 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] [2019-11-23 22:24:56,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:56,147 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:56,148 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2019-11-23 22:24:56,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:56,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997284660] [2019-11-23 22:24:56,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:24:56,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997284660] [2019-11-23 22:24:56,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739913227] [2019-11-23 22:24:56,302 INFO L94 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 [2019-11-23 22:24:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:56,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 22:24:56,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 22:24:56,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:56,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-23 22:24:56,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286319473] [2019-11-23 22:24:56,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:24:56,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:24:56,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:24:56,516 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2019-11-23 22:24:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:56,654 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2019-11-23 22:24:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:24:56,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-11-23 22:24:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:56,657 INFO L225 Difference]: With dead ends: 364 [2019-11-23 22:24:56,657 INFO L226 Difference]: Without dead ends: 272 [2019-11-23 22:24:56,657 INFO L630 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 [2019-11-23 22:24:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-23 22:24:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2019-11-23 22:24:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-23 22:24:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2019-11-23 22:24:56,666 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2019-11-23 22:24:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:56,666 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2019-11-23 22:24:56,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:24:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2019-11-23 22:24:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:24:56,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:56,668 INFO L410 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] [2019-11-23 22:24:56,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:56,872 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2019-11-23 22:24:56,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:56,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930633817] [2019-11-23 22:24:56,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:57,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930633817] [2019-11-23 22:24:57,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314493875] [2019-11-23 22:24:57,078 INFO L94 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 [2019-11-23 22:24:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:57,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 22:24:57,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:57,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:57,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-23 22:24:57,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506574147] [2019-11-23 22:24:57,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 22:24:57,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 22:24:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:24:57,381 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 17 states. [2019-11-23 22:24:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:57,651 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2019-11-23 22:24:57,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:24:57,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-11-23 22:24:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:57,653 INFO L225 Difference]: With dead ends: 271 [2019-11-23 22:24:57,653 INFO L226 Difference]: Without dead ends: 269 [2019-11-23 22:24:57,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:24:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-23 22:24:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-11-23 22:24:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-23 22:24:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2019-11-23 22:24:57,666 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2019-11-23 22:24:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:57,667 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2019-11-23 22:24:57,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 22:24:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2019-11-23 22:24:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 22:24:57,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:57,691 INFO L410 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] [2019-11-23 22:24:57,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:57,898 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:57,898 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2019-11-23 22:24:57,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:57,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226291583] [2019-11-23 22:24:57,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:58,507 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2019-11-23 22:24:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:58,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226291583] [2019-11-23 22:24:58,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799845811] [2019-11-23 22:24:58,551 INFO L92 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 [2019-11-23 22:24:58,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:24:58,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:24:58,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 22:24:58,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:58,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:58,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-23 22:24:58,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367441001] [2019-11-23 22:24:58,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:24:58,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:24:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:24:58,794 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 13 states. [2019-11-23 22:24:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:59,250 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2019-11-23 22:24:59,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:24:59,250 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2019-11-23 22:24:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:59,254 INFO L225 Difference]: With dead ends: 272 [2019-11-23 22:24:59,254 INFO L226 Difference]: Without dead ends: 270 [2019-11-23 22:24:59,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:24:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-23 22:24:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-11-23 22:24:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-23 22:24:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2019-11-23 22:24:59,264 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2019-11-23 22:24:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:59,264 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2019-11-23 22:24:59,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:24:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2019-11-23 22:24:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 22:24:59,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:59,266 INFO L410 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] [2019-11-23 22:24:59,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:59,471 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2019-11-23 22:24:59,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:59,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397930794] [2019-11-23 22:24:59,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:59,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397930794] [2019-11-23 22:24:59,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454512013] [2019-11-23 22:24:59,810 INFO L92 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 [2019-11-23 22:24:59,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:24:59,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:24:59,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 22:24:59,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:00,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:00,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-23 22:25:00,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053144979] [2019-11-23 22:25:00,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 22:25:00,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 22:25:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:25:00,169 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 22 states. [2019-11-23 22:25:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:00,590 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2019-11-23 22:25:00,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:25:00,591 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 119 [2019-11-23 22:25:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:00,595 INFO L225 Difference]: With dead ends: 379 [2019-11-23 22:25:00,595 INFO L226 Difference]: Without dead ends: 289 [2019-11-23 22:25:00,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:25:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-23 22:25:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-23 22:25:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 22:25:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2019-11-23 22:25:00,604 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2019-11-23 22:25:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:00,604 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2019-11-23 22:25:00,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 22:25:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2019-11-23 22:25:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-23 22:25:00,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:00,606 INFO L410 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] [2019-11-23 22:25:00,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:00,810 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2019-11-23 22:25:00,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:00,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114632989] [2019-11-23 22:25:00,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:25:01,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114632989] [2019-11-23 22:25:01,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905643394] [2019-11-23 22:25:01,072 INFO L92 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 [2019-11-23 22:25:01,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:25:01,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:01,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 22:25:01,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:25:01,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:01,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2019-11-23 22:25:01,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249423826] [2019-11-23 22:25:01,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:25:01,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:25:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:25:01,355 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 9 states. [2019-11-23 22:25:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:01,692 INFO L93 Difference]: Finished difference Result 402 states and 573 transitions. [2019-11-23 22:25:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:25:01,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-11-23 22:25:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:01,695 INFO L225 Difference]: With dead ends: 402 [2019-11-23 22:25:01,695 INFO L226 Difference]: Without dead ends: 312 [2019-11-23 22:25:01,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:25:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-23 22:25:01,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2019-11-23 22:25:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-23 22:25:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2019-11-23 22:25:01,705 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2019-11-23 22:25:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:01,706 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2019-11-23 22:25:01,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:25:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2019-11-23 22:25:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 22:25:01,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:01,707 INFO L410 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] [2019-11-23 22:25:01,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:01,912 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2019-11-23 22:25:01,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:01,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199515506] [2019-11-23 22:25:01,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:02,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199515506] [2019-11-23 22:25:02,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802158246] [2019-11-23 22:25:02,448 INFO L92 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 [2019-11-23 22:25:02,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:25:02,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:02,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-23 22:25:02,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:02,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:02,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-11-23 22:25:02,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347541734] [2019-11-23 22:25:02,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:25:02,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:02,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:25:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:25:02,759 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 13 states. [2019-11-23 22:25:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:03,114 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2019-11-23 22:25:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:25:03,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-11-23 22:25:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:03,117 INFO L225 Difference]: With dead ends: 311 [2019-11-23 22:25:03,118 INFO L226 Difference]: Without dead ends: 309 [2019-11-23 22:25:03,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:25:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-23 22:25:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-11-23 22:25:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-23 22:25:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2019-11-23 22:25:03,131 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2019-11-23 22:25:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:03,132 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2019-11-23 22:25:03,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:25:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2019-11-23 22:25:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 22:25:03,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:03,135 INFO L410 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] [2019-11-23 22:25:03,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:03,341 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2019-11-23 22:25:03,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:03,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203219327] [2019-11-23 22:25:03,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:25:03,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203219327] [2019-11-23 22:25:03,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804189096] [2019-11-23 22:25:03,554 INFO L92 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 [2019-11-23 22:25:03,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:25:03,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:03,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 22:25:03,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:25:03,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:03,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-23 22:25:03,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149433002] [2019-11-23 22:25:03,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:25:03,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:03,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:25:03,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:25:03,794 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2019-11-23 22:25:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:04,007 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2019-11-23 22:25:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:25:04,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-11-23 22:25:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:04,010 INFO L225 Difference]: With dead ends: 442 [2019-11-23 22:25:04,010 INFO L226 Difference]: Without dead ends: 350 [2019-11-23 22:25:04,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:25:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-23 22:25:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-11-23 22:25:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-23 22:25:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2019-11-23 22:25:04,019 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2019-11-23 22:25:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:04,019 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2019-11-23 22:25:04,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:25:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2019-11-23 22:25:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:25:04,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:04,021 INFO L410 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] [2019-11-23 22:25:04,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:04,228 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2019-11-23 22:25:04,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:04,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803897330] [2019-11-23 22:25:04,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:04,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803897330] [2019-11-23 22:25:04,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454563838] [2019-11-23 22:25:04,712 INFO L92 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 [2019-11-23 22:25:04,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:25:04,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:04,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-23 22:25:04,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:05,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:05,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-11-23 22:25:05,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628744339] [2019-11-23 22:25:05,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 22:25:05,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:05,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 22:25:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:25:05,258 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 25 states. [2019-11-23 22:25:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:05,837 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2019-11-23 22:25:05,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:25:05,837 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2019-11-23 22:25:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:05,840 INFO L225 Difference]: With dead ends: 349 [2019-11-23 22:25:05,840 INFO L226 Difference]: Without dead ends: 347 [2019-11-23 22:25:05,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:25:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-23 22:25:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-11-23 22:25:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-23 22:25:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2019-11-23 22:25:05,850 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2019-11-23 22:25:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:05,850 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2019-11-23 22:25:05,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 22:25:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2019-11-23 22:25:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:25:05,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:05,852 INFO L410 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] [2019-11-23 22:25:06,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:06,057 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:06,057 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2019-11-23 22:25:06,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:06,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848270602] [2019-11-23 22:25:06,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:06,614 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 24 [2019-11-23 22:25:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:06,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848270602] [2019-11-23 22:25:06,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260418866] [2019-11-23 22:25:06,667 INFO L92 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 [2019-11-23 22:25:06,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-23 22:25:06,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:06,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 22:25:06,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:25:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:06,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:06,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-23 22:25:07,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:07,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2019-11-23 22:25:07,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093114260] [2019-11-23 22:25:07,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 22:25:07,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 22:25:07,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:25:07,144 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 22 states. [2019-11-23 22:25:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:08,398 INFO L93 Difference]: Finished difference Result 545 states and 767 transitions. [2019-11-23 22:25:08,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-23 22:25:08,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 155 [2019-11-23 22:25:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:08,402 INFO L225 Difference]: With dead ends: 545 [2019-11-23 22:25:08,402 INFO L226 Difference]: Without dead ends: 449 [2019-11-23 22:25:08,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 22:25:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-23 22:25:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2019-11-23 22:25:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-23 22:25:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2019-11-23 22:25:08,416 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2019-11-23 22:25:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:08,417 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2019-11-23 22:25:08,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 22:25:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2019-11-23 22:25:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 22:25:08,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:08,419 INFO L410 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] [2019-11-23 22:25:08,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:08,623 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:08,624 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2019-11-23 22:25:08,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:08,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277882283] [2019-11-23 22:25:08,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:25:08,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277882283] [2019-11-23 22:25:08,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801911027] [2019-11-23 22:25:08,905 INFO L94 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 [2019-11-23 22:25:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:09,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 22:25:09,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:25:09,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:09,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-23 22:25:09,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122491789] [2019-11-23 22:25:09,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:25:09,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:25:09,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:25:09,104 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 10 states. [2019-11-23 22:25:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:09,249 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2019-11-23 22:25:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:25:09,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2019-11-23 22:25:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:09,254 INFO L225 Difference]: With dead ends: 927 [2019-11-23 22:25:09,255 INFO L226 Difference]: Without dead ends: 760 [2019-11-23 22:25:09,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:25:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-23 22:25:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2019-11-23 22:25:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-23 22:25:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2019-11-23 22:25:09,273 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2019-11-23 22:25:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:09,273 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2019-11-23 22:25:09,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:25:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2019-11-23 22:25:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 22:25:09,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:09,276 INFO L410 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] [2019-11-23 22:25:09,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:09,480 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:09,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2019-11-23 22:25:09,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:09,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249107259] [2019-11-23 22:25:09,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:25:09,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249107259] [2019-11-23 22:25:09,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:25:09,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:25:09,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362230986] [2019-11-23 22:25:09,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:25:09,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:25:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:25:09,676 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 10 states. [2019-11-23 22:25:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:09,781 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2019-11-23 22:25:09,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:25:09,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2019-11-23 22:25:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:09,785 INFO L225 Difference]: With dead ends: 860 [2019-11-23 22:25:09,786 INFO L226 Difference]: Without dead ends: 856 [2019-11-23 22:25:09,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:25:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-11-23 22:25:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2019-11-23 22:25:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-11-23 22:25:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2019-11-23 22:25:09,807 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2019-11-23 22:25:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:09,807 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2019-11-23 22:25:09,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:25:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2019-11-23 22:25:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-23 22:25:09,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:09,809 INFO L410 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] [2019-11-23 22:25:09,810 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:09,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:09,810 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2019-11-23 22:25:09,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:09,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229028215] [2019-11-23 22:25:09,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229028215] [2019-11-23 22:25:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673384] [2019-11-23 22:25:10,499 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-23 22:25:10,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-11-23 22:25:10,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:10,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 22:25:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:10,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:25:10,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:10,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:10,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:10,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:25:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:10,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:25:11,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:11,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2019-11-23 22:25:11,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736089717] [2019-11-23 22:25:11,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 22:25:11,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:11,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 22:25:11,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:25:11,131 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 27 states. [2019-11-23 22:25:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:11,932 INFO L93 Difference]: Finished difference Result 863 states and 1209 transitions. [2019-11-23 22:25:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 22:25:11,933 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 178 [2019-11-23 22:25:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:11,938 INFO L225 Difference]: With dead ends: 863 [2019-11-23 22:25:11,938 INFO L226 Difference]: Without dead ends: 861 [2019-11-23 22:25:11,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2019-11-23 22:25:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-23 22:25:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2019-11-23 22:25:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-11-23 22:25:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2019-11-23 22:25:11,966 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2019-11-23 22:25:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:11,967 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2019-11-23 22:25:11,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 22:25:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2019-11-23 22:25:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-23 22:25:11,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:11,969 INFO L410 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] [2019-11-23 22:25:12,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:12,175 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:12,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2019-11-23 22:25:12,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:12,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355914820] [2019-11-23 22:25:12,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:25:12,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355914820] [2019-11-23 22:25:12,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463781599] [2019-11-23 22:25:12,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-23 22:25:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:12,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 22:25:12,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:25:12,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:12,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-23 22:25:12,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817693356] [2019-11-23 22:25:12,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:25:12,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:12,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:25:12,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:25:12,668 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand 11 states. [2019-11-23 22:25:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:12,867 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2019-11-23 22:25:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:25:12,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-11-23 22:25:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:12,872 INFO L225 Difference]: With dead ends: 1435 [2019-11-23 22:25:12,872 INFO L226 Difference]: Without dead ends: 959 [2019-11-23 22:25:12,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:25:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-11-23 22:25:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2019-11-23 22:25:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-11-23 22:25:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2019-11-23 22:25:12,898 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2019-11-23 22:25:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:12,898 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2019-11-23 22:25:12,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:25:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2019-11-23 22:25:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 22:25:12,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:12,900 INFO L410 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] [2019-11-23 22:25:13,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:13,104 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2019-11-23 22:25:13,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:13,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003758608] [2019-11-23 22:25:13,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:13,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003758608] [2019-11-23 22:25:13,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203889087] [2019-11-23 22:25:13,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-23 22:25:14,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-11-23 22:25:14,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:14,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-23 22:25:14,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:14,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 742 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 22:25:14,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:14,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2019-11-23 22:25:14,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113108502] [2019-11-23 22:25:14,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 22:25:14,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:14,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 22:25:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:25:14,353 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand 29 states. [2019-11-23 22:25:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:15,226 INFO L93 Difference]: Finished difference Result 932 states and 1312 transitions. [2019-11-23 22:25:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 22:25:15,227 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 194 [2019-11-23 22:25:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:15,232 INFO L225 Difference]: With dead ends: 932 [2019-11-23 22:25:15,232 INFO L226 Difference]: Without dead ends: 930 [2019-11-23 22:25:15,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:25:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-11-23 22:25:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2019-11-23 22:25:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-11-23 22:25:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1310 transitions. [2019-11-23 22:25:15,252 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1310 transitions. Word has length 194 [2019-11-23 22:25:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:15,252 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1310 transitions. [2019-11-23 22:25:15,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 22:25:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1310 transitions. [2019-11-23 22:25:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-23 22:25:15,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:15,254 INFO L410 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] [2019-11-23 22:25:15,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:15,459 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2019-11-23 22:25:15,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:15,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994320565] [2019-11-23 22:25:15,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 22:25:15,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994320565] [2019-11-23 22:25:15,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11793770] [2019-11-23 22:25:15,691 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-23 22:25:15,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:25:15,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:15,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 22:25:15,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 22:25:15,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:15,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-11-23 22:25:15,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337854734] [2019-11-23 22:25:15,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:25:15,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:25:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:25:15,936 INFO L87 Difference]: Start difference. First operand 930 states and 1310 transitions. Second operand 12 states. [2019-11-23 22:25:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:16,117 INFO L93 Difference]: Finished difference Result 1125 states and 1565 transitions. [2019-11-23 22:25:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:25:16,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2019-11-23 22:25:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:16,122 INFO L225 Difference]: With dead ends: 1125 [2019-11-23 22:25:16,123 INFO L226 Difference]: Without dead ends: 1040 [2019-11-23 22:25:16,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:25:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-23 22:25:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2019-11-23 22:25:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2019-11-23 22:25:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1417 transitions. [2019-11-23 22:25:16,149 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1417 transitions. Word has length 211 [2019-11-23 22:25:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:16,150 INFO L462 AbstractCegarLoop]: Abstraction has 1008 states and 1417 transitions. [2019-11-23 22:25:16,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:25:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1417 transitions. [2019-11-23 22:25:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 22:25:16,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:16,153 INFO L410 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] [2019-11-23 22:25:16,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:16,358 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2019-11-23 22:25:16,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:16,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233838905] [2019-11-23 22:25:16,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 22:25:16,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233838905] [2019-11-23 22:25:16,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637719670] [2019-11-23 22:25:16,618 INFO L92 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 [2019-11-23 22:25:16,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:25:16,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:16,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 22:25:16,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 22:25:16,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:16,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-11-23 22:25:16,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175411748] [2019-11-23 22:25:16,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:25:16,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:25:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:25:16,925 INFO L87 Difference]: Start difference. First operand 1008 states and 1417 transitions. Second operand 13 states. [2019-11-23 22:25:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:17,118 INFO L93 Difference]: Finished difference Result 1675 states and 2348 transitions. [2019-11-23 22:25:17,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:25:17,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2019-11-23 22:25:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:17,123 INFO L225 Difference]: With dead ends: 1675 [2019-11-23 22:25:17,123 INFO L226 Difference]: Without dead ends: 1121 [2019-11-23 22:25:17,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:25:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-11-23 22:25:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2019-11-23 22:25:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-11-23 22:25:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1529 transitions. [2019-11-23 22:25:17,148 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1529 transitions. Word has length 239 [2019-11-23 22:25:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:17,149 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1529 transitions. [2019-11-23 22:25:17,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:25:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1529 transitions. [2019-11-23 22:25:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-23 22:25:17,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:17,151 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 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, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:25:17,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:17,355 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash -453919502, now seen corresponding path program 4 times [2019-11-23 22:25:17,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:17,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536221628] [2019-11-23 22:25:17,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 60 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:18,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536221628] [2019-11-23 22:25:18,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093481137] [2019-11-23 22:25:18,009 INFO L92 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 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 [2019-11-23 22:25:18,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:25:18,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:18,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-23 22:25:18,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 60 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:18,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:18,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2019-11-23 22:25:18,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833856357] [2019-11-23 22:25:18,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-23 22:25:18,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-23 22:25:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 22:25:18,943 INFO L87 Difference]: Start difference. First operand 1086 states and 1529 transitions. Second operand 41 states. [2019-11-23 22:25:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:20,208 INFO L93 Difference]: Finished difference Result 1088 states and 1530 transitions. [2019-11-23 22:25:20,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:25:20,209 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 240 [2019-11-23 22:25:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:20,214 INFO L225 Difference]: With dead ends: 1088 [2019-11-23 22:25:20,214 INFO L226 Difference]: Without dead ends: 1086 [2019-11-23 22:25:20,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 22:25:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-11-23 22:25:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2019-11-23 22:25:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-11-23 22:25:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1528 transitions. [2019-11-23 22:25:20,235 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1528 transitions. Word has length 240 [2019-11-23 22:25:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:20,235 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1528 transitions. [2019-11-23 22:25:20,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-23 22:25:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1528 transitions. [2019-11-23 22:25:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-23 22:25:20,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:20,237 INFO L410 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] [2019-11-23 22:25:20,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:20,441 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:20,442 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2019-11-23 22:25:20,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:20,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235517711] [2019-11-23 22:25:20,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-23 22:25:20,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235517711] [2019-11-23 22:25:20,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276942878] [2019-11-23 22:25:20,692 INFO L92 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 [2019-11-23 22:25:20,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-11-23 22:25:20,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:20,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 22:25:20,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-23 22:25:21,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:21,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-11-23 22:25:21,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651243990] [2019-11-23 22:25:21,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 22:25:21,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:21,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 22:25:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:25:21,051 INFO L87 Difference]: Start difference. First operand 1086 states and 1528 transitions. Second operand 14 states. [2019-11-23 22:25:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:21,234 INFO L93 Difference]: Finished difference Result 1287 states and 1787 transitions. [2019-11-23 22:25:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:25:21,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 257 [2019-11-23 22:25:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:21,241 INFO L225 Difference]: With dead ends: 1287 [2019-11-23 22:25:21,241 INFO L226 Difference]: Without dead ends: 1202 [2019-11-23 22:25:21,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:25:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-11-23 22:25:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2019-11-23 22:25:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2019-11-23 22:25:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1635 transitions. [2019-11-23 22:25:21,268 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1635 transitions. Word has length 257 [2019-11-23 22:25:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:21,268 INFO L462 AbstractCegarLoop]: Abstraction has 1164 states and 1635 transitions. [2019-11-23 22:25:21,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 22:25:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1635 transitions. [2019-11-23 22:25:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-11-23 22:25:21,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:21,270 INFO L410 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] [2019-11-23 22:25:21,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:21,476 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2019-11-23 22:25:21,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:21,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745626211] [2019-11-23 22:25:21,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 22:25:21,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745626211] [2019-11-23 22:25:21,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675128475] [2019-11-23 22:25:21,854 INFO L92 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 [2019-11-23 22:25:21,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 22:25:21,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:21,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 22:25:21,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:22,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2019-11-23 22:25:22,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:22,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-11-23 22:25:22,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271214834] [2019-11-23 22:25:22,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:25:22,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:25:22,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:25:22,172 INFO L87 Difference]: Start difference. First operand 1164 states and 1635 transitions. Second operand 19 states. [2019-11-23 22:25:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:23,097 INFO L93 Difference]: Finished difference Result 1318 states and 1838 transitions. [2019-11-23 22:25:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-23 22:25:23,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2019-11-23 22:25:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:23,101 INFO L225 Difference]: With dead ends: 1318 [2019-11-23 22:25:23,101 INFO L226 Difference]: Without dead ends: 686 [2019-11-23 22:25:23,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2019-11-23 22:25:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-23 22:25:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 659. [2019-11-23 22:25:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-23 22:25:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 909 transitions. [2019-11-23 22:25:23,117 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 909 transitions. Word has length 285 [2019-11-23 22:25:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:23,117 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 909 transitions. [2019-11-23 22:25:23,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:25:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 909 transitions. [2019-11-23 22:25:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-23 22:25:23,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:23,120 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 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, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:25:23,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:23,324 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1733592989, now seen corresponding path program 5 times [2019-11-23 22:25:23,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:23,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365643002] [2019-11-23 22:25:23,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1878 backedges. 72 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:24,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365643002] [2019-11-23 22:25:24,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614626893] [2019-11-23 22:25:24,282 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-11-23 22:25:24,657 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-11-23 22:25:24,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:24,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-23 22:25:24,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:24,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1878 backedges. 72 proven. 1796 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 22:25:24,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:24,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 30 [2019-11-23 22:25:24,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315389133] [2019-11-23 22:25:24,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 22:25:24,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:24,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 22:25:24,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:25:24,977 INFO L87 Difference]: Start difference. First operand 659 states and 909 transitions. Second operand 30 states. [2019-11-23 22:25:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:26,273 INFO L93 Difference]: Finished difference Result 661 states and 910 transitions. [2019-11-23 22:25:26,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 22:25:26,274 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 286 [2019-11-23 22:25:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:26,278 INFO L225 Difference]: With dead ends: 661 [2019-11-23 22:25:26,278 INFO L226 Difference]: Without dead ends: 659 [2019-11-23 22:25:26,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=862, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:25:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-23 22:25:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-23 22:25:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-23 22:25:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 908 transitions. [2019-11-23 22:25:26,288 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 908 transitions. Word has length 286 [2019-11-23 22:25:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:26,288 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 908 transitions. [2019-11-23 22:25:26,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 22:25:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 908 transitions. [2019-11-23 22:25:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-23 22:25:26,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:26,291 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:25:26,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:26,497 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash -981412332, now seen corresponding path program 6 times [2019-11-23 22:25:26,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:26,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281450096] [2019-11-23 22:25:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 84 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:27,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281450096] [2019-11-23 22:25:27,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913510157] [2019-11-23 22:25:27,727 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:28,142 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-11-23 22:25:28,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:28,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-23 22:25:28,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:28,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 84 proven. 2425 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-23 22:25:28,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:28,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19] total 47 [2019-11-23 22:25:28,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729896071] [2019-11-23 22:25:28,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-23 22:25:28,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:28,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-23 22:25:28,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2042, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 22:25:28,833 INFO L87 Difference]: Start difference. First operand 659 states and 908 transitions. Second operand 47 states. [2019-11-23 22:25:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:30,509 INFO L93 Difference]: Finished difference Result 722 states and 993 transitions. [2019-11-23 22:25:30,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 22:25:30,510 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 332 [2019-11-23 22:25:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:30,514 INFO L225 Difference]: With dead ends: 722 [2019-11-23 22:25:30,515 INFO L226 Difference]: Without dead ends: 720 [2019-11-23 22:25:30,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=2131, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 22:25:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-23 22:25:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2019-11-23 22:25:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-23 22:25:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 991 transitions. [2019-11-23 22:25:30,528 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 991 transitions. Word has length 332 [2019-11-23 22:25:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:30,528 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 991 transitions. [2019-11-23 22:25:30,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-23 22:25:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 991 transitions. [2019-11-23 22:25:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-11-23 22:25:30,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:30,531 INFO L410 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] [2019-11-23 22:25:30,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:30,738 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2019-11-23 22:25:30,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:30,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569362093] [2019-11-23 22:25:30,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 22:25:31,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569362093] [2019-11-23 22:25:31,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813040831] [2019-11-23 22:25:31,193 INFO L92 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:31,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:25:31,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:25:31,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 2040 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 22:25:31,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 22:25:31,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:31,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-11-23 22:25:31,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473015740] [2019-11-23 22:25:31,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 22:25:31,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:31,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 22:25:31,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:25:31,645 INFO L87 Difference]: Start difference. First operand 720 states and 991 transitions. Second operand 18 states. [2019-11-23 22:25:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:31,823 INFO L93 Difference]: Finished difference Result 867 states and 1194 transitions. [2019-11-23 22:25:31,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:25:31,823 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 349 [2019-11-23 22:25:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:31,826 INFO L225 Difference]: With dead ends: 867 [2019-11-23 22:25:31,826 INFO L226 Difference]: Without dead ends: 782 [2019-11-23 22:25:31,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:25:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-23 22:25:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 737. [2019-11-23 22:25:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-23 22:25:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1015 transitions. [2019-11-23 22:25:31,839 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1015 transitions. Word has length 349 [2019-11-23 22:25:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:31,839 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1015 transitions. [2019-11-23 22:25:31,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 22:25:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1015 transitions. [2019-11-23 22:25:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-11-23 22:25:31,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:31,841 INFO L410 BasicCegarLoop]: trace histogram [33, 33, 32, 24, 24, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:25:32,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:32,047 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1592780293, now seen corresponding path program 7 times [2019-11-23 22:25:32,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:32,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009580316] [2019-11-23 22:25:32,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3368 backedges. 96 proven. 3272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:33,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009580316] [2019-11-23 22:25:33,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993009875] [2019-11-23 22:25:33,532 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:33,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 2187 conjuncts, 131 conjunts are in the unsatisfiable core [2019-11-23 22:25:33,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3368 backedges. 96 proven. 3272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:35,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:35,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 65 [2019-11-23 22:25:35,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452152448] [2019-11-23 22:25:35,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-23 22:25:35,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-23 22:25:35,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=4002, Unknown=0, NotChecked=0, Total=4160 [2019-11-23 22:25:35,985 INFO L87 Difference]: Start difference. First operand 737 states and 1015 transitions. Second operand 65 states. [2019-11-23 22:25:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:38,486 INFO L93 Difference]: Finished difference Result 800 states and 1100 transitions. [2019-11-23 22:25:38,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 22:25:38,487 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 378 [2019-11-23 22:25:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:38,492 INFO L225 Difference]: With dead ends: 800 [2019-11-23 22:25:38,492 INFO L226 Difference]: Without dead ends: 798 [2019-11-23 22:25:38,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=158, Invalid=4002, Unknown=0, NotChecked=0, Total=4160 [2019-11-23 22:25:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-11-23 22:25:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2019-11-23 22:25:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-11-23 22:25:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1098 transitions. [2019-11-23 22:25:38,509 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1098 transitions. Word has length 378 [2019-11-23 22:25:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:38,509 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 1098 transitions. [2019-11-23 22:25:38,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-23 22:25:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1098 transitions. [2019-11-23 22:25:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-11-23 22:25:38,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:25:38,513 INFO L410 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] [2019-11-23 22:25:38,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:38,718 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:25:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:25:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2019-11-23 22:25:38,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:25:38,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931964542] [2019-11-23 22:25:38,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:25:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:25:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:25:40,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:25:40,213 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:25:40,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:25:40 BoogieIcfgContainer [2019-11-23 22:25:40,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:25:40,422 INFO L168 Benchmark]: Toolchain (without parser) took 56863.19 ms. Allocated memory was 140.0 MB in the beginning and 788.5 MB in the end (delta: 648.5 MB). Free memory was 103.3 MB in the beginning and 360.5 MB in the end (delta: -257.3 MB). Peak memory consumption was 391.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:40,425 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 22:25:40,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.27 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 103.1 MB in the beginning and 176.8 MB in the end (delta: -73.8 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:40,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.18 ms. Allocated memory is still 203.9 MB. Free memory was 176.8 MB in the beginning and 172.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:40,426 INFO L168 Benchmark]: Boogie Preprocessor took 51.39 ms. Allocated memory is still 203.9 MB. Free memory was 172.1 MB in the beginning and 168.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:40,426 INFO L168 Benchmark]: RCFGBuilder took 1027.34 ms. Allocated memory is still 203.9 MB. Free memory was 168.7 MB in the beginning and 117.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:40,427 INFO L168 Benchmark]: TraceAbstraction took 55015.96 ms. Allocated memory was 203.9 MB in the beginning and 788.5 MB in the end (delta: 584.6 MB). Free memory was 117.1 MB in the beginning and 360.5 MB in the end (delta: -243.5 MB). Peak memory consumption was 341.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:40,428 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 679.27 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 103.1 MB in the beginning and 176.8 MB in the end (delta: -73.8 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.18 ms. Allocated memory is still 203.9 MB. Free memory was 176.8 MB in the beginning and 172.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.39 ms. Allocated memory is still 203.9 MB. Free memory was 172.1 MB in the beginning and 168.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1027.34 ms. Allocated memory is still 203.9 MB. Free memory was 168.7 MB in the beginning and 117.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55015.96 ms. Allocated memory was 203.9 MB in the beginning and 788.5 MB in the end (delta: 584.6 MB). Free memory was 117.1 MB in the beginning and 360.5 MB in the end (delta: -243.5 MB). Peak memory consumption was 341.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_Protocol = 1; [L6] int m_msg_2 = 2; [L7] int m_recv_ack_2 = 3; [L8] int m_msg_1_1 = 4; [L9] int m_msg_1_2 = 5; [L10] int m_recv_ack_1_1 = 6; [L11] 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] [L16] int q = 0; [L17] int method_id; [L20] int this_expect = 0; [L21] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] COND TRUE q == 0 [L44] COND TRUE __VERIFIER_nondet_int() [L48] 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] [L50] COND FALSE !(0) [L54] q = 1 [L56] this_expect=0 [L56] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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))))) [L290] q = 4 [L292] this_expect=this_expect [L292] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] 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] [L418] 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))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] 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] [L163] 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] [L263] 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] [L363] 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] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] 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] [L550] 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))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] 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] [L43] 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] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] 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] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] 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] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND TRUE this_expect > 16 [L39] 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] [L43] 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] [L63] 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] [L163] 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] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] 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] [L286] 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] [L569] __VERIFIER_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. Result: UNSAFE, OverallTime: 54.9s, OverallIterations: 44, TraceHistogramMax: 35, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11153 SDtfs, 14642 SDslu, 142902 SDs, 0 SdLazy, 17662 SolverSat, 601 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5606 GetRequests, 5009 SyntacticMatches, 43 SemanticMatches, 554 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 43 MinimizatonAttempts, 366 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 10856 NumberOfCodeBlocks, 10426 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 10385 ConstructedInterpolants, 0 QuantifiedInterpolants, 13596320 SizeOfPredicates, 83 NumberOfNonLiveVariables, 26760 ConjunctsInSsa, 1041 ConjunctsInUnsatCore, 76 InterpolantComputations, 10 PerfectInterpolantSequences, 8280/49367 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...