./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 518acce2d3c6fcf7f85ccd842b876047f6f96eecf9e5395ea8bbd2907cbf9fc2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:00:22,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:00:22,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:00:22,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:00:22,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:00:22,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:00:22,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:00:22,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:00:22,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:00:22,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:00:22,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:00:22,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:00:22,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:00:22,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:00:22,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:00:22,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:00:22,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:00:22,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:00:22,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:00:22,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:00:22,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:00:22,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:00:22,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:00:22,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:00:22,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:00:22,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:00:22,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:00:22,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:00:22,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:00:22,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:00:22,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:00:22,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:00:22,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:00:22,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:00:22,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:00:22,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:00:22,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:00:22,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:00:22,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:00:22,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:00:22,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:00:22,328 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 23:00:22,370 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:00:22,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:00:22,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:00:22,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:00:22,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:00:22,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:00:22,380 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:00:22,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:00:22,380 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:00:22,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:00:22,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:00:22,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:00:22,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:00:22,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:00:22,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:00:22,383 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:00:22,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:00:22,383 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:00:22,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:00:22,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:00:22,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:00:22,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:00:22,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:00:22,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:00:22,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:00:22,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:00:22,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:00:22,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:00:22,386 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:00:22,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:00:22,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:00:22,388 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:00:22,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD 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(reach_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 -> 518acce2d3c6fcf7f85ccd842b876047f6f96eecf9e5395ea8bbd2907cbf9fc2 [2021-10-28 23:00:22,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:00:22,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:00:22,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:00:22,698 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:00:22,699 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:00:22,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-28 23:00:22,790 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/data/9f73668d3/a33664d314e54fdca61beb2237c41f1f/FLAG34bcecd85 [2021-10-28 23:00:23,247 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:00:23,247 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-28 23:00:23,259 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/data/9f73668d3/a33664d314e54fdca61beb2237c41f1f/FLAG34bcecd85 [2021-10-28 23:00:23,626 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/data/9f73668d3/a33664d314e54fdca61beb2237c41f1f [2021-10-28 23:00:23,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:00:23,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:00:23,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:00:23,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:00:23,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:00:23,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:23,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff8513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23, skipping insertion in model container [2021-10-28 23:00:23,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:23,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:00:23,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:00:23,858 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-28 23:00:23,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:00:23,916 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:00:23,929 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-28 23:00:23,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:00:23,972 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:00:23,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23 WrapperNode [2021-10-28 23:00:23,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:00:23,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:00:23,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:00:23,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:00:23,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:23,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:00:24,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:00:24,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:00:24,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:00:24,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:00:24,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:00:24,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:00:24,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:00:24,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (1/1) ... [2021-10-28 23:00:24,138 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:00:24,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:00:24,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:00:24,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:00:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:00:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:00:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:00:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:00:24,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:00:24,852 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-10-28 23:00:24,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:00:24 BoogieIcfgContainer [2021-10-28 23:00:24,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:00:24,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:00:24,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:00:24,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:00:24,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:00:23" (1/3) ... [2021-10-28 23:00:24,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598397f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:00:24, skipping insertion in model container [2021-10-28 23:00:24,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:00:23" (2/3) ... [2021-10-28 23:00:24,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598397f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:00:24, skipping insertion in model container [2021-10-28 23:00:24,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:00:24" (3/3) ... [2021-10-28 23:00:24,897 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-10-28 23:00:24,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:00:24,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 23:00:24,991 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:00:25,003 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:00:25,003 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 23:00:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.5755395683453237) internal successors, (219), 140 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:00:25,040 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:25,041 INFO L513 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] [2021-10-28 23:00:25,042 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-10-28 23:00:25,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:25,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380778934] [2021-10-28 23:00:25,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:25,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:25,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:25,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380778934] [2021-10-28 23:00:25,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380778934] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:25,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:25,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:00:25,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203211310] [2021-10-28 23:00:25,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:25,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:25,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:25,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:25,293 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.5755395683453237) internal successors, (219), 140 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:25,400 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2021-10-28 23:00:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:00:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:25,424 INFO L225 Difference]: With dead ends: 277 [2021-10-28 23:00:25,425 INFO L226 Difference]: Without dead ends: 137 [2021-10-28 23:00:25,430 INFO L786 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 [2021-10-28 23:00:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-28 23:00:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-28 23:00:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.5073529411764706) internal successors, (205), 136 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2021-10-28 23:00:25,510 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2021-10-28 23:00:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:25,512 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2021-10-28 23:00:25,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2021-10-28 23:00:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:00:25,515 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:25,516 INFO L513 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] [2021-10-28 23:00:25,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:00:25,517 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:25,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-10-28 23:00:25,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:25,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809347523] [2021-10-28 23:00:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:25,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:25,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:25,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809347523] [2021-10-28 23:00:25,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809347523] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:25,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:25,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:00:25,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914389678] [2021-10-28 23:00:25,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:25,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:25,623 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:25,727 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2021-10-28 23:00:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:00:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:25,730 INFO L225 Difference]: With dead ends: 363 [2021-10-28 23:00:25,734 INFO L226 Difference]: Without dead ends: 232 [2021-10-28 23:00:25,735 INFO L786 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 [2021-10-28 23:00:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-28 23:00:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2021-10-28 23:00:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4890829694323144) internal successors, (341), 229 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2021-10-28 23:00:25,787 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2021-10-28 23:00:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:25,788 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2021-10-28 23:00:25,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2021-10-28 23:00:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:00:25,791 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:25,792 INFO L513 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] [2021-10-28 23:00:25,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:00:25,793 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-10-28 23:00:25,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:25,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350100762] [2021-10-28 23:00:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:25,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:25,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:25,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350100762] [2021-10-28 23:00:25,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350100762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:25,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:25,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:00:25,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611907559] [2021-10-28 23:00:25,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:25,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:25,854 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:25,879 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2021-10-28 23:00:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:25,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:00:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:25,882 INFO L225 Difference]: With dead ends: 453 [2021-10-28 23:00:25,882 INFO L226 Difference]: Without dead ends: 230 [2021-10-28 23:00:25,883 INFO L786 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 [2021-10-28 23:00:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-28 23:00:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-28 23:00:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4541484716157205) internal successors, (333), 229 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2021-10-28 23:00:25,972 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2021-10-28 23:00:25,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:25,972 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2021-10-28 23:00:25,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2021-10-28 23:00:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:00:25,974 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:25,975 INFO L513 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] [2021-10-28 23:00:25,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:00:25,975 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2021-10-28 23:00:25,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:25,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244504237] [2021-10-28 23:00:25,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:25,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:26,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:26,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244504237] [2021-10-28 23:00:26,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244504237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:26,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:26,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:00:26,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235336278] [2021-10-28 23:00:26,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:26,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:26,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:26,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:26,055 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:26,106 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2021-10-28 23:00:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:00:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:26,109 INFO L225 Difference]: With dead ends: 452 [2021-10-28 23:00:26,109 INFO L226 Difference]: Without dead ends: 230 [2021-10-28 23:00:26,111 INFO L786 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 [2021-10-28 23:00:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-28 23:00:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-28 23:00:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 229 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2021-10-28 23:00:26,138 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2021-10-28 23:00:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:26,139 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2021-10-28 23:00:26,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2021-10-28 23:00:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:00:26,146 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:26,146 INFO L513 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] [2021-10-28 23:00:26,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:00:26,146 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2021-10-28 23:00:26,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:26,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885974165] [2021-10-28 23:00:26,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:26,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:26,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:26,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885974165] [2021-10-28 23:00:26,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885974165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:26,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:26,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:00:26,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23816232] [2021-10-28 23:00:26,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:00:26,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:00:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:00:26,251 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:26,371 INFO L93 Difference]: Finished difference Result 598 states and 833 transitions. [2021-10-28 23:00:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:00:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:00:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:26,378 INFO L225 Difference]: With dead ends: 598 [2021-10-28 23:00:26,378 INFO L226 Difference]: Without dead ends: 377 [2021-10-28 23:00:26,379 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-28 23:00:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 230. [2021-10-28 23:00:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 229 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 316 transitions. [2021-10-28 23:00:26,399 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 316 transitions. Word has length 39 [2021-10-28 23:00:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:26,399 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 316 transitions. [2021-10-28 23:00:26,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 316 transitions. [2021-10-28 23:00:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:00:26,402 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:26,402 INFO L513 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] [2021-10-28 23:00:26,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:00:26,403 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash -50403306, now seen corresponding path program 1 times [2021-10-28 23:00:26,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:26,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847455796] [2021-10-28 23:00:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:26,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:26,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:26,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847455796] [2021-10-28 23:00:26,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847455796] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:26,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:26,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:00:26,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287615454] [2021-10-28 23:00:26,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:00:26,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:26,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:00:26,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:00:26,488 INFO L87 Difference]: Start difference. First operand 230 states and 316 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:26,619 INFO L93 Difference]: Finished difference Result 784 states and 1078 transitions. [2021-10-28 23:00:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:00:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:00:26,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:26,634 INFO L225 Difference]: With dead ends: 784 [2021-10-28 23:00:26,635 INFO L226 Difference]: Without dead ends: 565 [2021-10-28 23:00:26,635 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-28 23:00:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 519. [2021-10-28 23:00:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.3494208494208495) internal successors, (699), 518 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 699 transitions. [2021-10-28 23:00:26,682 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 699 transitions. Word has length 39 [2021-10-28 23:00:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:26,683 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 699 transitions. [2021-10-28 23:00:26,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 699 transitions. [2021-10-28 23:00:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 23:00:26,684 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:26,684 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 23:00:26,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:00:26,685 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 23055374, now seen corresponding path program 1 times [2021-10-28 23:00:26,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:26,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091390168] [2021-10-28 23:00:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:26,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-28 23:00:26,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:26,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091390168] [2021-10-28 23:00:26,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091390168] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:26,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:26,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:00:26,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122368544] [2021-10-28 23:00:26,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:00:26,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:26,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:00:26,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:26,750 INFO L87 Difference]: Start difference. First operand 519 states and 699 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:26,905 INFO L93 Difference]: Finished difference Result 1311 states and 1775 transitions. [2021-10-28 23:00:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:00:26,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-28 23:00:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:26,910 INFO L225 Difference]: With dead ends: 1311 [2021-10-28 23:00:26,911 INFO L226 Difference]: Without dead ends: 813 [2021-10-28 23:00:26,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:00:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-10-28 23:00:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 540. [2021-10-28 23:00:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.3191094619666048) internal successors, (711), 539 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 711 transitions. [2021-10-28 23:00:26,967 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 711 transitions. Word has length 51 [2021-10-28 23:00:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:26,967 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 711 transitions. [2021-10-28 23:00:26,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 711 transitions. [2021-10-28 23:00:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 23:00:26,969 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:26,969 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 23:00:26,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:00:26,970 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash 724655248, now seen corresponding path program 1 times [2021-10-28 23:00:26,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:26,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53184659] [2021-10-28 23:00:26,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:26,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:27,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:27,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53184659] [2021-10-28 23:00:27,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53184659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:27,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:27,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:00:27,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630047183] [2021-10-28 23:00:27,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:27,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:27,057 INFO L87 Difference]: Start difference. First operand 540 states and 711 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:27,177 INFO L93 Difference]: Finished difference Result 1511 states and 1975 transitions. [2021-10-28 23:00:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-28 23:00:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:27,185 INFO L225 Difference]: With dead ends: 1511 [2021-10-28 23:00:27,185 INFO L226 Difference]: Without dead ends: 996 [2021-10-28 23:00:27,186 INFO L786 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 [2021-10-28 23:00:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-10-28 23:00:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 960. [2021-10-28 23:00:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.278415015641293) internal successors, (1226), 959 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1226 transitions. [2021-10-28 23:00:27,278 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1226 transitions. Word has length 51 [2021-10-28 23:00:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:27,278 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1226 transitions. [2021-10-28 23:00:27,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1226 transitions. [2021-10-28 23:00:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 23:00:27,281 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:27,281 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 23:00:27,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:00:27,281 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:27,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 171160657, now seen corresponding path program 1 times [2021-10-28 23:00:27,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:27,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737533389] [2021-10-28 23:00:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:27,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 23:00:27,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:27,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737533389] [2021-10-28 23:00:27,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737533389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:27,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:27,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:00:27,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293370845] [2021-10-28 23:00:27,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:27,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:27,363 INFO L87 Difference]: Start difference. First operand 960 states and 1226 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:27,520 INFO L93 Difference]: Finished difference Result 2284 states and 2945 transitions. [2021-10-28 23:00:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-28 23:00:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:27,532 INFO L225 Difference]: With dead ends: 2284 [2021-10-28 23:00:27,532 INFO L226 Difference]: Without dead ends: 1602 [2021-10-28 23:00:27,533 INFO L786 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 [2021-10-28 23:00:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-10-28 23:00:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1312. [2021-10-28 23:00:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 1.2799389778794814) internal successors, (1678), 1311 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1678 transitions. [2021-10-28 23:00:27,655 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1678 transitions. Word has length 52 [2021-10-28 23:00:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:27,656 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 1678 transitions. [2021-10-28 23:00:27,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1678 transitions. [2021-10-28 23:00:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 23:00:27,657 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:27,657 INFO L513 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] [2021-10-28 23:00:27,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:00:27,658 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:27,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 313852773, now seen corresponding path program 1 times [2021-10-28 23:00:27,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:27,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145609807] [2021-10-28 23:00:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:27,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:27,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:27,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145609807] [2021-10-28 23:00:27,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145609807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:27,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:27,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:00:27,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463794018] [2021-10-28 23:00:27,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:00:27,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:27,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:00:27,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:27,738 INFO L87 Difference]: Start difference. First operand 1312 states and 1678 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:27,943 INFO L93 Difference]: Finished difference Result 2538 states and 3250 transitions. [2021-10-28 23:00:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:00:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-28 23:00:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:27,952 INFO L225 Difference]: With dead ends: 2538 [2021-10-28 23:00:27,953 INFO L226 Difference]: Without dead ends: 1554 [2021-10-28 23:00:27,955 INFO L786 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 [2021-10-28 23:00:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-10-28 23:00:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1324. [2021-10-28 23:00:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.251700680272109) internal successors, (1656), 1323 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1656 transitions. [2021-10-28 23:00:28,083 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1656 transitions. Word has length 63 [2021-10-28 23:00:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:28,083 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1656 transitions. [2021-10-28 23:00:28,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1656 transitions. [2021-10-28 23:00:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 23:00:28,085 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:28,085 INFO L513 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] [2021-10-28 23:00:28,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:00:28,086 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash 736554599, now seen corresponding path program 1 times [2021-10-28 23:00:28,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:28,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039484164] [2021-10-28 23:00:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:28,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:28,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:28,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039484164] [2021-10-28 23:00:28,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039484164] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:28,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:28,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:00:28,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772793836] [2021-10-28 23:00:28,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:28,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:28,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:28,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:28,148 INFO L87 Difference]: Start difference. First operand 1324 states and 1656 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:28,369 INFO L93 Difference]: Finished difference Result 3688 states and 4602 transitions. [2021-10-28 23:00:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-28 23:00:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:28,385 INFO L225 Difference]: With dead ends: 3688 [2021-10-28 23:00:28,385 INFO L226 Difference]: Without dead ends: 2410 [2021-10-28 23:00:28,390 INFO L786 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 [2021-10-28 23:00:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-10-28 23:00:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2384. [2021-10-28 23:00:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2383 states have (on average 1.229542593369702) internal successors, (2930), 2383 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2930 transitions. [2021-10-28 23:00:28,598 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2930 transitions. Word has length 63 [2021-10-28 23:00:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:28,599 INFO L470 AbstractCegarLoop]: Abstraction has 2384 states and 2930 transitions. [2021-10-28 23:00:28,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2930 transitions. [2021-10-28 23:00:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 23:00:28,601 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:28,601 INFO L513 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] [2021-10-28 23:00:28,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:00:28,601 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1397696040, now seen corresponding path program 1 times [2021-10-28 23:00:28,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:28,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809780800] [2021-10-28 23:00:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:28,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:28,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:28,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809780800] [2021-10-28 23:00:28,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809780800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:28,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:28,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:00:28,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246690163] [2021-10-28 23:00:28,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:00:28,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:28,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:00:28,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:00:28,658 INFO L87 Difference]: Start difference. First operand 2384 states and 2930 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:28,939 INFO L93 Difference]: Finished difference Result 4188 states and 5143 transitions. [2021-10-28 23:00:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:00:28,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-28 23:00:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:28,951 INFO L225 Difference]: With dead ends: 4188 [2021-10-28 23:00:28,952 INFO L226 Difference]: Without dead ends: 1829 [2021-10-28 23:00:28,955 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2021-10-28 23:00:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2021-10-28 23:00:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.2073304157549234) internal successors, (2207), 1828 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2207 transitions. [2021-10-28 23:00:29,130 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2207 transitions. Word has length 64 [2021-10-28 23:00:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:29,131 INFO L470 AbstractCegarLoop]: Abstraction has 1829 states and 2207 transitions. [2021-10-28 23:00:29,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2207 transitions. [2021-10-28 23:00:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 23:00:29,139 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:29,140 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:00:29,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:00:29,140 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:29,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1733249900, now seen corresponding path program 1 times [2021-10-28 23:00:29,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:29,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574868137] [2021-10-28 23:00:29,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:29,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 23:00:29,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:29,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574868137] [2021-10-28 23:00:29,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574868137] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:29,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:29,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:00:29,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288699005] [2021-10-28 23:00:29,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:00:29,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:00:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:00:29,195 INFO L87 Difference]: Start difference. First operand 1829 states and 2207 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:29,405 INFO L93 Difference]: Finished difference Result 3653 states and 4407 transitions. [2021-10-28 23:00:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:00:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 23:00:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:29,414 INFO L225 Difference]: With dead ends: 3653 [2021-10-28 23:00:29,414 INFO L226 Difference]: Without dead ends: 1582 [2021-10-28 23:00:29,417 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2021-10-28 23:00:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1559. [2021-10-28 23:00:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.1976893453145059) internal successors, (1866), 1558 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1866 transitions. [2021-10-28 23:00:29,551 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1866 transitions. Word has length 94 [2021-10-28 23:00:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:29,552 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1866 transitions. [2021-10-28 23:00:29,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1866 transitions. [2021-10-28 23:00:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 23:00:29,554 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:29,554 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-10-28 23:00:29,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 23:00:29,555 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash -41173677, now seen corresponding path program 1 times [2021-10-28 23:00:29,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:29,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086543686] [2021-10-28 23:00:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:29,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 23:00:29,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:29,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086543686] [2021-10-28 23:00:29,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086543686] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:29,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:29,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:00:29,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042960647] [2021-10-28 23:00:29,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:00:29,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:29,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:00:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:00:29,600 INFO L87 Difference]: Start difference. First operand 1559 states and 1866 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:29,783 INFO L93 Difference]: Finished difference Result 2548 states and 3026 transitions. [2021-10-28 23:00:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:00:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 23:00:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:29,789 INFO L225 Difference]: With dead ends: 2548 [2021-10-28 23:00:29,789 INFO L226 Difference]: Without dead ends: 699 [2021-10-28 23:00:29,792 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-28 23:00:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-10-28 23:00:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.1131805157593124) internal successors, (777), 698 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 777 transitions. [2021-10-28 23:00:29,869 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 777 transitions. Word has length 94 [2021-10-28 23:00:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:29,870 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 777 transitions. [2021-10-28 23:00:29,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 777 transitions. [2021-10-28 23:00:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 23:00:29,872 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:29,872 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-10-28 23:00:29,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:00:29,873 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash -400908240, now seen corresponding path program 1 times [2021-10-28 23:00:29,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:29,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687312962] [2021-10-28 23:00:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:29,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:29,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:29,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687312962] [2021-10-28 23:00:29,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687312962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:29,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:29,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:00:29,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184175463] [2021-10-28 23:00:29,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:00:29,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:00:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:00:29,916 INFO L87 Difference]: Start difference. First operand 699 states and 777 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:29,999 INFO L93 Difference]: Finished difference Result 1019 states and 1137 transitions. [2021-10-28 23:00:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:00:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 23:00:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:30,004 INFO L225 Difference]: With dead ends: 1019 [2021-10-28 23:00:30,005 INFO L226 Difference]: Without dead ends: 582 [2021-10-28 23:00:30,006 INFO L786 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 [2021-10-28 23:00:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-28 23:00:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2021-10-28 23:00:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.1032702237521514) internal successors, (641), 581 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2021-10-28 23:00:30,073 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 94 [2021-10-28 23:00:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:30,073 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2021-10-28 23:00:30,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2021-10-28 23:00:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 23:00:30,076 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:30,076 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-10-28 23:00:30,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:00:30,076 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2021-10-28 23:00:30,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:30,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126368358] [2021-10-28 23:00:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:30,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 23:00:30,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:30,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126368358] [2021-10-28 23:00:30,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126368358] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:30,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:30,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:00:30,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778179268] [2021-10-28 23:00:30,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:00:30,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:00:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:00:30,163 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:30,272 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2021-10-28 23:00:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:00:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-10-28 23:00:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:30,274 INFO L225 Difference]: With dead ends: 586 [2021-10-28 23:00:30,274 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 23:00:30,275 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:00:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 23:00:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 23:00:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 23:00:30,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-10-28 23:00:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:30,277 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 23:00:30,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 23:00:30,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 23:00:30,281 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:00:30,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:00:30,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 23:00:30,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:30,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:30,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:30,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:30,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:30,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:30,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:30,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:31,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:32,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:00:44,239 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,240 INFO L857 garLoopResultBuilder]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,240 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 44) no Hoare annotation was computed. [2021-10-28 23:00:44,240 INFO L857 garLoopResultBuilder]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,240 INFO L857 garLoopResultBuilder]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,240 INFO L857 garLoopResultBuilder]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,241 INFO L857 garLoopResultBuilder]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,241 INFO L857 garLoopResultBuilder]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,241 INFO L857 garLoopResultBuilder]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,241 INFO L857 garLoopResultBuilder]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,241 INFO L857 garLoopResultBuilder]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2021-10-28 23:00:44,241 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 141) no Hoare annotation was computed. [2021-10-28 23:00:44,242 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2021-10-28 23:00:44,242 INFO L857 garLoopResultBuilder]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2021-10-28 23:00:44,242 INFO L857 garLoopResultBuilder]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2021-10-28 23:00:44,242 INFO L857 garLoopResultBuilder]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2021-10-28 23:00:44,243 INFO L853 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,243 INFO L857 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2021-10-28 23:00:44,243 INFO L853 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,243 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-10-28 23:00:44,244 INFO L853 garLoopResultBuilder]: At program point L40(lines 35 74) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~t1_i~0 1) (<= ~token~0 (+ ~local~0 1)) (<= 2 ~T1_E~0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~E_M~0 2) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2021-10-28 23:00:44,244 INFO L857 garLoopResultBuilder]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-10-28 23:00:44,244 INFO L857 garLoopResultBuilder]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2021-10-28 23:00:44,244 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 448) no Hoare annotation was computed. [2021-10-28 23:00:44,245 INFO L853 garLoopResultBuilder]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,245 INFO L853 garLoopResultBuilder]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,245 INFO L853 garLoopResultBuilder]: At program point L473(lines 464 475) the Hoare annotation is: (= ~t1_i~0 1) [2021-10-28 23:00:44,245 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-28 23:00:44,245 INFO L857 garLoopResultBuilder]: For program point L311(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,246 INFO L857 garLoopResultBuilder]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,246 INFO L857 garLoopResultBuilder]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,246 INFO L853 garLoopResultBuilder]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,246 INFO L853 garLoopResultBuilder]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)))) [2021-10-28 23:00:44,247 INFO L857 garLoopResultBuilder]: For program point L311-5(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,247 INFO L853 garLoopResultBuilder]: At program point L146-1(lines 134 148) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~E_1~0 1)) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 (not .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-28 23:00:44,247 INFO L857 garLoopResultBuilder]: For program point L311-6(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,247 INFO L857 garLoopResultBuilder]: For program point L80(lines 80 88) no Hoare annotation was computed. [2021-10-28 23:00:44,248 INFO L853 garLoopResultBuilder]: At program point L146-2(lines 134 148) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 0))) (let ((.cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (not .cse6)) (.cse7 (not (= ~E_1~0 1))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (not (= ~t1_st~0 0)))) (or (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 (= ~m_pc~0 0) .cse4) (and (= ~t1_pc~0 1) .cse5 .cse0 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse7 .cse3 .cse8 (< ~local~0 ~token~0)) (and .cse5 .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse8)))) [2021-10-28 23:00:44,248 INFO L857 garLoopResultBuilder]: For program point L311-8(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,248 INFO L853 garLoopResultBuilder]: At program point L146-3(lines 134 148) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~m_st~0 0))) (.cse3 (not .cse14)) (.cse7 (= ~m_pc~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse14 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse12 .cse6 .cse8 .cse9 .cse10 (< ~local~0 ~token~0))))) [2021-10-28 23:00:44,248 INFO L857 garLoopResultBuilder]: For program point L311-9(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,249 INFO L853 garLoopResultBuilder]: At program point L146-4(lines 134 148) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~m_st~0 0))) (.cse3 (not .cse14)) (.cse7 (= ~m_pc~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse14 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse12 .cse6 .cse8 .cse9 .cse10 (< ~local~0 ~token~0))))) [2021-10-28 23:00:44,249 INFO L857 garLoopResultBuilder]: For program point L311-11(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,249 INFO L857 garLoopResultBuilder]: For program point L311-12(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,249 INFO L857 garLoopResultBuilder]: For program point L311-14(lines 311 315) no Hoare annotation was computed. [2021-10-28 23:00:44,249 INFO L853 garLoopResultBuilder]: At program point L345(lines 339 347) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,250 INFO L857 garLoopResultBuilder]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2021-10-28 23:00:44,250 INFO L857 garLoopResultBuilder]: For program point L180(lines 180 190) no Hoare annotation was computed. [2021-10-28 23:00:44,250 INFO L857 garLoopResultBuilder]: For program point L279-3(lines 278 301) no Hoare annotation was computed. [2021-10-28 23:00:44,250 INFO L853 garLoopResultBuilder]: At program point L147(lines 131 149) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~m_st~0 0)) .cse10 .cse11 .cse12))) [2021-10-28 23:00:44,250 INFO L857 garLoopResultBuilder]: For program point L180-1(lines 180 190) no Hoare annotation was computed. [2021-10-28 23:00:44,251 INFO L853 garLoopResultBuilder]: At program point L147-1(lines 131 149) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0)) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (not (= ~E_1~0 1)) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse2 (not .cse0) .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8))) [2021-10-28 23:00:44,251 INFO L857 garLoopResultBuilder]: For program point L180-2(lines 180 190) no Hoare annotation was computed. [2021-10-28 23:00:44,251 INFO L853 garLoopResultBuilder]: At program point L147-2(lines 131 149) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse2)) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse7 (not (= ~t1_st~0 0)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0)) (and .cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse8 .cse6 (= ~m_pc~0 0) .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5 .cse6 .cse9 .cse7)))) [2021-10-28 23:00:44,251 INFO L857 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2021-10-28 23:00:44,252 INFO L853 garLoopResultBuilder]: At program point L147-3(lines 131 149) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~t1_st~0 0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (not .cse15)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ~E_M~0 2)) (.cse12 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse8 .cse9 .cse10) (and .cse15 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12)))) [2021-10-28 23:00:44,252 INFO L853 garLoopResultBuilder]: At program point L147-4(lines 131 149) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~t1_st~0 0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (not .cse15)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ~E_M~0 2)) (.cse12 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse8 .cse9 .cse10) (and .cse15 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12)))) [2021-10-28 23:00:44,252 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 222) no Hoare annotation was computed. [2021-10-28 23:00:44,252 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,253 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-10-28 23:00:44,253 INFO L857 garLoopResultBuilder]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,253 INFO L857 garLoopResultBuilder]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,253 INFO L857 garLoopResultBuilder]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,253 INFO L857 garLoopResultBuilder]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,253 INFO L857 garLoopResultBuilder]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,254 INFO L857 garLoopResultBuilder]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,254 INFO L857 garLoopResultBuilder]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,254 INFO L857 garLoopResultBuilder]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,254 INFO L857 garLoopResultBuilder]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2021-10-28 23:00:44,254 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 122) no Hoare annotation was computed. [2021-10-28 23:00:44,254 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2021-10-28 23:00:44,255 INFO L853 garLoopResultBuilder]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse5 (= ~E_M~0 2))) (or (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 (= ~m_pc~0 0) .cse4 .cse5) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (not (= ~E_1~0 1)) .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2021-10-28 23:00:44,255 INFO L857 garLoopResultBuilder]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2021-10-28 23:00:44,255 INFO L857 garLoopResultBuilder]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2021-10-28 23:00:44,255 INFO L857 garLoopResultBuilder]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2021-10-28 23:00:44,255 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 189) no Hoare annotation was computed. [2021-10-28 23:00:44,255 INFO L857 garLoopResultBuilder]: For program point L184-1(lines 184 189) no Hoare annotation was computed. [2021-10-28 23:00:44,255 INFO L857 garLoopResultBuilder]: For program point L184-2(lines 184 189) no Hoare annotation was computed. [2021-10-28 23:00:44,256 INFO L853 garLoopResultBuilder]: At program point L383(lines 376 385) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (<= 2 ~M_E~0) (= ~E_M~0 ~E_1~0) (<= 2 ~T1_E~0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0)) [2021-10-28 23:00:44,256 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 23:00:44,256 INFO L857 garLoopResultBuilder]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2021-10-28 23:00:44,256 INFO L857 garLoopResultBuilder]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2021-10-28 23:00:44,256 INFO L857 garLoopResultBuilder]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2021-10-28 23:00:44,257 INFO L857 garLoopResultBuilder]: For program point L284-3(lines 278 301) no Hoare annotation was computed. [2021-10-28 23:00:44,257 INFO L857 garLoopResultBuilder]: For program point L251-4(lines 250 273) no Hoare annotation was computed. [2021-10-28 23:00:44,257 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-10-28 23:00:44,257 INFO L857 garLoopResultBuilder]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2021-10-28 23:00:44,257 INFO L853 garLoopResultBuilder]: At program point L319-2(lines 279 283) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)))) [2021-10-28 23:00:44,257 INFO L857 garLoopResultBuilder]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2021-10-28 23:00:44,258 INFO L853 garLoopResultBuilder]: At program point L319-5(lines 1 475) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0)) (and (= ULTIMATE.start_activate_threads_~tmp___0~0 0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 .cse2 (not .cse0) .cse3 .cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0))))) [2021-10-28 23:00:44,258 INFO L857 garLoopResultBuilder]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2021-10-28 23:00:44,258 INFO L853 garLoopResultBuilder]: At program point L319-8(lines 1 475) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (not .cse5)) (.cse6 (not (= ~E_1~0 1))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (or (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 (= ~m_pc~0 0) .cse4) (and (= ~t1_pc~0 1) .cse0 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse6 .cse3 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse6 .cse3 .cse4)))) [2021-10-28 23:00:44,258 INFO L857 garLoopResultBuilder]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2021-10-28 23:00:44,259 INFO L853 garLoopResultBuilder]: At program point L319-11(lines 279 283) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,259 INFO L857 garLoopResultBuilder]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2021-10-28 23:00:44,259 INFO L853 garLoopResultBuilder]: At program point L319-14(lines 352 356) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,259 INFO L857 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2021-10-28 23:00:44,259 INFO L853 garLoopResultBuilder]: At program point L155(lines 162 166) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (<= 2 ~M_E~0) (= ~E_M~0 ~E_1~0) (<= 2 ~T1_E~0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0)) [2021-10-28 23:00:44,260 INFO L853 garLoopResultBuilder]: At program point L155-1(lines 150 157) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,260 INFO L853 garLoopResultBuilder]: At program point L420-1(lines 275 457) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,260 INFO L857 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-10-28 23:00:44,260 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 23:00:44,260 INFO L857 garLoopResultBuilder]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2021-10-28 23:00:44,261 INFO L857 garLoopResultBuilder]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2021-10-28 23:00:44,261 INFO L857 garLoopResultBuilder]: For program point L289-3(lines 278 301) no Hoare annotation was computed. [2021-10-28 23:00:44,261 INFO L857 garLoopResultBuilder]: For program point L256-3(lines 250 273) no Hoare annotation was computed. [2021-10-28 23:00:44,261 INFO L853 garLoopResultBuilder]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse0 (= ~t1_i~0 1)) (.cse2 (<= 2 ~T1_E~0)) (.cse9 (not .cse10)) (.cse4 (not (= ~E_1~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8) (and (= ~t1_pc~0 1) .cse0 .cse10 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse4 .cse5 .cse8 (< ~local~0 ~token~0)) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse7 .cse8)))) [2021-10-28 23:00:44,261 INFO L857 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2021-10-28 23:00:44,262 INFO L857 garLoopResultBuilder]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2021-10-28 23:00:44,262 INFO L853 garLoopResultBuilder]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,262 INFO L853 garLoopResultBuilder]: At program point L192-1(lines 179 194) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,262 INFO L853 garLoopResultBuilder]: At program point L192-2(lines 179 194) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,263 INFO L853 garLoopResultBuilder]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,263 INFO L853 garLoopResultBuilder]: At program point L193(lines 176 195) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,263 INFO L853 garLoopResultBuilder]: At program point L193-1(lines 176 195) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,264 INFO L853 garLoopResultBuilder]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 2 ~M_E~0)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8))) [2021-10-28 23:00:44,264 INFO L853 garLoopResultBuilder]: At program point L193-2(lines 176 195) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,264 INFO L853 garLoopResultBuilder]: At program point L127-1(lines 115 129) the Hoare annotation is: (let ((.cse1 (= ~t1_i~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)) (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (not .cse0) .cse2 .cse3 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse4 .cse5 .cse6))) [2021-10-28 23:00:44,264 INFO L853 garLoopResultBuilder]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse11 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse14)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T1_E~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse13 (= ~E_M~0 2)) (.cse15 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse15) (and .cse14 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse8 .cse9 .cse10 .cse13 .cse15 (< ~local~0 ~token~0))))) [2021-10-28 23:00:44,265 INFO L853 garLoopResultBuilder]: At program point L127-2(lines 115 129) the Hoare annotation is: (let ((.cse4 (not (= ~E_1~0 1))) (.cse6 (not (= ~t1_st~0 0))) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~t1_pc~0 1) .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse3 .cse4 .cse5 .cse6 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ~m_pc~0 0)))) [2021-10-28 23:00:44,265 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 23:00:44,265 INFO L853 garLoopResultBuilder]: At program point L127-3(lines 115 129) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse13 (= ~token~0 ~local~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (not .cse12)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~E_1~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse11 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6 .cse13) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7) (and .cse12 .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6)))) [2021-10-28 23:00:44,265 INFO L853 garLoopResultBuilder]: At program point L127-4(lines 115 129) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse13 (= ~token~0 ~local~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (not .cse12)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~E_1~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse11 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6 .cse13) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7) (and .cse12 .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6)))) [2021-10-28 23:00:44,265 INFO L853 garLoopResultBuilder]: At program point L458(lines 405 463) the Hoare annotation is: (= ~t1_i~0 1) [2021-10-28 23:00:44,266 INFO L853 garLoopResultBuilder]: At program point L128(lines 112 130) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (<= 2 ~M_E~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8 .cse9))) [2021-10-28 23:00:44,266 INFO L853 garLoopResultBuilder]: At program point L128-1(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)) (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 .cse2 (not .cse0) .cse3 .cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse5 .cse6 .cse7))) [2021-10-28 23:00:44,266 INFO L853 garLoopResultBuilder]: At program point L128-2(lines 112 130) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (= ~t1_i~0 1)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse7 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7) (and (= ~t1_pc~0 1) .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse4 .cse6 .cse5 .cse7 (< ~local~0 ~token~0)))) [2021-10-28 23:00:44,266 INFO L853 garLoopResultBuilder]: At program point L128-3(lines 112 130) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse12 (= ~m_pc~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~t1_i~0 1)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (not .cse13)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse13 .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0)) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse7 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7)))) [2021-10-28 23:00:44,267 INFO L853 garLoopResultBuilder]: At program point L128-4(lines 112 130) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse12 (= ~m_pc~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~t1_i~0 1)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (not .cse13)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse13 .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0)) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse7 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7)))) [2021-10-28 23:00:44,267 INFO L857 garLoopResultBuilder]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2021-10-28 23:00:44,267 INFO L853 garLoopResultBuilder]: At program point L294-3(lines 275 302) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,267 INFO L857 garLoopResultBuilder]: For program point L261-3(lines 250 273) no Hoare annotation was computed. [2021-10-28 23:00:44,268 INFO L857 garLoopResultBuilder]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2021-10-28 23:00:44,268 INFO L857 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-10-28 23:00:44,268 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 236) no Hoare annotation was computed. [2021-10-28 23:00:44,268 INFO L857 garLoopResultBuilder]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2021-10-28 23:00:44,268 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 23:00:44,268 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-28 23:00:44,269 INFO L853 garLoopResultBuilder]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 2 ~M_E~0)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7))) [2021-10-28 23:00:44,269 INFO L853 garLoopResultBuilder]: At program point L266-3(lines 247 274) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-28 23:00:44,269 INFO L853 garLoopResultBuilder]: At program point L167-1(lines 251 255) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 2 ~M_E~0)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7))) [2021-10-28 23:00:44,273 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:00:44,275 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:00:44,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:00:44 BoogieIcfgContainer [2021-10-28 23:00:44,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:00:44,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:00:44,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:00:44,403 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:00:44,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:00:24" (3/4) ... [2021-10-28 23:00:44,411 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 23:00:44,437 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 23:00:44,438 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 23:00:44,440 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:00:44,441 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:00:44,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) [2021-10-28 23:00:44,472 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,473 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) [2021-10-28 23:00:44,473 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,473 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,474 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,474 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,474 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) [2021-10-28 23:00:44,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) [2021-10-28 23:00:44,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token) [2021-10-28 23:00:44,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) [2021-10-28 23:00:44,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) [2021-10-28 23:00:44,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) [2021-10-28 23:00:44,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,481 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) [2021-10-28 23:00:44,481 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || ((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) [2021-10-28 23:00:44,481 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,481 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) [2021-10-28 23:00:44,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,486 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) [2021-10-28 23:00:44,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0)) || ((((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) [2021-10-28 23:00:44,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) [2021-10-28 23:00:44,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) [2021-10-28 23:00:44,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,494 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && local < token)) || (((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) [2021-10-28 23:00:44,494 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) || (((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-28 23:00:44,495 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,495 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) [2021-10-28 23:00:44,495 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) [2021-10-28 23:00:44,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) [2021-10-28 23:00:44,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,499 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-28 23:00:44,577 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:00:44,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:00:44,581 INFO L168 Benchmark]: Toolchain (without parser) took 20949.87 ms. Allocated memory was 100.7 MB in the beginning and 253.8 MB in the end (delta: 153.1 MB). Free memory was 68.6 MB in the beginning and 210.9 MB in the end (delta: -142.3 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:00:44,582 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 100.7 MB. Free memory is still 54.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:00:44,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.96 ms. Allocated memory is still 100.7 MB. Free memory was 68.6 MB in the beginning and 73.6 MB in the end (delta: -5.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:00:44,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.58 ms. Allocated memory is still 100.7 MB. Free memory was 73.6 MB in the beginning and 71.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:00:44,583 INFO L168 Benchmark]: Boogie Preprocessor took 52.69 ms. Allocated memory is still 100.7 MB. Free memory was 71.2 MB in the beginning and 69.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:00:44,584 INFO L168 Benchmark]: RCFGBuilder took 760.97 ms. Allocated memory is still 100.7 MB. Free memory was 69.1 MB in the beginning and 49.6 MB in the end (delta: 19.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:00:44,584 INFO L168 Benchmark]: TraceAbstraction took 19531.28 ms. Allocated memory was 100.7 MB in the beginning and 253.8 MB in the end (delta: 153.1 MB). Free memory was 49.2 MB in the beginning and 220.4 MB in the end (delta: -171.2 MB). Peak memory consumption was 129.9 MB. Max. memory is 16.1 GB. [2021-10-28 23:00:44,585 INFO L168 Benchmark]: Witness Printer took 176.72 ms. Allocated memory is still 253.8 MB. Free memory was 220.4 MB in the beginning and 210.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:00:44,591 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 100.7 MB. Free memory is still 54.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 327.96 ms. Allocated memory is still 100.7 MB. Free memory was 68.6 MB in the beginning and 73.6 MB in the end (delta: -5.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.58 ms. Allocated memory is still 100.7 MB. Free memory was 73.6 MB in the beginning and 71.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.69 ms. Allocated memory is still 100.7 MB. Free memory was 71.2 MB in the beginning and 69.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 760.97 ms. Allocated memory is still 100.7 MB. Free memory was 69.1 MB in the beginning and 49.6 MB in the end (delta: 19.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19531.28 ms. Allocated memory was 100.7 MB in the beginning and 253.8 MB in the end (delta: 153.1 MB). Free memory was 49.2 MB in the beginning and 220.4 MB in the end (delta: -171.2 MB). Peak memory consumption was 129.9 MB. Max. memory is 16.1 GB. * Witness Printer took 176.72 ms. Allocated memory is still 253.8 MB. Free memory was 220.4 MB in the beginning and 210.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3179 SDtfs, 3877 SDslu, 2598 SDs, 0 SdLazy, 401 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2384occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1073 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 754 NumberOfFragments, 11288 HoareAnnotationTreeSize, 52 FomulaSimplifications, 76100 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 52 FomulaSimplificationsInter, 27888 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 1748 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 167/167 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0)) || ((((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || ((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) || (((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && local < token)) || (((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token == local) || (((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) RESULT: Ultimate proved your program to be correct! [2021-10-28 23:00:44,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e73d0367-e6a8-4871-954f-7577bfc7a568/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...