java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 03:40:06,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 03:40:06,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 03:40:06,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 03:40:06,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 03:40:06,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 03:40:06,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 03:40:06,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 03:40:06,464 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 03:40:06,465 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 03:40:06,466 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 03:40:06,466 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 03:40:06,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 03:40:06,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 03:40:06,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 03:40:06,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 03:40:06,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 03:40:06,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 03:40:06,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 03:40:06,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 03:40:06,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 03:40:06,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 03:40:06,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 03:40:06,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 03:40:06,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 03:40:06,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 03:40:06,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 03:40:06,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 03:40:06,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 03:40:06,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 03:40:06,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 03:40:06,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 03:40:06,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 03:40:06,509 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 03:40:06,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 03:40:06,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 03:40:06,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 03:40:06,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 03:40:06,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 03:40:06,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 03:40:06,544 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 03:40:06,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 03:40:06,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 03:40:06,546 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 03:40:06,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 03:40:06,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 03:40:06,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 03:40:06,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 03:40:06,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 03:40:06,547 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 03:40:06,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 03:40:06,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 03:40:06,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 03:40:06,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 03:40:06,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 03:40:06,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 03:40:06,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 03:40:06,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 03:40:06,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 03:40:06,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 03:40:06,552 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 03:40:06,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 03:40:06,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 03:40:06,552 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 03:40:06,552 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 03:40:06,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 03:40:06,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 03:40:06,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 03:40:06,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 03:40:06,640 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 03:40:06,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-07-24 03:40:06,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8b09215/cbef614cf8d64872b11ac951815faa0d/FLAG1314a08a8 [2018-07-24 03:40:07,188 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 03:40:07,189 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-07-24 03:40:07,211 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8b09215/cbef614cf8d64872b11ac951815faa0d/FLAG1314a08a8 [2018-07-24 03:40:07,233 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8b09215/cbef614cf8d64872b11ac951815faa0d [2018-07-24 03:40:07,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 03:40:07,245 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 03:40:07,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 03:40:07,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 03:40:07,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 03:40:07,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1006d272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07, skipping insertion in model container [2018-07-24 03:40:07,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,485 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 03:40:07,676 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 03:40:07,693 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 03:40:07,797 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 03:40:07,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07 WrapperNode [2018-07-24 03:40:07,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 03:40:07,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 03:40:07,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 03:40:07,846 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 03:40:07,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 03:40:07,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 03:40:07,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 03:40:07,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 03:40:07,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:07,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:08,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (1/1) ... [2018-07-24 03:40:08,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 03:40:08,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 03:40:08,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 03:40:08,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 03:40:08,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (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 [2018-07-24 03:40:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 03:40:08,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 03:40:09,950 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 03:40:09,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 03:40:09 BoogieIcfgContainer [2018-07-24 03:40:09,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 03:40:09,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 03:40:09,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 03:40:09,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 03:40:09,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 03:40:07" (1/3) ... [2018-07-24 03:40:09,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157b5ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 03:40:09, skipping insertion in model container [2018-07-24 03:40:09,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:40:07" (2/3) ... [2018-07-24 03:40:09,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157b5ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 03:40:09, skipping insertion in model container [2018-07-24 03:40:09,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 03:40:09" (3/3) ... [2018-07-24 03:40:09,960 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-07-24 03:40:09,969 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 03:40:09,977 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 03:40:10,018 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 03:40:10,019 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 03:40:10,019 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 03:40:10,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 03:40:10,020 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 03:40:10,020 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 03:40:10,020 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 03:40:10,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 03:40:10,021 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 03:40:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-07-24 03:40:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-24 03:40:10,046 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:10,047 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:40:10,048 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash -977991394, now seen corresponding path program 1 times [2018-07-24 03:40:10,055 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:10,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:10,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:10,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:10,195 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:10,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 03:40:10,200 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-24 03:40:10,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-24 03:40:10,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-24 03:40:10,214 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2018-07-24 03:40:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:10,247 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2018-07-24 03:40:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-24 03:40:10,248 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-07-24 03:40:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:10,263 INFO L225 Difference]: With dead ends: 218 [2018-07-24 03:40:10,263 INFO L226 Difference]: Without dead ends: 106 [2018-07-24 03:40:10,267 INFO L573 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 [2018-07-24 03:40:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-24 03:40:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-24 03:40:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-24 03:40:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2018-07-24 03:40:10,316 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2018-07-24 03:40:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2018-07-24 03:40:10,317 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-24 03:40:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2018-07-24 03:40:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-24 03:40:10,318 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:10,319 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:40:10,319 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:10,319 INFO L82 PathProgramCache]: Analyzing trace with hash 279525351, now seen corresponding path program 1 times [2018-07-24 03:40:10,319 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:10,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:10,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:10,400 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:10,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:10,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:10,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:10,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:10,404 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2018-07-24 03:40:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:10,704 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2018-07-24 03:40:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:10,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-07-24 03:40:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:10,707 INFO L225 Difference]: With dead ends: 214 [2018-07-24 03:40:10,707 INFO L226 Difference]: Without dead ends: 110 [2018-07-24 03:40:10,709 INFO L573 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 [2018-07-24 03:40:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-24 03:40:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-24 03:40:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-24 03:40:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2018-07-24 03:40:10,722 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2018-07-24 03:40:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:10,722 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2018-07-24 03:40:10,722 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2018-07-24 03:40:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-24 03:40:10,724 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:10,724 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:40:10,724 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1710410508, now seen corresponding path program 1 times [2018-07-24 03:40:10,725 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:10,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:10,938 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:10,938 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:10,939 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:10,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:10,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:10,939 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 3 states. [2018-07-24 03:40:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:11,478 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2018-07-24 03:40:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:11,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-24 03:40:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:11,482 INFO L225 Difference]: With dead ends: 324 [2018-07-24 03:40:11,483 INFO L226 Difference]: Without dead ends: 195 [2018-07-24 03:40:11,484 INFO L573 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 [2018-07-24 03:40:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-24 03:40:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-07-24 03:40:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-24 03:40:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2018-07-24 03:40:11,501 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2018-07-24 03:40:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:11,501 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2018-07-24 03:40:11,501 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2018-07-24 03:40:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-24 03:40:11,502 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:11,503 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:40:11,503 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1268129073, now seen corresponding path program 1 times [2018-07-24 03:40:11,503 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:11,589 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:11,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:11,590 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:11,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:11,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:11,591 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2018-07-24 03:40:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:11,691 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2018-07-24 03:40:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:11,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-07-24 03:40:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:11,695 INFO L225 Difference]: With dead ends: 314 [2018-07-24 03:40:11,695 INFO L226 Difference]: Without dead ends: 133 [2018-07-24 03:40:11,696 INFO L573 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 [2018-07-24 03:40:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-24 03:40:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-07-24 03:40:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-24 03:40:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2018-07-24 03:40:11,708 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2018-07-24 03:40:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:11,709 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2018-07-24 03:40:11,709 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2018-07-24 03:40:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-24 03:40:11,710 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:11,710 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:40:11,711 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1534733406, now seen corresponding path program 1 times [2018-07-24 03:40:11,711 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:11,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-24 03:40:11,824 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:11,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:11,825 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:11,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:11,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:11,826 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2018-07-24 03:40:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:11,952 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2018-07-24 03:40:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:11,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-07-24 03:40:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:11,953 INFO L225 Difference]: With dead ends: 243 [2018-07-24 03:40:11,954 INFO L226 Difference]: Without dead ends: 115 [2018-07-24 03:40:11,954 INFO L573 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 [2018-07-24 03:40:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-24 03:40:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-07-24 03:40:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-24 03:40:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2018-07-24 03:40:11,962 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2018-07-24 03:40:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:11,962 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2018-07-24 03:40:11,963 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2018-07-24 03:40:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-24 03:40:11,964 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:11,964 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:40:11,964 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -478960449, now seen corresponding path program 1 times [2018-07-24 03:40:11,965 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:11,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:12,164 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:12,164 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:12,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:12,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:12,413 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:12,413 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-07-24 03:40:12,414 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 03:40:12,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 03:40:12,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:12,415 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2018-07-24 03:40:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:13,477 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2018-07-24 03:40:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 03:40:13,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-07-24 03:40:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:13,479 INFO L225 Difference]: With dead ends: 204 [2018-07-24 03:40:13,479 INFO L226 Difference]: Without dead ends: 192 [2018-07-24 03:40:13,479 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-24 03:40:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2018-07-24 03:40:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-24 03:40:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2018-07-24 03:40:13,491 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2018-07-24 03:40:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:13,492 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2018-07-24 03:40:13,492 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 03:40:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2018-07-24 03:40:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-24 03:40:13,493 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:13,494 INFO L353 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] [2018-07-24 03:40:13,494 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1951428508, now seen corresponding path program 1 times [2018-07-24 03:40:13,494 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:13,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:13,671 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:13,671 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:13,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:13,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:13,836 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:13,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-07-24 03:40:13,837 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 03:40:13,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 03:40:13,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:13,838 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 5 states. [2018-07-24 03:40:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:14,356 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2018-07-24 03:40:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:40:14,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-07-24 03:40:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:14,360 INFO L225 Difference]: With dead ends: 387 [2018-07-24 03:40:14,360 INFO L226 Difference]: Without dead ends: 230 [2018-07-24 03:40:14,361 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-24 03:40:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2018-07-24 03:40:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-24 03:40:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2018-07-24 03:40:14,372 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2018-07-24 03:40:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2018-07-24 03:40:14,372 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 03:40:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2018-07-24 03:40:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-24 03:40:14,374 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:14,374 INFO L353 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] [2018-07-24 03:40:14,374 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1318541348, now seen corresponding path program 1 times [2018-07-24 03:40:14,374 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:14,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:14,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:14,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:14,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-24 03:40:14,427 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:14,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:14,428 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:14,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:14,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:14,429 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2018-07-24 03:40:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:14,501 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2018-07-24 03:40:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:14,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-24 03:40:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:14,504 INFO L225 Difference]: With dead ends: 409 [2018-07-24 03:40:14,504 INFO L226 Difference]: Without dead ends: 211 [2018-07-24 03:40:14,505 INFO L573 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 [2018-07-24 03:40:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-24 03:40:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-07-24 03:40:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-24 03:40:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2018-07-24 03:40:14,514 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2018-07-24 03:40:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:14,515 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2018-07-24 03:40:14,515 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2018-07-24 03:40:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-24 03:40:14,517 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:14,517 INFO L353 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] [2018-07-24 03:40:14,517 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1553389745, now seen corresponding path program 1 times [2018-07-24 03:40:14,518 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:14,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:14,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:14,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:14,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-07-24 03:40:14,614 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:14,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:14,615 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:14,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:14,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:14,616 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2018-07-24 03:40:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:14,718 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2018-07-24 03:40:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:14,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-07-24 03:40:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:14,720 INFO L225 Difference]: With dead ends: 375 [2018-07-24 03:40:14,720 INFO L226 Difference]: Without dead ends: 211 [2018-07-24 03:40:14,722 INFO L573 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 [2018-07-24 03:40:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-24 03:40:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-07-24 03:40:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-24 03:40:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2018-07-24 03:40:14,731 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2018-07-24 03:40:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:14,731 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2018-07-24 03:40:14,731 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2018-07-24 03:40:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-24 03:40:14,733 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:14,733 INFO L353 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] [2018-07-24 03:40:14,733 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1840811351, now seen corresponding path program 1 times [2018-07-24 03:40:14,734 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 03:40:14,985 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:14,985 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:15,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:15,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 03:40:15,150 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:15,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-07-24 03:40:15,151 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 03:40:15,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 03:40:15,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:15,151 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 5 states. [2018-07-24 03:40:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:15,758 INFO L93 Difference]: Finished difference Result 485 states and 762 transitions. [2018-07-24 03:40:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 03:40:15,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-07-24 03:40:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:15,762 INFO L225 Difference]: With dead ends: 485 [2018-07-24 03:40:15,762 INFO L226 Difference]: Without dead ends: 270 [2018-07-24 03:40:15,763 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-07-24 03:40:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-07-24 03:40:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-24 03:40:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2018-07-24 03:40:15,772 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2018-07-24 03:40:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:15,772 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2018-07-24 03:40:15,773 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 03:40:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2018-07-24 03:40:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-24 03:40:15,774 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:15,774 INFO L353 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] [2018-07-24 03:40:15,774 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1242023532, now seen corresponding path program 1 times [2018-07-24 03:40:15,775 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:15,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:15,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 03:40:16,018 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:16,018 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:16,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:16,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 03:40:16,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:16,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-07-24 03:40:16,191 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 03:40:16,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 03:40:16,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:40:16,192 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2018-07-24 03:40:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:17,199 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2018-07-24 03:40:17,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:40:17,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-07-24 03:40:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:17,201 INFO L225 Difference]: With dead ends: 274 [2018-07-24 03:40:17,201 INFO L226 Difference]: Without dead ends: 262 [2018-07-24 03:40:17,202 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:40:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-24 03:40:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-07-24 03:40:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-24 03:40:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-07-24 03:40:17,211 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2018-07-24 03:40:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:17,211 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-07-24 03:40:17,211 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 03:40:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-07-24 03:40:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-24 03:40:17,213 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:17,213 INFO L353 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] [2018-07-24 03:40:17,213 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -49990723, now seen corresponding path program 1 times [2018-07-24 03:40:17,214 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:17,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:17,527 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:17,527 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:17,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:17,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:17,672 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:17,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-07-24 03:40:17,673 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 03:40:17,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 03:40:17,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:17,674 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 5 states. [2018-07-24 03:40:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:18,158 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2018-07-24 03:40:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 03:40:18,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-07-24 03:40:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:18,162 INFO L225 Difference]: With dead ends: 269 [2018-07-24 03:40:18,163 INFO L226 Difference]: Without dead ends: 267 [2018-07-24 03:40:18,163 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-24 03:40:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2018-07-24 03:40:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-24 03:40:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2018-07-24 03:40:18,172 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2018-07-24 03:40:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:18,172 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2018-07-24 03:40:18,173 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 03:40:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2018-07-24 03:40:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-24 03:40:18,174 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:18,174 INFO L353 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] [2018-07-24 03:40:18,174 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1424474683, now seen corresponding path program 1 times [2018-07-24 03:40:18,174 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:18,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:18,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-07-24 03:40:18,244 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:18,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:18,244 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:18,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:18,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:18,245 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2018-07-24 03:40:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:18,352 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2018-07-24 03:40:18,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:18,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-07-24 03:40:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:18,355 INFO L225 Difference]: With dead ends: 461 [2018-07-24 03:40:18,355 INFO L226 Difference]: Without dead ends: 245 [2018-07-24 03:40:18,356 INFO L573 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 [2018-07-24 03:40:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-24 03:40:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-07-24 03:40:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-24 03:40:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2018-07-24 03:40:18,362 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2018-07-24 03:40:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:18,363 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2018-07-24 03:40:18,363 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2018-07-24 03:40:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-24 03:40:18,364 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:18,364 INFO L353 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] [2018-07-24 03:40:18,364 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -358563469, now seen corresponding path program 1 times [2018-07-24 03:40:18,365 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-07-24 03:40:18,444 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:40:18,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:40:18,444 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:40:18,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:40:18,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:40:18,445 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2018-07-24 03:40:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:18,608 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2018-07-24 03:40:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:40:18,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-07-24 03:40:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:18,610 INFO L225 Difference]: With dead ends: 333 [2018-07-24 03:40:18,610 INFO L226 Difference]: Without dead ends: 155 [2018-07-24 03:40:18,611 INFO L573 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 [2018-07-24 03:40:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-24 03:40:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-07-24 03:40:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-24 03:40:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2018-07-24 03:40:18,616 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2018-07-24 03:40:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:18,617 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2018-07-24 03:40:18,617 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:40:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2018-07-24 03:40:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-24 03:40:18,617 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:18,618 INFO L353 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] [2018-07-24 03:40:18,618 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:18,618 INFO L82 PathProgramCache]: Analyzing trace with hash 815637581, now seen corresponding path program 1 times [2018-07-24 03:40:18,618 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:18,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:18,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:18,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:18,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 03:40:18,756 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:18,756 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:18,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:18,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 03:40:18,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:18,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-07-24 03:40:18,899 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 03:40:18,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 03:40:18,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:40:18,899 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2018-07-24 03:40:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:19,036 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2018-07-24 03:40:19,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 03:40:19,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-07-24 03:40:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:19,038 INFO L225 Difference]: With dead ends: 286 [2018-07-24 03:40:19,038 INFO L226 Difference]: Without dead ends: 194 [2018-07-24 03:40:19,039 INFO L573 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 [2018-07-24 03:40:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-24 03:40:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-07-24 03:40:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-24 03:40:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2018-07-24 03:40:19,046 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2018-07-24 03:40:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:19,047 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2018-07-24 03:40:19,047 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 03:40:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2018-07-24 03:40:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-24 03:40:19,048 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:19,048 INFO L353 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] [2018-07-24 03:40:19,048 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:19,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1231752593, now seen corresponding path program 1 times [2018-07-24 03:40:19,049 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:19,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:19,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:19,383 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 03:40:19,559 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-07-24 03:40:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:19,752 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:19,753 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:19,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:19,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:20,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:20,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-07-24 03:40:20,444 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 03:40:20,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 03:40:20,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:20,444 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 9 states. [2018-07-24 03:40:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:20,628 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2018-07-24 03:40:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 03:40:20,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-07-24 03:40:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:20,630 INFO L225 Difference]: With dead ends: 193 [2018-07-24 03:40:20,630 INFO L226 Difference]: Without dead ends: 191 [2018-07-24 03:40:20,631 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-24 03:40:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-24 03:40:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-24 03:40:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2018-07-24 03:40:20,639 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2018-07-24 03:40:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:20,639 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2018-07-24 03:40:20,639 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 03:40:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2018-07-24 03:40:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-24 03:40:20,640 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:20,640 INFO L353 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] [2018-07-24 03:40:20,641 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1872470397, now seen corresponding path program 1 times [2018-07-24 03:40:20,641 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:21,138 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:21,138 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:21,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:21,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:21,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:21,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-07-24 03:40:21,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 03:40:21,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 03:40:21,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:21,432 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 9 states. [2018-07-24 03:40:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:21,819 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2018-07-24 03:40:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 03:40:21,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-07-24 03:40:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:21,820 INFO L225 Difference]: With dead ends: 194 [2018-07-24 03:40:21,820 INFO L226 Difference]: Without dead ends: 192 [2018-07-24 03:40:21,821 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-24 03:40:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-24 03:40:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-24 03:40:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2018-07-24 03:40:21,827 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2018-07-24 03:40:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:21,828 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2018-07-24 03:40:21,828 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 03:40:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2018-07-24 03:40:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-24 03:40:21,829 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:21,829 INFO L353 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] [2018-07-24 03:40:21,829 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1918414029, now seen corresponding path program 1 times [2018-07-24 03:40:21,829 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:21,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:21,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:21,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:22,201 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:22,201 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:22,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:22,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:22,562 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:22,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-07-24 03:40:22,562 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 03:40:22,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 03:40:22,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:22,563 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 13 states. [2018-07-24 03:40:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:23,197 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2018-07-24 03:40:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 03:40:23,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-07-24 03:40:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:23,199 INFO L225 Difference]: With dead ends: 301 [2018-07-24 03:40:23,199 INFO L226 Difference]: Without dead ends: 211 [2018-07-24 03:40:23,202 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-24 03:40:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-24 03:40:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-24 03:40:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2018-07-24 03:40:23,210 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2018-07-24 03:40:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:23,211 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2018-07-24 03:40:23,211 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 03:40:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2018-07-24 03:40:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-24 03:40:23,212 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:23,212 INFO L353 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] [2018-07-24 03:40:23,212 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1532123494, now seen corresponding path program 1 times [2018-07-24 03:40:23,212 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:23,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 03:40:23,770 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:23,770 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-07-24 03:40:23,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:23,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 03:40:24,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:24,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2018-07-24 03:40:24,162 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 03:40:24,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 03:40:24,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:40:24,163 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 7 states. [2018-07-24 03:40:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:24,691 INFO L93 Difference]: Finished difference Result 324 states and 466 transitions. [2018-07-24 03:40:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 03:40:24,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-07-24 03:40:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:24,694 INFO L225 Difference]: With dead ends: 324 [2018-07-24 03:40:24,694 INFO L226 Difference]: Without dead ends: 234 [2018-07-24 03:40:24,694 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:40:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-24 03:40:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-07-24 03:40:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-24 03:40:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2018-07-24 03:40:24,702 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2018-07-24 03:40:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:24,702 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2018-07-24 03:40:24,702 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 03:40:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2018-07-24 03:40:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-24 03:40:24,703 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:24,704 INFO L353 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] [2018-07-24 03:40:24,704 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:24,704 INFO L82 PathProgramCache]: Analyzing trace with hash -644957874, now seen corresponding path program 1 times [2018-07-24 03:40:24,704 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:24,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:24,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:24,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:25,085 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:25,085 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:25,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:25,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:25,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:25,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-07-24 03:40:25,292 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 03:40:25,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 03:40:25,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:25,293 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 9 states. [2018-07-24 03:40:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:25,631 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2018-07-24 03:40:25,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 03:40:25,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-07-24 03:40:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:25,634 INFO L225 Difference]: With dead ends: 233 [2018-07-24 03:40:25,634 INFO L226 Difference]: Without dead ends: 231 [2018-07-24 03:40:25,634 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-24 03:40:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-24 03:40:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-24 03:40:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2018-07-24 03:40:25,642 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2018-07-24 03:40:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:25,643 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2018-07-24 03:40:25,643 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 03:40:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2018-07-24 03:40:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-24 03:40:25,644 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:25,644 INFO L353 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] [2018-07-24 03:40:25,644 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1304536994, now seen corresponding path program 1 times [2018-07-24 03:40:25,645 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:25,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:25,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 03:40:26,395 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:26,395 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:26,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:26,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 03:40:26,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:26,585 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-07-24 03:40:26,585 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 03:40:26,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 03:40:26,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:40:26,586 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2018-07-24 03:40:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:26,804 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2018-07-24 03:40:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 03:40:26,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-07-24 03:40:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:26,805 INFO L225 Difference]: With dead ends: 364 [2018-07-24 03:40:26,805 INFO L226 Difference]: Without dead ends: 272 [2018-07-24 03:40:26,806 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:40:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-24 03:40:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2018-07-24 03:40:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-24 03:40:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2018-07-24 03:40:26,813 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2018-07-24 03:40:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:26,814 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2018-07-24 03:40:26,814 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 03:40:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2018-07-24 03:40:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-24 03:40:26,815 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:26,815 INFO L353 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] [2018-07-24 03:40:26,815 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1370174976, now seen corresponding path program 1 times [2018-07-24 03:40:26,816 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:26,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:26,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:26,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:26,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:27,100 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:27,100 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:27,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:27,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:27,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:27,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-07-24 03:40:27,565 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-24 03:40:27,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-24 03:40:27,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-07-24 03:40:27,566 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 17 states. [2018-07-24 03:40:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:27,919 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2018-07-24 03:40:27,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-24 03:40:27,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-07-24 03:40:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:27,922 INFO L225 Difference]: With dead ends: 271 [2018-07-24 03:40:27,923 INFO L226 Difference]: Without dead ends: 269 [2018-07-24 03:40:27,923 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-07-24 03:40:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-24 03:40:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-24 03:40:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-24 03:40:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2018-07-24 03:40:27,931 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2018-07-24 03:40:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2018-07-24 03:40:27,932 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-24 03:40:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2018-07-24 03:40:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-24 03:40:27,933 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:27,933 INFO L353 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] [2018-07-24 03:40:27,934 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 903292370, now seen corresponding path program 2 times [2018-07-24 03:40:27,934 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:27,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:27,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:28,667 WARN L169 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-07-24 03:40:29,016 WARN L169 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-07-24 03:40:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:29,284 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:29,284 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:29,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:29,387 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:29,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:29,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:29,569 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:29,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-07-24 03:40:29,570 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 03:40:29,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 03:40:29,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:29,571 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 13 states. [2018-07-24 03:40:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:30,036 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2018-07-24 03:40:30,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 03:40:30,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-07-24 03:40:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:30,039 INFO L225 Difference]: With dead ends: 272 [2018-07-24 03:40:30,039 INFO L226 Difference]: Without dead ends: 270 [2018-07-24 03:40:30,040 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-07-24 03:40:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-07-24 03:40:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-07-24 03:40:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2018-07-24 03:40:30,046 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2018-07-24 03:40:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:30,047 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2018-07-24 03:40:30,047 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 03:40:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2018-07-24 03:40:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-24 03:40:30,048 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:30,048 INFO L353 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] [2018-07-24 03:40:30,048 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1176536002, now seen corresponding path program 2 times [2018-07-24 03:40:30,049 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:30,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:30,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-07-24 03:40:30,386 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:30,386 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:30,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:30,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:30,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:30,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:30,940 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:30,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-07-24 03:40:30,941 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-24 03:40:30,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-24 03:40:30,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-07-24 03:40:30,942 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 19 states. [2018-07-24 03:40:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:31,305 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2018-07-24 03:40:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 03:40:31,312 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 119 [2018-07-24 03:40:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:31,314 INFO L225 Difference]: With dead ends: 379 [2018-07-24 03:40:31,314 INFO L226 Difference]: Without dead ends: 289 [2018-07-24 03:40:31,315 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-07-24 03:40:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-24 03:40:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-24 03:40:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-24 03:40:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2018-07-24 03:40:31,325 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2018-07-24 03:40:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:31,326 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2018-07-24 03:40:31,326 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-24 03:40:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2018-07-24 03:40:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-24 03:40:31,327 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:31,328 INFO L353 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] [2018-07-24 03:40:31,328 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:31,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1647353035, now seen corresponding path program 2 times [2018-07-24 03:40:31,328 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:31,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:31,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:31,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:31,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-07-24 03:40:32,147 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:32,148 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:32,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:32,274 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:32,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:32,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-07-24 03:40:32,527 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:32,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-07-24 03:40:32,528 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 03:40:32,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 03:40:32,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:32,528 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 9 states. [2018-07-24 03:40:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:32,728 INFO L93 Difference]: Finished difference Result 402 states and 573 transitions. [2018-07-24 03:40:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 03:40:32,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-07-24 03:40:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:32,732 INFO L225 Difference]: With dead ends: 402 [2018-07-24 03:40:32,732 INFO L226 Difference]: Without dead ends: 312 [2018-07-24 03:40:32,733 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-24 03:40:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-07-24 03:40:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-07-24 03:40:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2018-07-24 03:40:32,740 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2018-07-24 03:40:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:32,741 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2018-07-24 03:40:32,741 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 03:40:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2018-07-24 03:40:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-24 03:40:32,742 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:32,743 INFO L353 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] [2018-07-24 03:40:32,743 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:32,743 INFO L82 PathProgramCache]: Analyzing trace with hash 778512671, now seen corresponding path program 2 times [2018-07-24 03:40:32,743 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:32,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:32,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:33,077 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 03:40:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:33,511 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:33,511 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:33,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:33,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:33,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:33,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:33,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:33,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-07-24 03:40:33,765 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 03:40:33,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 03:40:33,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:33,765 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 13 states. [2018-07-24 03:40:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:34,369 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2018-07-24 03:40:34,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 03:40:34,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2018-07-24 03:40:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:34,372 INFO L225 Difference]: With dead ends: 311 [2018-07-24 03:40:34,372 INFO L226 Difference]: Without dead ends: 309 [2018-07-24 03:40:34,373 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-24 03:40:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-07-24 03:40:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-24 03:40:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2018-07-24 03:40:34,381 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2018-07-24 03:40:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:34,382 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2018-07-24 03:40:34,382 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 03:40:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2018-07-24 03:40:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-24 03:40:34,383 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:34,383 INFO L353 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] [2018-07-24 03:40:34,383 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash 199268015, now seen corresponding path program 2 times [2018-07-24 03:40:34,384 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:34,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:34,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-07-24 03:40:34,818 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:34,818 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:34,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:34,972 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:34,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:34,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-07-24 03:40:35,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:35,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-07-24 03:40:35,078 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 03:40:35,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 03:40:35,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:35,079 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2018-07-24 03:40:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:35,337 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2018-07-24 03:40:35,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 03:40:35,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2018-07-24 03:40:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:35,340 INFO L225 Difference]: With dead ends: 442 [2018-07-24 03:40:35,340 INFO L226 Difference]: Without dead ends: 350 [2018-07-24 03:40:35,341 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:40:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-07-24 03:40:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2018-07-24 03:40:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-07-24 03:40:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2018-07-24 03:40:35,350 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2018-07-24 03:40:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:35,351 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2018-07-24 03:40:35,351 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 03:40:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2018-07-24 03:40:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-24 03:40:35,352 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:35,352 INFO L353 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] [2018-07-24 03:40:35,353 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2020860881, now seen corresponding path program 2 times [2018-07-24 03:40:35,353 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:35,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:35,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:35,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:35,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:35,821 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:35,821 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:35,958 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:35,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:35,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:36,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:36,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-07-24 03:40:36,399 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-24 03:40:36,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-24 03:40:36,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-07-24 03:40:36,400 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 25 states. [2018-07-24 03:40:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:36,993 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2018-07-24 03:40:36,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 03:40:36,994 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2018-07-24 03:40:36,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:36,997 INFO L225 Difference]: With dead ends: 349 [2018-07-24 03:40:36,997 INFO L226 Difference]: Without dead ends: 347 [2018-07-24 03:40:36,998 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-07-24 03:40:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-07-24 03:40:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-07-24 03:40:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-07-24 03:40:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2018-07-24 03:40:37,006 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2018-07-24 03:40:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:37,006 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2018-07-24 03:40:37,006 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-24 03:40:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2018-07-24 03:40:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-24 03:40:37,007 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:37,008 INFO L353 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] [2018-07-24 03:40:37,008 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1480030945, now seen corresponding path program 3 times [2018-07-24 03:40:37,008 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:37,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:37,601 WARN L169 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-07-24 03:40:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:38,259 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:38,259 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:38,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 03:40:38,343 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-07-24 03:40:38,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:38,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:39,154 WARN L169 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 10 [2018-07-24 03:40:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-07-24 03:40:39,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:39,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2018-07-24 03:40:39,369 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-24 03:40:39,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-24 03:40:39,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-07-24 03:40:39,370 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 22 states. [2018-07-24 03:40:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:41,353 INFO L93 Difference]: Finished difference Result 545 states and 767 transitions. [2018-07-24 03:40:41,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-24 03:40:41,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 155 [2018-07-24 03:40:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:41,357 INFO L225 Difference]: With dead ends: 545 [2018-07-24 03:40:41,357 INFO L226 Difference]: Without dead ends: 449 [2018-07-24 03:40:41,358 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-07-24 03:40:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-07-24 03:40:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2018-07-24 03:40:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-07-24 03:40:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2018-07-24 03:40:41,368 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2018-07-24 03:40:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:41,369 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2018-07-24 03:40:41,369 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-24 03:40:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2018-07-24 03:40:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-24 03:40:41,370 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:41,370 INFO L353 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] [2018-07-24 03:40:41,370 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1330761773, now seen corresponding path program 1 times [2018-07-24 03:40:41,371 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:41,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:41,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-24 03:40:42,478 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:42,478 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:42,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:42,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-24 03:40:42,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:42,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-07-24 03:40:42,714 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 03:40:42,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 03:40:42,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-24 03:40:42,715 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 10 states. [2018-07-24 03:40:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:43,196 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2018-07-24 03:40:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-24 03:40:43,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-07-24 03:40:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:43,200 INFO L225 Difference]: With dead ends: 927 [2018-07-24 03:40:43,201 INFO L226 Difference]: Without dead ends: 760 [2018-07-24 03:40:43,201 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-24 03:40:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-07-24 03:40:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2018-07-24 03:40:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-07-24 03:40:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2018-07-24 03:40:43,220 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2018-07-24 03:40:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:43,220 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2018-07-24 03:40:43,220 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-24 03:40:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2018-07-24 03:40:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-24 03:40:43,222 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:43,222 INFO L353 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] [2018-07-24 03:40:43,222 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1753421813, now seen corresponding path program 1 times [2018-07-24 03:40:43,222 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:43,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:43,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:44,099 WARN L169 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-07-24 03:40:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 45 proven. 611 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-24 03:40:44,363 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:44,363 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:44,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:44,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-24 03:40:44,677 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:40:44,677 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-07-24 03:40:44,678 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-24 03:40:44,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-24 03:40:44,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-07-24 03:40:44,679 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 18 states. [2018-07-24 03:40:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:44,919 INFO L93 Difference]: Finished difference Result 864 states and 1212 transitions. [2018-07-24 03:40:44,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-24 03:40:44,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 177 [2018-07-24 03:40:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:44,923 INFO L225 Difference]: With dead ends: 864 [2018-07-24 03:40:44,924 INFO L226 Difference]: Without dead ends: 859 [2018-07-24 03:40:44,924 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-07-24 03:40:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-07-24 03:40:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 852. [2018-07-24 03:40:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-07-24 03:40:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2018-07-24 03:40:44,941 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2018-07-24 03:40:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:44,941 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2018-07-24 03:40:44,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-24 03:40:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2018-07-24 03:40:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-24 03:40:44,943 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:44,943 INFO L353 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] [2018-07-24 03:40:44,943 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1467051216, now seen corresponding path program 3 times [2018-07-24 03:40:44,943 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:44,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:44,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:45,770 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:45,770 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:45,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 03:40:45,971 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-07-24 03:40:45,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:45,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:46,315 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-07-24 03:40:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 626 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-24 03:40:46,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:46,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2018-07-24 03:40:46,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-24 03:40:46,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-24 03:40:46,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-07-24 03:40:46,382 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 25 states. [2018-07-24 03:40:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:47,528 INFO L93 Difference]: Finished difference Result 855 states and 1203 transitions. [2018-07-24 03:40:47,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-24 03:40:47,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-07-24 03:40:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:47,531 INFO L225 Difference]: With dead ends: 855 [2018-07-24 03:40:47,531 INFO L226 Difference]: Without dead ends: 853 [2018-07-24 03:40:47,532 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-07-24 03:40:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-07-24 03:40:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2018-07-24 03:40:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-07-24 03:40:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1201 transitions. [2018-07-24 03:40:47,549 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1201 transitions. Word has length 178 [2018-07-24 03:40:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:47,549 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1201 transitions. [2018-07-24 03:40:47,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-24 03:40:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1201 transitions. [2018-07-24 03:40:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-24 03:40:47,551 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:47,551 INFO L353 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] [2018-07-24 03:40:47,551 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1843336189, now seen corresponding path program 1 times [2018-07-24 03:40:47,551 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:47,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:47,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-24 03:40:47,979 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:47,979 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:47,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:48,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-24 03:40:48,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:48,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-07-24 03:40:48,219 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 03:40:48,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 03:40:48,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-24 03:40:48,220 INFO L87 Difference]: Start difference. First operand 853 states and 1201 transitions. Second operand 11 states. [2018-07-24 03:40:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:49,299 INFO L93 Difference]: Finished difference Result 1435 states and 2016 transitions. [2018-07-24 03:40:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-24 03:40:49,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2018-07-24 03:40:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:49,305 INFO L225 Difference]: With dead ends: 1435 [2018-07-24 03:40:49,305 INFO L226 Difference]: Without dead ends: 959 [2018-07-24 03:40:49,306 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-24 03:40:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-07-24 03:40:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2018-07-24 03:40:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-07-24 03:40:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1312 transitions. [2018-07-24 03:40:49,325 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1312 transitions. Word has length 193 [2018-07-24 03:40:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:49,325 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-07-24 03:40:49,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 03:40:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1312 transitions. [2018-07-24 03:40:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-24 03:40:49,327 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:49,327 INFO L353 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] [2018-07-24 03:40:49,327 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1976503266, now seen corresponding path program 3 times [2018-07-24 03:40:49,327 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:49,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:49,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:49,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:40:49,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:49,701 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 03:40:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:40:50,792 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:50,792 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 03:40:51,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-07-24 03:40:51,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:51,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-24 03:40:51,712 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:51,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-07-24 03:40:51,713 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-24 03:40:51,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-24 03:40:51,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-07-24 03:40:51,714 INFO L87 Difference]: Start difference. First operand 930 states and 1312 transitions. Second operand 29 states. [2018-07-24 03:40:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:52,602 INFO L93 Difference]: Finished difference Result 938 states and 1318 transitions. [2018-07-24 03:40:52,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-24 03:40:52,602 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 194 [2018-07-24 03:40:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:52,606 INFO L225 Difference]: With dead ends: 938 [2018-07-24 03:40:52,607 INFO L226 Difference]: Without dead ends: 936 [2018-07-24 03:40:52,608 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=274, Invalid=1058, Unknown=0, NotChecked=0, Total=1332 [2018-07-24 03:40:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-07-24 03:40:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2018-07-24 03:40:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-07-24 03:40:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2018-07-24 03:40:52,626 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2018-07-24 03:40:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:52,627 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2018-07-24 03:40:52,627 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-24 03:40:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2018-07-24 03:40:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-24 03:40:52,628 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:52,628 INFO L353 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] [2018-07-24 03:40:52,629 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1917318174, now seen corresponding path program 2 times [2018-07-24 03:40:52,629 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:52,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:52,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-24 03:40:52,863 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:52,863 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:52,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:53,040 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:53,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:53,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-24 03:40:53,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:53,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-07-24 03:40:53,118 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 03:40:53,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 03:40:53,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-24 03:40:53,119 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 12 states. [2018-07-24 03:40:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:53,346 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2018-07-24 03:40:53,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-24 03:40:53,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2018-07-24 03:40:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:53,350 INFO L225 Difference]: With dead ends: 1125 [2018-07-24 03:40:53,351 INFO L226 Difference]: Without dead ends: 1040 [2018-07-24 03:40:53,351 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-24 03:40:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-07-24 03:40:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2018-07-24 03:40:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2018-07-24 03:40:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2018-07-24 03:40:53,373 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2018-07-24 03:40:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:53,373 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2018-07-24 03:40:53,374 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 03:40:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2018-07-24 03:40:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-07-24 03:40:53,375 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:53,375 INFO L353 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] [2018-07-24 03:40:53,376 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:53,376 INFO L82 PathProgramCache]: Analyzing trace with hash 196553618, now seen corresponding path program 2 times [2018-07-24 03:40:53,376 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:53,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-07-24 03:40:53,637 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:53,637 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:53,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 03:40:53,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 03:40:53,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:53,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-07-24 03:40:53,906 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:53,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-07-24 03:40:53,906 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 03:40:53,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 03:40:53,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:53,907 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand 13 states. [2018-07-24 03:40:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:54,123 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2018-07-24 03:40:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 03:40:54,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2018-07-24 03:40:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:54,127 INFO L225 Difference]: With dead ends: 1675 [2018-07-24 03:40:54,127 INFO L226 Difference]: Without dead ends: 1121 [2018-07-24 03:40:54,128 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:40:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-07-24 03:40:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2018-07-24 03:40:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-07-24 03:40:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2018-07-24 03:40:54,153 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2018-07-24 03:40:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2018-07-24 03:40:54,154 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 03:40:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2018-07-24 03:40:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-07-24 03:40:54,156 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:54,156 INFO L353 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] [2018-07-24 03:40:54,156 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash -569825871, now seen corresponding path program 3 times [2018-07-24 03:40:54,156 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:54,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-07-24 03:40:54,709 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:54,709 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:54,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 03:40:54,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-07-24 03:40:54,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:54,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-07-24 03:40:55,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:55,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-07-24 03:40:55,140 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-24 03:40:55,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-24 03:40:55,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-24 03:40:55,141 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand 14 states. [2018-07-24 03:40:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:55,443 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2018-07-24 03:40:55,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 03:40:55,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 257 [2018-07-24 03:40:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:55,447 INFO L225 Difference]: With dead ends: 1287 [2018-07-24 03:40:55,447 INFO L226 Difference]: Without dead ends: 1202 [2018-07-24 03:40:55,447 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-24 03:40:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-07-24 03:40:55,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2018-07-24 03:40:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-07-24 03:40:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2018-07-24 03:40:55,472 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2018-07-24 03:40:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:55,472 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2018-07-24 03:40:55,472 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-24 03:40:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2018-07-24 03:40:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-07-24 03:40:55,474 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:55,474 INFO L353 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] [2018-07-24 03:40:55,474 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash -579696415, now seen corresponding path program 3 times [2018-07-24 03:40:55,475 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:55,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-07-24 03:40:55,959 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:55,959 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:55,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 03:40:56,107 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-24 03:40:56,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:56,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:56,451 WARN L169 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-07-24 03:40:56,796 WARN L169 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 7 [2018-07-24 03:40:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-07-24 03:40:56,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:56,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-07-24 03:40:56,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-24 03:40:56,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-24 03:40:56,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-07-24 03:40:56,924 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand 19 states. [2018-07-24 03:40:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:58,003 INFO L93 Difference]: Finished difference Result 1314 states and 1834 transitions. [2018-07-24 03:40:58,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-24 03:40:58,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2018-07-24 03:40:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:58,008 INFO L225 Difference]: With dead ends: 1314 [2018-07-24 03:40:58,008 INFO L226 Difference]: Without dead ends: 682 [2018-07-24 03:40:58,010 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-07-24 03:40:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-07-24 03:40:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 659. [2018-07-24 03:40:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-07-24 03:40:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2018-07-24 03:40:58,021 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2018-07-24 03:40:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:58,021 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2018-07-24 03:40:58,021 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-24 03:40:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2018-07-24 03:40:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-07-24 03:40:58,023 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:58,024 INFO L353 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] [2018-07-24 03:40:58,024 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash 981783183, now seen corresponding path program 4 times [2018-07-24 03:40:58,024 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:58,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:58,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:40:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 03:40:58,788 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:40:58,788 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:40:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 03:40:59,100 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 03:40:59,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 03:40:59,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:40:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 03:40:59,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:40:59,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-07-24 03:40:59,261 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-24 03:40:59,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-24 03:40:59,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-24 03:40:59,262 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 18 states. [2018-07-24 03:40:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:40:59,700 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2018-07-24 03:40:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-24 03:40:59,700 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 349 [2018-07-24 03:40:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:40:59,705 INFO L225 Difference]: With dead ends: 865 [2018-07-24 03:40:59,705 INFO L226 Difference]: Without dead ends: 780 [2018-07-24 03:40:59,705 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-24 03:40:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-07-24 03:40:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2018-07-24 03:40:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-07-24 03:40:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2018-07-24 03:40:59,721 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2018-07-24 03:40:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:40:59,721 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2018-07-24 03:40:59,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-24 03:40:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2018-07-24 03:40:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-07-24 03:40:59,727 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:40:59,727 INFO L353 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] [2018-07-24 03:40:59,727 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:40:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash -487111266, now seen corresponding path program 5 times [2018-07-24 03:40:59,728 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:40:59,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:40:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:40:59,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 03:40:59,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:41:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-24 03:41:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-24 03:41:01,123 INFO L419 BasicCegarLoop]: Counterexample might be feasible [2018-07-24 03:41:01,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 03:41:01 BoogieIcfgContainer [2018-07-24 03:41:01,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 03:41:01,370 INFO L168 Benchmark]: Toolchain (without parser) took 54126.40 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2018-07-24 03:41:01,371 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 03:41:01,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-24 03:41:01,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 03:41:01,372 INFO L168 Benchmark]: Boogie Preprocessor took 180.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2018-07-24 03:41:01,373 INFO L168 Benchmark]: RCFGBuilder took 1857.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2018-07-24 03:41:01,374 INFO L168 Benchmark]: TraceAbstraction took 51417.16 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 565.7 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -493.8 MB). Peak memory consumption was 71.9 MB. Max. memory is 7.1 GB. [2018-07-24 03:41:01,380 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 599.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 180.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1857.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51417.16 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 565.7 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -493.8 MB). Peak memory consumption was 71.9 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() [L46] COND TRUE 1 [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. UNSAFE Result, 51.3s OverallTime, 40 OverallIterations, 35 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8468 SDtfs, 12147 SDslu, 55543 SDs, 0 SdLazy, 8444 SolverSat, 584 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4433 GetRequests, 4017 SyntacticMatches, 38 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 20.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 356 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 8561 NumberOfCodeBlocks, 8239 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 6689054 SizeOfPredicates, 67 NumberOfNonLiveVariables, 21692 ConjunctsInSsa, 705 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 7790/31839 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_03-41-01-406.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_03-41-01-406.csv Received shutdown request...