./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/token_ring.05_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/token_ring.05_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27d160802d278384ef6d8db395ef2d19702d5645 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:09:01,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:09:01,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:09:01,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:09:01,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:09:01,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:09:01,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:09:01,144 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:09:01,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:09:01,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:09:01,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:09:01,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:09:01,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:09:01,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:09:01,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:09:01,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:09:01,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:09:01,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:09:01,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:09:01,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:09:01,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:09:01,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:09:01,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:09:01,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:09:01,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:09:01,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:09:01,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:09:01,169 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:09:01,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:09:01,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:09:01,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:09:01,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:09:01,173 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:09:01,173 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:09:01,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:09:01,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:09:01,175 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:09:01,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:09:01,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:09:01,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:09:01,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:09:01,194 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:09:01,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:09:01,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:09:01,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:09:01,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:09:01,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:09:01,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:09:01,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:09:01,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:09:01,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:09:01,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:09:01,199 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:09:01,199 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:09:01,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:09:01,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:09:01,199 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:09:01,200 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:09:01,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:09:01,200 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:09:01,200 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:09:01,200 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:09:01,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:09:01,202 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:09:01,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:09:01,203 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27d160802d278384ef6d8db395ef2d19702d5645 [2018-12-31 10:09:01,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:09:01,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:09:01,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:09:01,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:09:01,287 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:09:01,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.05_false-unreach-call_false-termination.cil.c [2018-12-31 10:09:01,350 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe4d14e0/c6115134c7dd4ede953c4e566b6b2281/FLAG28ec4cd3d [2018-12-31 10:09:01,796 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:09:01,797 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.05_false-unreach-call_false-termination.cil.c [2018-12-31 10:09:01,814 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe4d14e0/c6115134c7dd4ede953c4e566b6b2281/FLAG28ec4cd3d [2018-12-31 10:09:02,160 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe4d14e0/c6115134c7dd4ede953c4e566b6b2281 [2018-12-31 10:09:02,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:09:02,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:09:02,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:09:02,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:09:02,171 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:09:02,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19306ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02, skipping insertion in model container [2018-12-31 10:09:02,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:09:02,245 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:09:02,630 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:09:02,644 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:09:02,736 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:09:02,770 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:09:02,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02 WrapperNode [2018-12-31 10:09:02,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:09:02,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:09:02,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:09:02,772 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:09:02,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:09:02,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:09:02,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:09:02,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:09:02,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:02,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:03,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:03,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (1/1) ... [2018-12-31 10:09:03,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:09:03,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:09:03,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:09:03,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:09:03,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (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-12-31 10:09:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:09:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:09:05,920 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:09:05,921 INFO L280 CfgBuilder]: Removed 198 assue(true) statements. [2018-12-31 10:09:05,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:09:05 BoogieIcfgContainer [2018-12-31 10:09:05,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:09:05,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:09:05,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:09:05,928 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:09:05,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:09:02" (1/3) ... [2018-12-31 10:09:05,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be07179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:09:05, skipping insertion in model container [2018-12-31 10:09:05,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:09:02" (2/3) ... [2018-12-31 10:09:05,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be07179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:09:05, skipping insertion in model container [2018-12-31 10:09:05,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:09:05" (3/3) ... [2018-12-31 10:09:05,932 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.05_false-unreach-call_false-termination.cil.c [2018-12-31 10:09:05,943 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:09:05,960 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 10:09:05,980 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 10:09:06,042 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:09:06,043 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:09:06,043 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:09:06,043 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:09:06,044 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:09:06,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:09:06,045 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:09:06,045 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:09:06,045 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:09:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states. [2018-12-31 10:09:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:06,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:06,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:06,127 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:06,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -967631064, now seen corresponding path program 1 times [2018-12-31 10:09:06,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:06,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:06,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:06,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:06,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:06,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:06,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:06,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:06,400 INFO L87 Difference]: Start difference. First operand 540 states. Second operand 3 states. [2018-12-31 10:09:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:06,546 INFO L93 Difference]: Finished difference Result 1075 states and 1663 transitions. [2018-12-31 10:09:06,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:06,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:06,574 INFO L225 Difference]: With dead ends: 1075 [2018-12-31 10:09:06,575 INFO L226 Difference]: Without dead ends: 536 [2018-12-31 10:09:06,586 INFO L631 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-12-31 10:09:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-12-31 10:09:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-12-31 10:09:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-12-31 10:09:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 812 transitions. [2018-12-31 10:09:06,700 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 812 transitions. Word has length 83 [2018-12-31 10:09:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:06,701 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 812 transitions. [2018-12-31 10:09:06,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 812 transitions. [2018-12-31 10:09:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:06,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:06,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:06,706 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1207870810, now seen corresponding path program 1 times [2018-12-31 10:09:06,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:06,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:06,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:06,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:06,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:06,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:06,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:06,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:06,822 INFO L87 Difference]: Start difference. First operand 536 states and 812 transitions. Second operand 3 states. [2018-12-31 10:09:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:07,061 INFO L93 Difference]: Finished difference Result 1480 states and 2236 transitions. [2018-12-31 10:09:07,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:07,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:07,069 INFO L225 Difference]: With dead ends: 1480 [2018-12-31 10:09:07,070 INFO L226 Difference]: Without dead ends: 954 [2018-12-31 10:09:07,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-31 10:09:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 950. [2018-12-31 10:09:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1434 transitions. [2018-12-31 10:09:07,132 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1434 transitions. Word has length 83 [2018-12-31 10:09:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:07,133 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1434 transitions. [2018-12-31 10:09:07,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1434 transitions. [2018-12-31 10:09:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:07,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:07,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:07,139 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:07,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash -258608350, now seen corresponding path program 1 times [2018-12-31 10:09:07,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:07,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:07,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:07,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:07,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:07,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:07,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:07,292 INFO L87 Difference]: Start difference. First operand 950 states and 1434 transitions. Second operand 3 states. [2018-12-31 10:09:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:07,447 INFO L93 Difference]: Finished difference Result 1889 states and 2851 transitions. [2018-12-31 10:09:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:07,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:07,455 INFO L225 Difference]: With dead ends: 1889 [2018-12-31 10:09:07,456 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:07,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1426 transitions. [2018-12-31 10:09:07,508 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1426 transitions. Word has length 83 [2018-12-31 10:09:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:07,509 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1426 transitions. [2018-12-31 10:09:07,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1426 transitions. [2018-12-31 10:09:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:07,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:07,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:07,511 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:07,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2029102298, now seen corresponding path program 1 times [2018-12-31 10:09:07,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:07,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:07,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:07,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:07,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:07,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:07,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:07,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:07,592 INFO L87 Difference]: Start difference. First operand 950 states and 1426 transitions. Second operand 3 states. [2018-12-31 10:09:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:07,748 INFO L93 Difference]: Finished difference Result 1888 states and 2834 transitions. [2018-12-31 10:09:07,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:07,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:07,756 INFO L225 Difference]: With dead ends: 1888 [2018-12-31 10:09:07,756 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:07,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1418 transitions. [2018-12-31 10:09:07,809 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1418 transitions. Word has length 83 [2018-12-31 10:09:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:07,810 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1418 transitions. [2018-12-31 10:09:07,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1418 transitions. [2018-12-31 10:09:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:07,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:07,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:07,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2086215006, now seen corresponding path program 1 times [2018-12-31 10:09:07,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:07,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:07,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:07,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:07,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:07,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:07,904 INFO L87 Difference]: Start difference. First operand 950 states and 1418 transitions. Second operand 3 states. [2018-12-31 10:09:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:08,093 INFO L93 Difference]: Finished difference Result 1886 states and 2815 transitions. [2018-12-31 10:09:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:08,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:08,101 INFO L225 Difference]: With dead ends: 1886 [2018-12-31 10:09:08,102 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:08,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1410 transitions. [2018-12-31 10:09:08,199 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1410 transitions. Word has length 83 [2018-12-31 10:09:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:08,199 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1410 transitions. [2018-12-31 10:09:08,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1410 transitions. [2018-12-31 10:09:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:08,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:08,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:08,205 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 41097502, now seen corresponding path program 1 times [2018-12-31 10:09:08,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:08,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:08,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:08,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:08,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:08,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:08,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:08,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:08,309 INFO L87 Difference]: Start difference. First operand 950 states and 1410 transitions. Second operand 3 states. [2018-12-31 10:09:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:08,477 INFO L93 Difference]: Finished difference Result 1885 states and 2798 transitions. [2018-12-31 10:09:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:08,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:08,483 INFO L225 Difference]: With dead ends: 1885 [2018-12-31 10:09:08,483 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:08,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1402 transitions. [2018-12-31 10:09:08,531 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1402 transitions. Word has length 83 [2018-12-31 10:09:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:08,532 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1402 transitions. [2018-12-31 10:09:08,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1402 transitions. [2018-12-31 10:09:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:08,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:08,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:08,533 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash -451528672, now seen corresponding path program 1 times [2018-12-31 10:09:08,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:08,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:08,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:08,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:08,622 INFO L87 Difference]: Start difference. First operand 950 states and 1402 transitions. Second operand 3 states. [2018-12-31 10:09:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:09,069 INFO L93 Difference]: Finished difference Result 1884 states and 2781 transitions. [2018-12-31 10:09:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:09,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:09,075 INFO L225 Difference]: With dead ends: 1884 [2018-12-31 10:09:09,075 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:09,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1380 transitions. [2018-12-31 10:09:09,128 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1380 transitions. Word has length 83 [2018-12-31 10:09:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:09,128 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1380 transitions. [2018-12-31 10:09:09,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1380 transitions. [2018-12-31 10:09:09,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:09,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:09,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:09,130 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:09,130 INFO L82 PathProgramCache]: Analyzing trace with hash 713295197, now seen corresponding path program 1 times [2018-12-31 10:09:09,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:09,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:09,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:09,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:09,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:09,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:09,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:09,222 INFO L87 Difference]: Start difference. First operand 950 states and 1380 transitions. Second operand 3 states. [2018-12-31 10:09:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:09,657 INFO L93 Difference]: Finished difference Result 1883 states and 2736 transitions. [2018-12-31 10:09:09,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:09,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:09,662 INFO L225 Difference]: With dead ends: 1883 [2018-12-31 10:09:09,663 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:09,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1358 transitions. [2018-12-31 10:09:09,713 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1358 transitions. Word has length 83 [2018-12-31 10:09:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:09,714 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1358 transitions. [2018-12-31 10:09:09,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1358 transitions. [2018-12-31 10:09:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:09,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:09,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:09,715 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:09,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2103165025, now seen corresponding path program 1 times [2018-12-31 10:09:09,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:09,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:09,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:09,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:09,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:09,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:09,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:09,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:09,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:09,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:09,804 INFO L87 Difference]: Start difference. First operand 950 states and 1358 transitions. Second operand 3 states. [2018-12-31 10:09:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:10,222 INFO L93 Difference]: Finished difference Result 1882 states and 2691 transitions. [2018-12-31 10:09:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:10,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:10,227 INFO L225 Difference]: With dead ends: 1882 [2018-12-31 10:09:10,228 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:10,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1336 transitions. [2018-12-31 10:09:10,271 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1336 transitions. Word has length 83 [2018-12-31 10:09:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:10,271 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1336 transitions. [2018-12-31 10:09:10,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1336 transitions. [2018-12-31 10:09:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:10,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:10,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:10,273 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:10,273 INFO L82 PathProgramCache]: Analyzing trace with hash 845256222, now seen corresponding path program 1 times [2018-12-31 10:09:10,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:10,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:10,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:10,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:10,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:10,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:10,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:10,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:10,366 INFO L87 Difference]: Start difference. First operand 950 states and 1336 transitions. Second operand 3 states. [2018-12-31 10:09:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:10,796 INFO L93 Difference]: Finished difference Result 1881 states and 2646 transitions. [2018-12-31 10:09:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:10,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:10,802 INFO L225 Difference]: With dead ends: 1881 [2018-12-31 10:09:10,802 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:10,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1314 transitions. [2018-12-31 10:09:10,852 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1314 transitions. Word has length 83 [2018-12-31 10:09:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:10,852 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1314 transitions. [2018-12-31 10:09:10,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1314 transitions. [2018-12-31 10:09:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:10,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:10,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:10,854 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1865695778, now seen corresponding path program 1 times [2018-12-31 10:09:10,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:10,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:10,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:10,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:10,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:10,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:10,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:10,947 INFO L87 Difference]: Start difference. First operand 950 states and 1314 transitions. Second operand 3 states. [2018-12-31 10:09:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:11,370 INFO L93 Difference]: Finished difference Result 1880 states and 2601 transitions. [2018-12-31 10:09:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:11,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:11,375 INFO L225 Difference]: With dead ends: 1880 [2018-12-31 10:09:11,375 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:11,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1292 transitions. [2018-12-31 10:09:11,417 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1292 transitions. Word has length 83 [2018-12-31 10:09:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:11,417 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1292 transitions. [2018-12-31 10:09:11,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1292 transitions. [2018-12-31 10:09:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:11,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:11,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:11,419 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1915494495, now seen corresponding path program 1 times [2018-12-31 10:09:11,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:11,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:11,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:11,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:11,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:11,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:11,497 INFO L87 Difference]: Start difference. First operand 950 states and 1292 transitions. Second operand 3 states. [2018-12-31 10:09:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:11,664 INFO L93 Difference]: Finished difference Result 1887 states and 2565 transitions. [2018-12-31 10:09:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:11,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:11,670 INFO L225 Difference]: With dead ends: 1887 [2018-12-31 10:09:11,670 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:11,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1284 transitions. [2018-12-31 10:09:11,723 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1284 transitions. Word has length 83 [2018-12-31 10:09:11,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:11,723 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1284 transitions. [2018-12-31 10:09:11,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1284 transitions. [2018-12-31 10:09:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:11,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:11,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:11,725 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash 110056161, now seen corresponding path program 1 times [2018-12-31 10:09:11,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:11,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:11,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:11,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:11,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:11,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:11,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:11,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:11,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:11,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:11,808 INFO L87 Difference]: Start difference. First operand 950 states and 1284 transitions. Second operand 3 states. [2018-12-31 10:09:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:12,080 INFO L93 Difference]: Finished difference Result 1879 states and 2541 transitions. [2018-12-31 10:09:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:12,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:12,086 INFO L225 Difference]: With dead ends: 1879 [2018-12-31 10:09:12,086 INFO L226 Difference]: Without dead ends: 950 [2018-12-31 10:09:12,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-12-31 10:09:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2018-12-31 10:09:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-12-31 10:09:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1262 transitions. [2018-12-31 10:09:12,156 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1262 transitions. Word has length 83 [2018-12-31 10:09:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:12,157 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1262 transitions. [2018-12-31 10:09:12,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1262 transitions. [2018-12-31 10:09:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 10:09:12,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:12,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:12,158 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1169807517, now seen corresponding path program 1 times [2018-12-31 10:09:12,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:12,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:12,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:12,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:12,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:12,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:12,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:12,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:12,244 INFO L87 Difference]: Start difference. First operand 950 states and 1262 transitions. Second operand 3 states. [2018-12-31 10:09:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:12,773 INFO L93 Difference]: Finished difference Result 2718 states and 3617 transitions. [2018-12-31 10:09:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:12,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-31 10:09:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:12,783 INFO L225 Difference]: With dead ends: 2718 [2018-12-31 10:09:12,783 INFO L226 Difference]: Without dead ends: 1791 [2018-12-31 10:09:12,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2018-12-31 10:09:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1711. [2018-12-31 10:09:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2018-12-31 10:09:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2262 transitions. [2018-12-31 10:09:12,863 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2262 transitions. Word has length 83 [2018-12-31 10:09:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:12,863 INFO L480 AbstractCegarLoop]: Abstraction has 1711 states and 2262 transitions. [2018-12-31 10:09:12,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2262 transitions. [2018-12-31 10:09:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-31 10:09:12,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:12,868 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:12,868 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 797868130, now seen corresponding path program 1 times [2018-12-31 10:09:12,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:12,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:13,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:13,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:13,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:13,026 INFO L87 Difference]: Start difference. First operand 1711 states and 2262 transitions. Second operand 5 states. [2018-12-31 10:09:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:13,908 INFO L93 Difference]: Finished difference Result 3853 states and 5137 transitions. [2018-12-31 10:09:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:13,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-12-31 10:09:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:13,919 INFO L225 Difference]: With dead ends: 3853 [2018-12-31 10:09:13,920 INFO L226 Difference]: Without dead ends: 2169 [2018-12-31 10:09:13,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2018-12-31 10:09:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 1717. [2018-12-31 10:09:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2018-12-31 10:09:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2241 transitions. [2018-12-31 10:09:14,020 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2241 transitions. Word has length 135 [2018-12-31 10:09:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:14,020 INFO L480 AbstractCegarLoop]: Abstraction has 1717 states and 2241 transitions. [2018-12-31 10:09:14,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2241 transitions. [2018-12-31 10:09:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-31 10:09:14,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:14,023 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:14,023 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash -256235162, now seen corresponding path program 1 times [2018-12-31 10:09:14,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:14,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:14,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:14,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:14,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:14,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:14,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:14,168 INFO L87 Difference]: Start difference. First operand 1717 states and 2241 transitions. Second operand 5 states. [2018-12-31 10:09:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:14,799 INFO L93 Difference]: Finished difference Result 3936 states and 5175 transitions. [2018-12-31 10:09:14,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:14,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-12-31 10:09:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:14,810 INFO L225 Difference]: With dead ends: 3936 [2018-12-31 10:09:14,810 INFO L226 Difference]: Without dead ends: 2253 [2018-12-31 10:09:14,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:14,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2018-12-31 10:09:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1723. [2018-12-31 10:09:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-12-31 10:09:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2220 transitions. [2018-12-31 10:09:14,936 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2220 transitions. Word has length 135 [2018-12-31 10:09:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:14,937 INFO L480 AbstractCegarLoop]: Abstraction has 1723 states and 2220 transitions. [2018-12-31 10:09:14,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2220 transitions. [2018-12-31 10:09:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-31 10:09:14,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:14,940 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:14,940 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1153628440, now seen corresponding path program 1 times [2018-12-31 10:09:14,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:14,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:14,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:14,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:14,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:15,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:15,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:15,061 INFO L87 Difference]: Start difference. First operand 1723 states and 2220 transitions. Second operand 5 states. [2018-12-31 10:09:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:15,719 INFO L93 Difference]: Finished difference Result 4523 states and 5873 transitions. [2018-12-31 10:09:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:15,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-12-31 10:09:15,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:15,732 INFO L225 Difference]: With dead ends: 4523 [2018-12-31 10:09:15,732 INFO L226 Difference]: Without dead ends: 2841 [2018-12-31 10:09:15,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2018-12-31 10:09:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 1735. [2018-12-31 10:09:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-31 10:09:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2207 transitions. [2018-12-31 10:09:15,855 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2207 transitions. Word has length 135 [2018-12-31 10:09:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:15,855 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2207 transitions. [2018-12-31 10:09:15,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2207 transitions. [2018-12-31 10:09:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-31 10:09:15,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:15,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:15,858 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:15,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:15,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1106974188, now seen corresponding path program 1 times [2018-12-31 10:09:15,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:15,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:15,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:15,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:15,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:15,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:15,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:15,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:15,989 INFO L87 Difference]: Start difference. First operand 1735 states and 2207 transitions. Second operand 5 states. [2018-12-31 10:09:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:16,344 INFO L93 Difference]: Finished difference Result 4678 states and 5995 transitions. [2018-12-31 10:09:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:16,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-12-31 10:09:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:16,358 INFO L225 Difference]: With dead ends: 4678 [2018-12-31 10:09:16,358 INFO L226 Difference]: Without dead ends: 2991 [2018-12-31 10:09:16,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2018-12-31 10:09:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1747. [2018-12-31 10:09:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2018-12-31 10:09:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2194 transitions. [2018-12-31 10:09:16,499 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2194 transitions. Word has length 135 [2018-12-31 10:09:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:16,500 INFO L480 AbstractCegarLoop]: Abstraction has 1747 states and 2194 transitions. [2018-12-31 10:09:16,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2194 transitions. [2018-12-31 10:09:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-31 10:09:16,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:16,502 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:16,502 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash -132007952, now seen corresponding path program 1 times [2018-12-31 10:09:16,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:16,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:16,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:16,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:16,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:16,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:16,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:16,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:16,682 INFO L87 Difference]: Start difference. First operand 1747 states and 2194 transitions. Second operand 5 states. [2018-12-31 10:09:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:17,055 INFO L93 Difference]: Finished difference Result 4952 states and 6274 transitions. [2018-12-31 10:09:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:17,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-12-31 10:09:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:17,069 INFO L225 Difference]: With dead ends: 4952 [2018-12-31 10:09:17,070 INFO L226 Difference]: Without dead ends: 3267 [2018-12-31 10:09:17,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2018-12-31 10:09:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 1759. [2018-12-31 10:09:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2018-12-31 10:09:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2181 transitions. [2018-12-31 10:09:17,225 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2181 transitions. Word has length 135 [2018-12-31 10:09:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:17,225 INFO L480 AbstractCegarLoop]: Abstraction has 1759 states and 2181 transitions. [2018-12-31 10:09:17,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2181 transitions. [2018-12-31 10:09:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-31 10:09:17,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:17,228 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:17,228 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1580711948, now seen corresponding path program 1 times [2018-12-31 10:09:17,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:17,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:17,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:17,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:17,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:17,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:17,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:17,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:17,326 INFO L87 Difference]: Start difference. First operand 1759 states and 2181 transitions. Second operand 3 states. [2018-12-31 10:09:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:17,547 INFO L93 Difference]: Finished difference Result 4879 states and 6029 transitions. [2018-12-31 10:09:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:17,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-12-31 10:09:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:17,560 INFO L225 Difference]: With dead ends: 4879 [2018-12-31 10:09:17,560 INFO L226 Difference]: Without dead ends: 3194 [2018-12-31 10:09:17,565 INFO L631 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-12-31 10:09:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2018-12-31 10:09:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3190. [2018-12-31 10:09:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2018-12-31 10:09:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 3915 transitions. [2018-12-31 10:09:17,771 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 3915 transitions. Word has length 135 [2018-12-31 10:09:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:17,772 INFO L480 AbstractCegarLoop]: Abstraction has 3190 states and 3915 transitions. [2018-12-31 10:09:17,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 3915 transitions. [2018-12-31 10:09:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-31 10:09:17,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:17,775 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:17,775 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:17,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1007923084, now seen corresponding path program 1 times [2018-12-31 10:09:17,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:17,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:17,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:17,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:17,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:17,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:17,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:17,874 INFO L87 Difference]: Start difference. First operand 3190 states and 3915 transitions. Second operand 3 states. [2018-12-31 10:09:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:18,410 INFO L93 Difference]: Finished difference Result 9050 states and 11084 transitions. [2018-12-31 10:09:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:18,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-12-31 10:09:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:18,423 INFO L225 Difference]: With dead ends: 9050 [2018-12-31 10:09:18,423 INFO L226 Difference]: Without dead ends: 5934 [2018-12-31 10:09:18,429 INFO L631 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-12-31 10:09:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2018-12-31 10:09:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 5930. [2018-12-31 10:09:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2018-12-31 10:09:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 7232 transitions. [2018-12-31 10:09:18,994 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 7232 transitions. Word has length 136 [2018-12-31 10:09:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:18,995 INFO L480 AbstractCegarLoop]: Abstraction has 5930 states and 7232 transitions. [2018-12-31 10:09:18,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 7232 transitions. [2018-12-31 10:09:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-31 10:09:19,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:19,000 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:19,000 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash 463050510, now seen corresponding path program 1 times [2018-12-31 10:09:19,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:19,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:19,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:09:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:19,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:19,062 INFO L87 Difference]: Start difference. First operand 5930 states and 7232 transitions. Second operand 3 states. [2018-12-31 10:09:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:19,656 INFO L93 Difference]: Finished difference Result 11718 states and 14302 transitions. [2018-12-31 10:09:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:19,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-12-31 10:09:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:19,669 INFO L225 Difference]: With dead ends: 11718 [2018-12-31 10:09:19,669 INFO L226 Difference]: Without dead ends: 5862 [2018-12-31 10:09:19,677 INFO L631 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-12-31 10:09:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2018-12-31 10:09:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 5862. [2018-12-31 10:09:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5862 states. [2018-12-31 10:09:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 7154 transitions. [2018-12-31 10:09:20,184 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 7154 transitions. Word has length 136 [2018-12-31 10:09:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:20,184 INFO L480 AbstractCegarLoop]: Abstraction has 5862 states and 7154 transitions. [2018-12-31 10:09:20,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 7154 transitions. [2018-12-31 10:09:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-31 10:09:20,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:20,189 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:20,189 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash -622903665, now seen corresponding path program 1 times [2018-12-31 10:09:20,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:20,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:20,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:20,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:20,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:20,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:20,282 INFO L87 Difference]: Start difference. First operand 5862 states and 7154 transitions. Second operand 3 states. [2018-12-31 10:09:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:21,218 INFO L93 Difference]: Finished difference Result 16721 states and 20393 transitions. [2018-12-31 10:09:21,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:21,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-12-31 10:09:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:21,242 INFO L225 Difference]: With dead ends: 16721 [2018-12-31 10:09:21,242 INFO L226 Difference]: Without dead ends: 10933 [2018-12-31 10:09:21,251 INFO L631 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-12-31 10:09:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2018-12-31 10:09:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10929. [2018-12-31 10:09:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10929 states. [2018-12-31 10:09:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10929 states to 10929 states and 13293 transitions. [2018-12-31 10:09:22,109 INFO L78 Accepts]: Start accepts. Automaton has 10929 states and 13293 transitions. Word has length 137 [2018-12-31 10:09:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:22,110 INFO L480 AbstractCegarLoop]: Abstraction has 10929 states and 13293 transitions. [2018-12-31 10:09:22,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 10929 states and 13293 transitions. [2018-12-31 10:09:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-31 10:09:22,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:22,118 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:22,118 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1167776239, now seen corresponding path program 1 times [2018-12-31 10:09:22,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:22,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:22,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:09:22,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:22,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:22,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:22,198 INFO L87 Difference]: Start difference. First operand 10929 states and 13293 transitions. Second operand 3 states. [2018-12-31 10:09:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:23,569 INFO L93 Difference]: Finished difference Result 21717 states and 26427 transitions. [2018-12-31 10:09:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:23,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-12-31 10:09:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:23,604 INFO L225 Difference]: With dead ends: 21717 [2018-12-31 10:09:23,604 INFO L226 Difference]: Without dead ends: 10862 [2018-12-31 10:09:23,620 INFO L631 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-12-31 10:09:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10862 states. [2018-12-31 10:09:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10862 to 10862. [2018-12-31 10:09:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10862 states. [2018-12-31 10:09:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10862 states to 10862 states and 13217 transitions. [2018-12-31 10:09:24,415 INFO L78 Accepts]: Start accepts. Automaton has 10862 states and 13217 transitions. Word has length 137 [2018-12-31 10:09:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:24,415 INFO L480 AbstractCegarLoop]: Abstraction has 10862 states and 13217 transitions. [2018-12-31 10:09:24,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10862 states and 13217 transitions. [2018-12-31 10:09:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-31 10:09:24,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:24,423 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:24,425 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1460610289, now seen corresponding path program 1 times [2018-12-31 10:09:24,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:24,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:24,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:24,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:24,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:24,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:24,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:24,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:24,533 INFO L87 Difference]: Start difference. First operand 10862 states and 13217 transitions. Second operand 3 states. [2018-12-31 10:09:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:26,410 INFO L93 Difference]: Finished difference Result 31292 states and 38062 transitions. [2018-12-31 10:09:26,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:26,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-12-31 10:09:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:26,439 INFO L225 Difference]: With dead ends: 31292 [2018-12-31 10:09:26,439 INFO L226 Difference]: Without dead ends: 20504 [2018-12-31 10:09:26,457 INFO L631 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-12-31 10:09:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20504 states. [2018-12-31 10:09:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20504 to 20084. [2018-12-31 10:09:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20084 states. [2018-12-31 10:09:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 24370 transitions. [2018-12-31 10:09:27,894 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 24370 transitions. Word has length 138 [2018-12-31 10:09:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:27,894 INFO L480 AbstractCegarLoop]: Abstraction has 20084 states and 24370 transitions. [2018-12-31 10:09:27,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 24370 transitions. [2018-12-31 10:09:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-31 10:09:27,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:27,904 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:27,904 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -78955983, now seen corresponding path program 1 times [2018-12-31 10:09:27,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:27,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:27,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:27,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:09:27,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:27,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:27,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:27,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:27,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:27,972 INFO L87 Difference]: Start difference. First operand 20084 states and 24370 transitions. Second operand 3 states. [2018-12-31 10:09:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:29,765 INFO L93 Difference]: Finished difference Result 40047 states and 48604 transitions. [2018-12-31 10:09:29,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:29,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-12-31 10:09:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:29,793 INFO L225 Difference]: With dead ends: 40047 [2018-12-31 10:09:29,793 INFO L226 Difference]: Without dead ends: 20018 [2018-12-31 10:09:29,813 INFO L631 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-12-31 10:09:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20018 states. [2018-12-31 10:09:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20018 to 20018. [2018-12-31 10:09:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20018 states. [2018-12-31 10:09:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20018 states to 20018 states and 24296 transitions. [2018-12-31 10:09:31,655 INFO L78 Accepts]: Start accepts. Automaton has 20018 states and 24296 transitions. Word has length 138 [2018-12-31 10:09:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:31,656 INFO L480 AbstractCegarLoop]: Abstraction has 20018 states and 24296 transitions. [2018-12-31 10:09:31,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 20018 states and 24296 transitions. [2018-12-31 10:09:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-31 10:09:31,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:31,663 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:31,663 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1660502314, now seen corresponding path program 1 times [2018-12-31 10:09:31,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:31,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:31,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:31,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:31,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:31,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:31,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:31,760 INFO L87 Difference]: Start difference. First operand 20018 states and 24296 transitions. Second operand 3 states. [2018-12-31 10:09:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:34,778 INFO L93 Difference]: Finished difference Result 56835 states and 68987 transitions. [2018-12-31 10:09:34,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:34,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-12-31 10:09:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:34,824 INFO L225 Difference]: With dead ends: 56835 [2018-12-31 10:09:34,825 INFO L226 Difference]: Without dead ends: 36891 [2018-12-31 10:09:34,849 INFO L631 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-12-31 10:09:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36891 states. [2018-12-31 10:09:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36891 to 36887. [2018-12-31 10:09:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36887 states. [2018-12-31 10:09:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36887 states to 36887 states and 44695 transitions. [2018-12-31 10:09:37,680 INFO L78 Accepts]: Start accepts. Automaton has 36887 states and 44695 transitions. Word has length 139 [2018-12-31 10:09:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:37,680 INFO L480 AbstractCegarLoop]: Abstraction has 36887 states and 44695 transitions. [2018-12-31 10:09:37,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 36887 states and 44695 transitions. [2018-12-31 10:09:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-31 10:09:37,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:37,694 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:37,694 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1115629740, now seen corresponding path program 1 times [2018-12-31 10:09:37,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:37,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:09:37,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:37,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:37,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:37,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:37,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:37,751 INFO L87 Difference]: Start difference. First operand 36887 states and 44695 transitions. Second operand 3 states. [2018-12-31 10:09:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:40,559 INFO L93 Difference]: Finished difference Result 73635 states and 89237 transitions. [2018-12-31 10:09:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:40,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-12-31 10:09:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:40,603 INFO L225 Difference]: With dead ends: 73635 [2018-12-31 10:09:40,603 INFO L226 Difference]: Without dead ends: 36822 [2018-12-31 10:09:40,637 INFO L631 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-12-31 10:09:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36822 states. [2018-12-31 10:09:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36822 to 36822. [2018-12-31 10:09:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36822 states. [2018-12-31 10:09:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36822 states to 36822 states and 44623 transitions. [2018-12-31 10:09:43,749 INFO L78 Accepts]: Start accepts. Automaton has 36822 states and 44623 transitions. Word has length 139 [2018-12-31 10:09:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:43,749 INFO L480 AbstractCegarLoop]: Abstraction has 36822 states and 44623 transitions. [2018-12-31 10:09:43,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 36822 states and 44623 transitions. [2018-12-31 10:09:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-31 10:09:43,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:43,764 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:43,764 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1562919338, now seen corresponding path program 1 times [2018-12-31 10:09:43,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:43,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:43,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:43,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:43,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:43,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:43,854 INFO L87 Difference]: Start difference. First operand 36822 states and 44623 transitions. Second operand 3 states. [2018-12-31 10:09:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:48,790 INFO L93 Difference]: Finished difference Result 106480 states and 128661 transitions. [2018-12-31 10:09:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:48,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-12-31 10:09:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:48,852 INFO L225 Difference]: With dead ends: 106480 [2018-12-31 10:09:48,852 INFO L226 Difference]: Without dead ends: 53418 [2018-12-31 10:09:48,885 INFO L631 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-12-31 10:09:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53418 states. [2018-12-31 10:09:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53418 to 53418. [2018-12-31 10:09:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53418 states. [2018-12-31 10:09:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53418 states to 53418 states and 64412 transitions. [2018-12-31 10:09:53,092 INFO L78 Accepts]: Start accepts. Automaton has 53418 states and 64412 transitions. Word has length 140 [2018-12-31 10:09:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:53,092 INFO L480 AbstractCegarLoop]: Abstraction has 53418 states and 64412 transitions. [2018-12-31 10:09:53,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 53418 states and 64412 transitions. [2018-12-31 10:09:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-31 10:09:53,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:53,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:09:53,114 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1472853732, now seen corresponding path program 1 times [2018-12-31 10:09:53,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:53,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:53,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:53,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:53,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:53,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:53,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:53,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:53,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:53,221 INFO L87 Difference]: Start difference. First operand 53418 states and 64412 transitions. Second operand 3 states. [2018-12-31 10:09:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:58,508 INFO L93 Difference]: Finished difference Result 123134 states and 148256 transitions. [2018-12-31 10:09:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:58,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-12-31 10:09:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:58,590 INFO L225 Difference]: With dead ends: 123134 [2018-12-31 10:09:58,590 INFO L226 Difference]: Without dead ends: 69773 [2018-12-31 10:09:58,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:09:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69773 states. [2018-12-31 10:10:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69773 to 69581. [2018-12-31 10:10:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69581 states. [2018-12-31 10:10:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69581 states to 69581 states and 83394 transitions. [2018-12-31 10:10:06,380 INFO L78 Accepts]: Start accepts. Automaton has 69581 states and 83394 transitions. Word has length 181 [2018-12-31 10:10:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:06,381 INFO L480 AbstractCegarLoop]: Abstraction has 69581 states and 83394 transitions. [2018-12-31 10:10:06,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 69581 states and 83394 transitions. [2018-12-31 10:10:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-31 10:10:06,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:06,407 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:10:06,408 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 614314275, now seen corresponding path program 1 times [2018-12-31 10:10:06,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 10:10:06,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:06,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:10:06,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:06,507 INFO L87 Difference]: Start difference. First operand 69581 states and 83394 transitions. Second operand 3 states. [2018-12-31 10:10:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:11,674 INFO L93 Difference]: Finished difference Result 138159 states and 165318 transitions. [2018-12-31 10:10:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:11,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-12-31 10:10:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:11,751 INFO L225 Difference]: With dead ends: 138159 [2018-12-31 10:10:11,751 INFO L226 Difference]: Without dead ends: 68651 [2018-12-31 10:10:11,784 INFO L631 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-12-31 10:10:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68651 states. [2018-12-31 10:10:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68651 to 68651. [2018-12-31 10:10:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68651 states. [2018-12-31 10:10:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68651 states to 68651 states and 81362 transitions. [2018-12-31 10:10:16,120 INFO L78 Accepts]: Start accepts. Automaton has 68651 states and 81362 transitions. Word has length 201 [2018-12-31 10:10:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:16,120 INFO L480 AbstractCegarLoop]: Abstraction has 68651 states and 81362 transitions. [2018-12-31 10:10:16,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 68651 states and 81362 transitions. [2018-12-31 10:10:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-31 10:10:16,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:16,147 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:10:16,147 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1781198288, now seen corresponding path program 1 times [2018-12-31 10:10:16,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:16,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:16,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:16,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:16,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:10:16,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:16,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:10:16,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:16,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:16,556 INFO L87 Difference]: Start difference. First operand 68651 states and 81362 transitions. Second operand 3 states. [2018-12-31 10:10:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:21,476 INFO L93 Difference]: Finished difference Result 121255 states and 144068 transitions. [2018-12-31 10:10:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:21,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-12-31 10:10:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:21,574 INFO L225 Difference]: With dead ends: 121255 [2018-12-31 10:10:21,574 INFO L226 Difference]: Without dead ends: 68655 [2018-12-31 10:10:21,630 INFO L631 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-12-31 10:10:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68655 states. [2018-12-31 10:10:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68655 to 68651. [2018-12-31 10:10:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68651 states. [2018-12-31 10:10:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68651 states to 68651 states and 81260 transitions. [2018-12-31 10:10:26,919 INFO L78 Accepts]: Start accepts. Automaton has 68651 states and 81260 transitions. Word has length 202 [2018-12-31 10:10:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:26,920 INFO L480 AbstractCegarLoop]: Abstraction has 68651 states and 81260 transitions. [2018-12-31 10:10:26,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 68651 states and 81260 transitions. [2018-12-31 10:10:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-31 10:10:26,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:26,954 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:10:26,955 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:26,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:26,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1995337667, now seen corresponding path program 1 times [2018-12-31 10:10:26,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:26,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:26,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:26,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:26,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-31 10:10:27,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:10:27,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:27,071 INFO L87 Difference]: Start difference. First operand 68651 states and 81260 transitions. Second operand 3 states. [2018-12-31 10:10:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:33,749 INFO L93 Difference]: Finished difference Result 152007 states and 179689 transitions. [2018-12-31 10:10:33,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:33,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-12-31 10:10:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:33,843 INFO L225 Difference]: With dead ends: 152007 [2018-12-31 10:10:33,843 INFO L226 Difference]: Without dead ends: 83406 [2018-12-31 10:10:33,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:10:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83406 states. [2018-12-31 10:10:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83406 to 83150. [2018-12-31 10:10:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83150 states. [2018-12-31 10:10:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83150 states to 83150 states and 97938 transitions. [2018-12-31 10:10:39,880 INFO L78 Accepts]: Start accepts. Automaton has 83150 states and 97938 transitions. Word has length 243 [2018-12-31 10:10:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:39,881 INFO L480 AbstractCegarLoop]: Abstraction has 83150 states and 97938 transitions. [2018-12-31 10:10:39,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 83150 states and 97938 transitions. [2018-12-31 10:10:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-31 10:10:39,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:39,919 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:10:39,920 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash -92954994, now seen corresponding path program 1 times [2018-12-31 10:10:39,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:39,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:39,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:39,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:39,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:10:40,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:40,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:10:40,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:40,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:40,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:40,045 INFO L87 Difference]: Start difference. First operand 83150 states and 97938 transitions. Second operand 3 states. [2018-12-31 10:10:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:46,591 INFO L93 Difference]: Finished difference Result 151732 states and 179122 transitions. [2018-12-31 10:10:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:46,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-12-31 10:10:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:46,699 INFO L225 Difference]: With dead ends: 151732 [2018-12-31 10:10:46,700 INFO L226 Difference]: Without dead ends: 83154 [2018-12-31 10:10:46,751 INFO L631 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-12-31 10:10:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83154 states. [2018-12-31 10:10:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83154 to 83150. [2018-12-31 10:10:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83150 states. [2018-12-31 10:10:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83150 states to 83150 states and 97792 transitions. [2018-12-31 10:10:53,152 INFO L78 Accepts]: Start accepts. Automaton has 83150 states and 97792 transitions. Word has length 246 [2018-12-31 10:10:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:53,152 INFO L480 AbstractCegarLoop]: Abstraction has 83150 states and 97792 transitions. [2018-12-31 10:10:53,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 83150 states and 97792 transitions. [2018-12-31 10:10:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-31 10:10:53,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:53,188 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:10:53,188 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash -331946524, now seen corresponding path program 1 times [2018-12-31 10:10:53,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:53,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:53,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:10:53,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:53,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:10:53,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:53,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:53,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:53,282 INFO L87 Difference]: Start difference. First operand 83150 states and 97792 transitions. Second operand 3 states. [2018-12-31 10:10:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:59,848 INFO L93 Difference]: Finished difference Result 151856 states and 178956 transitions. [2018-12-31 10:10:59,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:59,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-12-31 10:10:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:59,956 INFO L225 Difference]: With dead ends: 151856 [2018-12-31 10:10:59,956 INFO L226 Difference]: Without dead ends: 83278 [2018-12-31 10:11:00,010 INFO L631 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-12-31 10:11:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83278 states. [2018-12-31 10:11:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83278 to 83150. [2018-12-31 10:11:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83150 states. [2018-12-31 10:11:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83150 states to 83150 states and 96448 transitions. [2018-12-31 10:11:08,586 INFO L78 Accepts]: Start accepts. Automaton has 83150 states and 96448 transitions. Word has length 246 [2018-12-31 10:11:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:08,586 INFO L480 AbstractCegarLoop]: Abstraction has 83150 states and 96448 transitions. [2018-12-31 10:11:08,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 83150 states and 96448 transitions. [2018-12-31 10:11:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-31 10:11:08,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:08,622 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:11:08,622 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1718247822, now seen corresponding path program 1 times [2018-12-31 10:11:08,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:08,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:08,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:08,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:08,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:11:08,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:08,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:11:08,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:11:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:11:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:11:08,899 INFO L87 Difference]: Start difference. First operand 83150 states and 96448 transitions. Second operand 5 states. [2018-12-31 10:11:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:20,169 INFO L93 Difference]: Finished difference Result 213778 states and 249756 transitions. [2018-12-31 10:11:20,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:11:20,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2018-12-31 10:11:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:20,313 INFO L225 Difference]: With dead ends: 213778 [2018-12-31 10:11:20,313 INFO L226 Difference]: Without dead ends: 130682 [2018-12-31 10:11:20,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:11:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130682 states. [2018-12-31 10:11:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130682 to 83534. [2018-12-31 10:11:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83534 states. [2018-12-31 10:11:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83534 states to 83534 states and 95647 transitions. [2018-12-31 10:11:27,823 INFO L78 Accepts]: Start accepts. Automaton has 83534 states and 95647 transitions. Word has length 249 [2018-12-31 10:11:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:27,824 INFO L480 AbstractCegarLoop]: Abstraction has 83534 states and 95647 transitions. [2018-12-31 10:11:27,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:11:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 83534 states and 95647 transitions. [2018-12-31 10:11:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-12-31 10:11:27,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:27,862 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:11:27,862 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash -582486225, now seen corresponding path program 1 times [2018-12-31 10:11:27,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:27,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:27,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-31 10:11:27,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:27,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:11:27,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:27,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:27,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:27,982 INFO L87 Difference]: Start difference. First operand 83534 states and 95647 transitions. Second operand 3 states. [2018-12-31 10:11:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:36,197 INFO L93 Difference]: Finished difference Result 180296 states and 206239 transitions. [2018-12-31 10:11:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:36,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-12-31 10:11:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:36,332 INFO L225 Difference]: With dead ends: 180296 [2018-12-31 10:11:36,332 INFO L226 Difference]: Without dead ends: 96805 [2018-12-31 10:11:36,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:11:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96805 states. [2018-12-31 10:11:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96805 to 96485. [2018-12-31 10:11:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96485 states. [2018-12-31 10:11:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96485 states to 96485 states and 110061 transitions. [2018-12-31 10:11:44,923 INFO L78 Accepts]: Start accepts. Automaton has 96485 states and 110061 transitions. Word has length 289 [2018-12-31 10:11:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:44,923 INFO L480 AbstractCegarLoop]: Abstraction has 96485 states and 110061 transitions. [2018-12-31 10:11:44,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 96485 states and 110061 transitions. [2018-12-31 10:11:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-31 10:11:44,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:44,969 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:11:44,970 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash -423262633, now seen corresponding path program 1 times [2018-12-31 10:11:44,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:44,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:44,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:44,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:44,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:11:45,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:45,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:45,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:45,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:45,111 INFO L87 Difference]: Start difference. First operand 96485 states and 110061 transitions. Second operand 3 states. [2018-12-31 10:11:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:53,855 INFO L93 Difference]: Finished difference Result 179951 states and 205635 transitions. [2018-12-31 10:11:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:53,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-12-31 10:11:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:53,964 INFO L225 Difference]: With dead ends: 179951 [2018-12-31 10:11:53,964 INFO L226 Difference]: Without dead ends: 96489 [2018-12-31 10:11:54,021 INFO L631 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-12-31 10:11:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96489 states. [2018-12-31 10:12:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96489 to 96485. [2018-12-31 10:12:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96485 states. [2018-12-31 10:12:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96485 states to 96485 states and 109853 transitions. [2018-12-31 10:12:05,616 INFO L78 Accepts]: Start accepts. Automaton has 96485 states and 109853 transitions. Word has length 292 [2018-12-31 10:12:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:12:05,616 INFO L480 AbstractCegarLoop]: Abstraction has 96485 states and 109853 transitions. [2018-12-31 10:12:05,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:12:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 96485 states and 109853 transitions. [2018-12-31 10:12:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-12-31 10:12:05,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:12:05,665 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:12:05,665 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:12:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:12:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1162176953, now seen corresponding path program 1 times [2018-12-31 10:12:05,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:12:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:12:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:12:05,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:12:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:12:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:12:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 10:12:05,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:12:05,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:12:05,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:12:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:12:05,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:12:05,814 INFO L87 Difference]: Start difference. First operand 96485 states and 109853 transitions. Second operand 3 states. [2018-12-31 10:12:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:12:14,527 INFO L93 Difference]: Finished difference Result 204741 states and 232803 transitions. [2018-12-31 10:12:14,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:12:14,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2018-12-31 10:12:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:12:14,658 INFO L225 Difference]: With dead ends: 204741 [2018-12-31 10:12:14,658 INFO L226 Difference]: Without dead ends: 108292 [2018-12-31 10:12:14,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:12:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108292 states. [2018-12-31 10:12:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108292 to 107908. [2018-12-31 10:12:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107908 states. [2018-12-31 10:12:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107908 states to 107908 states and 122379 transitions. [2018-12-31 10:12:24,320 INFO L78 Accepts]: Start accepts. Automaton has 107908 states and 122379 transitions. Word has length 334 [2018-12-31 10:12:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:12:24,320 INFO L480 AbstractCegarLoop]: Abstraction has 107908 states and 122379 transitions. [2018-12-31 10:12:24,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:12:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 107908 states and 122379 transitions. [2018-12-31 10:12:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-12-31 10:12:24,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:12:24,369 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:12:24,370 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:12:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:12:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash -978666524, now seen corresponding path program 1 times [2018-12-31 10:12:24,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:12:24,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:12:24,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:12:24,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:12:24,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:12:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:12:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:12:24,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:12:24,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:12:24,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:12:24,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:12:24,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:12:24,526 INFO L87 Difference]: Start difference. First operand 107908 states and 122379 transitions. Second operand 3 states. [2018-12-31 10:12:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:12:34,117 INFO L93 Difference]: Finished difference Result 204326 states and 232161 transitions. [2018-12-31 10:12:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:12:34,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-12-31 10:12:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:12:34,244 INFO L225 Difference]: With dead ends: 204326 [2018-12-31 10:12:34,245 INFO L226 Difference]: Without dead ends: 107912 [2018-12-31 10:12:34,295 INFO L631 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-12-31 10:12:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107912 states. [2018-12-31 10:12:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107912 to 107908. [2018-12-31 10:12:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107908 states. [2018-12-31 10:12:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107908 states to 107908 states and 122067 transitions. [2018-12-31 10:12:43,054 INFO L78 Accepts]: Start accepts. Automaton has 107908 states and 122067 transitions. Word has length 337 [2018-12-31 10:12:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:12:43,055 INFO L480 AbstractCegarLoop]: Abstraction has 107908 states and 122067 transitions. [2018-12-31 10:12:43,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:12:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 107908 states and 122067 transitions. [2018-12-31 10:12:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-12-31 10:12:43,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:12:43,112 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:12:43,112 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:12:43,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:12:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 660132916, now seen corresponding path program 1 times [2018-12-31 10:12:43,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:12:43,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:12:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:12:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:12:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:12:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:12:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:12:43,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:12:43,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:12:43,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:12:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:12:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:12:43,295 INFO L87 Difference]: Start difference. First operand 107908 states and 122067 transitions. Second operand 3 states. [2018-12-31 10:12:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:12:53,867 INFO L93 Difference]: Finished difference Result 226138 states and 255399 transitions. [2018-12-31 10:12:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:12:53,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 379 [2018-12-31 10:12:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:12:54,015 INFO L225 Difference]: With dead ends: 226138 [2018-12-31 10:12:54,016 INFO L226 Difference]: Without dead ends: 118259 [2018-12-31 10:12:54,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-31 10:12:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118259 states. [2018-12-31 10:13:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118259 to 117811. [2018-12-31 10:13:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117811 states. [2018-12-31 10:13:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117811 states to 117811 states and 132721 transitions. [2018-12-31 10:13:04,311 INFO L78 Accepts]: Start accepts. Automaton has 117811 states and 132721 transitions. Word has length 379 [2018-12-31 10:13:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:04,311 INFO L480 AbstractCegarLoop]: Abstraction has 117811 states and 132721 transitions. [2018-12-31 10:13:04,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 117811 states and 132721 transitions. [2018-12-31 10:13:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-12-31 10:13:04,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:04,373 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:04,373 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash 176006994, now seen corresponding path program 1 times [2018-12-31 10:13:04,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:04,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 10:13:04,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:04,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:13:04,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:13:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:13:04,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:04,553 INFO L87 Difference]: Start difference. First operand 117811 states and 132721 transitions. Second operand 3 states. [2018-12-31 10:13:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:08,132 INFO L93 Difference]: Finished difference Result 141218 states and 158629 transitions. [2018-12-31 10:13:08,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:13:08,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2018-12-31 10:13:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:08,153 INFO L225 Difference]: With dead ends: 141218 [2018-12-31 10:13:08,154 INFO L226 Difference]: Without dead ends: 20186 [2018-12-31 10:13:08,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2018-12-31 10:13:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2018-12-31 10:13:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-31 10:13:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21827 transitions. [2018-12-31 10:13:09,599 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21827 transitions. Word has length 382 [2018-12-31 10:13:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:09,599 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 21827 transitions. [2018-12-31 10:13:09,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21827 transitions. [2018-12-31 10:13:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-12-31 10:13:09,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:09,615 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:09,616 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1861356732, now seen corresponding path program 1 times [2018-12-31 10:13:09,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:09,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:13:09,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:09,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:13:09,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:13:09,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:13:09,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:09,775 INFO L87 Difference]: Start difference. First operand 20186 states and 21827 transitions. Second operand 3 states. [2018-12-31 10:13:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:11,383 INFO L93 Difference]: Finished difference Result 33147 states and 35901 transitions. [2018-12-31 10:13:11,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:13:11,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-12-31 10:13:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:11,409 INFO L225 Difference]: With dead ends: 33147 [2018-12-31 10:13:11,409 INFO L226 Difference]: Without dead ends: 20186 [2018-12-31 10:13:11,421 INFO L631 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-12-31 10:13:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2018-12-31 10:13:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2018-12-31 10:13:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-31 10:13:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21675 transitions. [2018-12-31 10:13:14,207 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21675 transitions. Word has length 383 [2018-12-31 10:13:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:14,207 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 21675 transitions. [2018-12-31 10:13:14,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21675 transitions. [2018-12-31 10:13:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-12-31 10:13:14,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:14,230 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:14,230 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 914909407, now seen corresponding path program 1 times [2018-12-31 10:13:14,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:14,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:14,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:13:14,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:14,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:13:14,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:13:14,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:13:14,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:14,379 INFO L87 Difference]: Start difference. First operand 20186 states and 21675 transitions. Second operand 3 states. [2018-12-31 10:13:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:16,067 INFO L93 Difference]: Finished difference Result 31679 states and 34063 transitions. [2018-12-31 10:13:16,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:13:16,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 388 [2018-12-31 10:13:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:16,089 INFO L225 Difference]: With dead ends: 31679 [2018-12-31 10:13:16,089 INFO L226 Difference]: Without dead ends: 20186 [2018-12-31 10:13:16,103 INFO L631 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-12-31 10:13:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2018-12-31 10:13:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2018-12-31 10:13:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-31 10:13:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21535 transitions. [2018-12-31 10:13:17,697 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21535 transitions. Word has length 388 [2018-12-31 10:13:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:17,697 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 21535 transitions. [2018-12-31 10:13:17,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21535 transitions. [2018-12-31 10:13:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-12-31 10:13:17,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:17,714 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:17,714 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash -946028452, now seen corresponding path program 1 times [2018-12-31 10:13:17,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:17,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:17,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:17,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:17,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:13:17,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:17,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:13:17,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:13:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:13:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:17,849 INFO L87 Difference]: Start difference. First operand 20186 states and 21535 transitions. Second operand 3 states. [2018-12-31 10:13:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:19,641 INFO L93 Difference]: Finished difference Result 30560 states and 32647 transitions. [2018-12-31 10:13:19,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:13:19,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2018-12-31 10:13:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:19,663 INFO L225 Difference]: With dead ends: 30560 [2018-12-31 10:13:19,664 INFO L226 Difference]: Without dead ends: 20186 [2018-12-31 10:13:19,676 INFO L631 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-12-31 10:13:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2018-12-31 10:13:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2018-12-31 10:13:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-31 10:13:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21404 transitions. [2018-12-31 10:13:21,286 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21404 transitions. Word has length 393 [2018-12-31 10:13:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:21,286 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 21404 transitions. [2018-12-31 10:13:21,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21404 transitions. [2018-12-31 10:13:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-12-31 10:13:21,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:21,304 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:21,304 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1833719307, now seen corresponding path program 1 times [2018-12-31 10:13:21,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:21,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:21,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:21,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:21,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:13:21,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:21,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:13:21,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:13:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:13:21,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:21,467 INFO L87 Difference]: Start difference. First operand 20186 states and 21404 transitions. Second operand 3 states. [2018-12-31 10:13:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:23,310 INFO L93 Difference]: Finished difference Result 30625 states and 32533 transitions. [2018-12-31 10:13:23,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:13:23,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2018-12-31 10:13:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:23,332 INFO L225 Difference]: With dead ends: 30625 [2018-12-31 10:13:23,332 INFO L226 Difference]: Without dead ends: 20264 [2018-12-31 10:13:23,340 INFO L631 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-12-31 10:13:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20264 states. [2018-12-31 10:13:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20264 to 20186. [2018-12-31 10:13:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-31 10:13:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21272 transitions. [2018-12-31 10:13:24,951 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21272 transitions. Word has length 398 [2018-12-31 10:13:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:24,952 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 21272 transitions. [2018-12-31 10:13:24,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21272 transitions. [2018-12-31 10:13:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-12-31 10:13:24,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:24,968 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:24,969 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1021388863, now seen corresponding path program 1 times [2018-12-31 10:13:24,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:24,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:13:25,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:25,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:13:25,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:13:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:13:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:25,167 INFO L87 Difference]: Start difference. First operand 20186 states and 21272 transitions. Second operand 3 states. [2018-12-31 10:13:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:26,999 INFO L93 Difference]: Finished difference Result 35999 states and 37931 transitions. [2018-12-31 10:13:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:13:26,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2018-12-31 10:13:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:27,022 INFO L225 Difference]: With dead ends: 35999 [2018-12-31 10:13:27,022 INFO L226 Difference]: Without dead ends: 20186 [2018-12-31 10:13:27,037 INFO L631 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-12-31 10:13:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20186 states. [2018-12-31 10:13:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20186 to 20186. [2018-12-31 10:13:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-31 10:13:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21096 transitions. [2018-12-31 10:13:28,843 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21096 transitions. Word has length 402 [2018-12-31 10:13:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:28,844 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 21096 transitions. [2018-12-31 10:13:28,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21096 transitions. [2018-12-31 10:13:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-12-31 10:13:28,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:28,860 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:28,860 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:28,861 INFO L82 PathProgramCache]: Analyzing trace with hash -846459542, now seen corresponding path program 1 times [2018-12-31 10:13:28,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:28,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:28,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:13:29,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:29,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 10:13:29,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 10:13:29,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 10:13:29,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:13:29,401 INFO L87 Difference]: Start difference. First operand 20186 states and 21096 transitions. Second operand 8 states. [2018-12-31 10:13:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:31,261 INFO L93 Difference]: Finished difference Result 20186 states and 21096 transitions. [2018-12-31 10:13:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 10:13:31,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 407 [2018-12-31 10:13:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:31,283 INFO L225 Difference]: With dead ends: 20186 [2018-12-31 10:13:31,283 INFO L226 Difference]: Without dead ends: 20184 [2018-12-31 10:13:31,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:13:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20184 states. [2018-12-31 10:13:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20184 to 20184. [2018-12-31 10:13:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20184 states. [2018-12-31 10:13:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20184 states to 20184 states and 21093 transitions. [2018-12-31 10:13:32,995 INFO L78 Accepts]: Start accepts. Automaton has 20184 states and 21093 transitions. Word has length 407 [2018-12-31 10:13:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 20184 states and 21093 transitions. [2018-12-31 10:13:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 10:13:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20184 states and 21093 transitions. [2018-12-31 10:13:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-12-31 10:13:33,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:33,012 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:33,012 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash -256593416, now seen corresponding path program 1 times [2018-12-31 10:13:33,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:33,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:33,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:13:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-31 10:13:33,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:13:33,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:13:33,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:13:33,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:13:33,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:13:33,195 INFO L87 Difference]: Start difference. First operand 20184 states and 21093 transitions. Second operand 3 states. [2018-12-31 10:13:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:13:35,174 INFO L93 Difference]: Finished difference Result 24560 states and 25612 transitions. [2018-12-31 10:13:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:13:35,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2018-12-31 10:13:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:13:35,206 INFO L225 Difference]: With dead ends: 24560 [2018-12-31 10:13:35,206 INFO L226 Difference]: Without dead ends: 22364 [2018-12-31 10:13:35,217 INFO L631 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-12-31 10:13:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2018-12-31 10:13:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 20186. [2018-12-31 10:13:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20186 states. [2018-12-31 10:13:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 21095 transitions. [2018-12-31 10:13:36,810 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 21095 transitions. Word has length 411 [2018-12-31 10:13:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:13:36,811 INFO L480 AbstractCegarLoop]: Abstraction has 20186 states and 21095 transitions. [2018-12-31 10:13:36,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:13:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 21095 transitions. [2018-12-31 10:13:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-12-31 10:13:36,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:13:36,826 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-31 10:13:36,827 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:13:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:13:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash 398102070, now seen corresponding path program 1 times [2018-12-31 10:13:36,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:13:36,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:13:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:36,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:13:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:13:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:13:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:13:37,175 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 10:13:37,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:13:37 BoogieIcfgContainer [2018-12-31 10:13:37,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:13:37,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:13:37,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:13:37,516 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:13:37,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:09:05" (3/4) ... [2018-12-31 10:13:37,521 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 10:13:37,872 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:13:37,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:13:37,875 INFO L168 Benchmark]: Toolchain (without parser) took 275710.27 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 951.4 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-31 10:13:37,877 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:13:37,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:13:37,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-31 10:13:37,878 INFO L168 Benchmark]: Boogie Preprocessor took 130.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:13:37,878 INFO L168 Benchmark]: RCFGBuilder took 2859.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.2 MB in the end (delta: 113.2 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. [2018-12-31 10:13:37,878 INFO L168 Benchmark]: TraceAbstraction took 271590.30 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 985.2 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-31 10:13:37,882 INFO L168 Benchmark]: Witness Printer took 358.97 ms. Allocated memory is still 5.9 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 78.6 MB). Peak memory consumption was 78.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:13:37,885 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 604.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2859.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.2 MB in the end (delta: 113.2 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 271590.30 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 985.2 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 358.97 ms. Allocated memory is still 5.9 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 78.6 MB). Peak memory consumption was 78.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int t4_pc = 0; [L19] int t5_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int t4_st ; [L25] int t5_st ; [L26] int m_i ; [L27] int t1_i ; [L28] int t2_i ; [L29] int t3_i ; [L30] int t4_i ; [L31] int t5_i ; [L32] int M_E = 2; [L33] int T1_E = 2; [L34] int T2_E = 2; [L35] int T3_E = 2; [L36] int T4_E = 2; [L37] int T5_E = 2; [L38] int E_M = 2; [L39] int E_1 = 2; [L40] int E_2 = 2; [L41] int E_3 = 2; [L42] int E_4 = 2; [L43] int E_5 = 2; [L51] int token ; [L53] int local ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L975] int __retres1 ; [L886] m_i = 1 [L887] t1_i = 1 [L888] t2_i = 1 [L889] t3_i = 1 [L890] t4_i = 1 [L891] t5_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L916] int kernel_st ; [L917] int tmp ; [L918] int tmp___0 ; [L922] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L416] COND TRUE m_i == 1 [L417] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L421] COND TRUE t1_i == 1 [L422] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L426] COND TRUE t2_i == 1 [L427] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L431] COND TRUE t3_i == 1 [L432] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L436] COND TRUE t4_i == 1 [L437] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L441] COND TRUE t5_i == 1 [L442] t5_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L601] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L606] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L611] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L616] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L621] COND FALSE !(T4_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L626] COND FALSE !(T5_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L631] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L636] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L641] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L646] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L651] COND FALSE !(E_4 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L656] COND FALSE !(E_5 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L294] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L313] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L332] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L351] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L370] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L389] COND FALSE !(t5_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L679] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L684] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L689] COND FALSE !(T4_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L694] COND FALSE !(T5_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L699] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L704] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L709] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L714] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L719] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L724] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L930] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L933] kernel_st = 1 [L492] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L496] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L451] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L454] COND TRUE m_st == 0 [L455] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L487] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L499] tmp = exists_runnable_thread() [L501] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L506] COND TRUE m_st == 0 [L507] int tmp_ndt_1; [L508] tmp_ndt_1 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L520] COND TRUE t1_st == 0 [L521] int tmp_ndt_2; [L522] tmp_ndt_2 = __VERIFIER_nondet_int() [L523] COND TRUE \read(tmp_ndt_2) [L525] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L114] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L125] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L127] t1_pc = 1 [L128] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L534] COND TRUE t2_st == 0 [L535] int tmp_ndt_3; [L536] tmp_ndt_3 = __VERIFIER_nondet_int() [L537] COND TRUE \read(tmp_ndt_3) [L539] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L150] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L161] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L163] t2_pc = 1 [L164] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L548] COND TRUE t3_st == 0 [L549] int tmp_ndt_4; [L550] tmp_ndt_4 = __VERIFIER_nondet_int() [L551] COND TRUE \read(tmp_ndt_4) [L553] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L186] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L197] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L199] t3_pc = 1 [L200] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L562] COND TRUE t4_st == 0 [L563] int tmp_ndt_5; [L564] tmp_ndt_5 = __VERIFIER_nondet_int() [L565] COND TRUE \read(tmp_ndt_5) [L567] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L222] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L233] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L235] t4_pc = 1 [L236] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=0, token=0] [L576] COND TRUE t5_st == 0 [L577] int tmp_ndt_6; [L578] tmp_ndt_6 = __VERIFIER_nondet_int() [L579] COND TRUE \read(tmp_ndt_6) [L581] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L258] COND TRUE t5_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L269] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=0, t5_st=1, token=0] [L271] t5_pc = 1 [L272] t5_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L496] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L451] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L454] COND TRUE m_st == 0 [L455] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L487] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L499] tmp = exists_runnable_thread() [L501] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L506] COND TRUE m_st == 0 [L507] int tmp_ndt_1; [L508] tmp_ndt_1 = __VERIFIER_nondet_int() [L509] COND TRUE \read(tmp_ndt_1) [L511] m_st = 1 [L56] int tmp_var = __VERIFIER_nondet_int(); [L58] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L69] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L72] token = __VERIFIER_nondet_int() [L73] local = token [L74] E_1 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L294] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L304] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L306] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L310] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L313] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L314] COND TRUE E_1 == 1 [L315] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L325] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L751] tmp___0 = is_transmit1_triggered() [L753] COND TRUE \read(tmp___0) [L754] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L329] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L332] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L333] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L342] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L344] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L348] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L351] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L352] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L361] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L363] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L367] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L370] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L371] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L380] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L382] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L386] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L389] COND TRUE t5_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L390] COND FALSE !(E_5 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L399] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L401] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L76] E_1 = 2 [L77] m_pc = 1 [L78] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L520] COND TRUE t1_st == 0 [L521] int tmp_ndt_2; [L522] tmp_ndt_2 = __VERIFIER_nondet_int() [L523] COND TRUE \read(tmp_ndt_2) [L525] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L114] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L117] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=0] [L133] token += 1 [L134] E_2 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L304] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L306] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L310] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L323] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L325] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L329] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L333] COND TRUE E_2 == 1 [L334] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L344] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L759] tmp___1 = is_transmit2_triggered() [L761] COND TRUE \read(tmp___1) [L762] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L348] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L361] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L363] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L367] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L380] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L382] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L386] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L399] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L401] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L136] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L125] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L127] t1_pc = 1 [L128] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L534] COND TRUE t2_st == 0 [L535] int tmp_ndt_3; [L536] tmp_ndt_3 = __VERIFIER_nondet_int() [L537] COND TRUE \read(tmp_ndt_3) [L539] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L150] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L153] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=1] [L169] token += 1 [L170] E_3 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L352] COND TRUE E_3 == 1 [L353] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L767] tmp___2 = is_transmit3_triggered() [L769] COND TRUE \read(tmp___2) [L770] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L172] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L161] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L163] t2_pc = 1 [L164] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L548] COND TRUE t3_st == 0 [L549] int tmp_ndt_4; [L550] tmp_ndt_4 = __VERIFIER_nondet_int() [L551] COND TRUE \read(tmp_ndt_4) [L553] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L186] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L189] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=2] [L205] token += 1 [L206] E_4 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L371] COND TRUE E_4 == 1 [L372] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L775] tmp___3 = is_transmit4_triggered() [L777] COND TRUE \read(tmp___3) [L778] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L208] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L197] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L199] t3_pc = 1 [L200] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L562] COND TRUE t4_st == 0 [L563] int tmp_ndt_5; [L564] tmp_ndt_5 = __VERIFIER_nondet_int() [L565] COND TRUE \read(tmp_ndt_5) [L567] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L222] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L225] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=3] [L241] token += 1 [L242] E_5 = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L295] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L304] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L743] tmp = is_master_triggered() [L745] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L390] COND TRUE E_5 == 1 [L391] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=4] [L783] tmp___4 = is_transmit5_triggered() [L785] COND TRUE \read(tmp___4) [L786] t5_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=4] [L244] E_5 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=4] [L233] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=4] [L235] t4_pc = 1 [L236] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=0, token=4] [L576] COND TRUE t5_st == 0 [L577] int tmp_ndt_6; [L578] tmp_ndt_6 = __VERIFIER_nondet_int() [L579] COND TRUE \read(tmp_ndt_6) [L581] t5_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=4] [L258] COND FALSE !(t5_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=4] [L261] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=4] [L277] token += 1 [L278] E_M = 1 [L734] int tmp ; [L735] int tmp___0 ; [L736] int tmp___1 ; [L737] int tmp___2 ; [L738] int tmp___3 ; [L739] int tmp___4 ; [L291] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L294] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L295] COND TRUE E_M == 1 [L296] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L306] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L743] tmp = is_master_triggered() [L745] COND TRUE \read(tmp) [L746] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L310] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L313] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L323] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L325] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L751] tmp___0 = is_transmit1_triggered() [L753] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L332] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L333] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L342] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L344] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L759] tmp___1 = is_transmit2_triggered() [L761] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L348] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L351] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L352] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L361] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L363] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L767] tmp___2 = is_transmit3_triggered() [L769] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L367] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L370] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L371] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L380] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L382] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L775] tmp___3 = is_transmit4_triggered() [L777] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L386] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L389] COND TRUE t5_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L390] COND FALSE !(E_5 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L399] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L401] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L783] tmp___4 = is_transmit5_triggered() [L785] COND FALSE !(\read(tmp___4)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L280] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L269] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=1, token=5] [L271] t5_pc = 1 [L272] t5_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L496] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L451] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L454] COND TRUE m_st == 0 [L455] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L487] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L499] tmp = exists_runnable_thread() [L501] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L506] COND TRUE m_st == 0 [L507] int tmp_ndt_1; [L508] tmp_ndt_1 = __VERIFIER_nondet_int() [L509] COND TRUE \read(tmp_ndt_1) [L511] m_st = 1 [L56] int tmp_var = __VERIFIER_nondet_int(); [L58] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L61] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L83] COND FALSE !(token != local + 5) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L88] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L89] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L94] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L95] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L96] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, T5_E=2, t5_i=1, t5_pc=1, t5_st=2, token=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 540 locations, 2 error locations. UNSAFE Result, 271.4s OverallTime, 50 OverallIterations, 3 TraceHistogramMax, 136.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39010 SDtfs, 34584 SDslu, 28927 SDs, 0 SdLazy, 1041 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117811occurred in iteration=41, 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: 126.3s AutomataMinimizationTime, 49 MinimizatonAttempts, 56508 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 9987 NumberOfCodeBlocks, 9987 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 9526 ConstructedInterpolants, 0 QuantifiedInterpolants, 4457844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 PerfectInterpolantSequences, 984/984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...