./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 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6325feb12f40756470caf3b12878fd0ec9ad6f61 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 16:41:10,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 16:41:10,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 16:41:10,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 16:41:10,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 16:41:10,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 16:41:10,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 16:41:10,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 16:41:10,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 16:41:10,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 16:41:10,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 16:41:10,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 16:41:10,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 16:41:10,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 16:41:10,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 16:41:10,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 16:41:10,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 16:41:10,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 16:41:10,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 16:41:10,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 16:41:10,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 16:41:10,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 16:41:10,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 16:41:10,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 16:41:10,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 16:41:10,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 16:41:10,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 16:41:10,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 16:41:10,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 16:41:10,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 16:41:10,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 16:41:10,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 16:41:10,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 16:41:10,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 16:41:10,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 16:41:10,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 16:41:10,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 16:41:10,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 16:41:10,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 16:41:10,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 16:41:10,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 16:41:10,962 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 16:41:11,008 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 16:41:11,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 16:41:11,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 16:41:11,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 16:41:11,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 16:41:11,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 16:41:11,011 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 16:41:11,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 16:41:11,011 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 16:41:11,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 16:41:11,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 16:41:11,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 16:41:11,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 16:41:11,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 16:41:11,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 16:41:11,013 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 16:41:11,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 16:41:11,013 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 16:41:11,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 16:41:11,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 16:41:11,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 16:41:11,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 16:41:11,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:41:11,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 16:41:11,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 16:41:11,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 16:41:11,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 16:41:11,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 16:41:11,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 16:41:11,015 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 16:41:11,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(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 -> 6325feb12f40756470caf3b12878fd0ec9ad6f61 [2021-08-29 16:41:11,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 16:41:11,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 16:41:11,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 16:41:11,375 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 16:41:11,375 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 16:41:11,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-08-29 16:41:11,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc4f1997/6f6ceb70c5944762b63f3bd347abbf1d/FLAG46f368441 [2021-08-29 16:41:11,841 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 16:41:11,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-08-29 16:41:11,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc4f1997/6f6ceb70c5944762b63f3bd347abbf1d/FLAG46f368441 [2021-08-29 16:41:11,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc4f1997/6f6ceb70c5944762b63f3bd347abbf1d [2021-08-29 16:41:11,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 16:41:11,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 16:41:11,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 16:41:11,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 16:41:11,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 16:41:11,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:41:11" (1/1) ... [2021-08-29 16:41:11,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d850056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:11, skipping insertion in model container [2021-08-29 16:41:11,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:41:11" (1/1) ... [2021-08-29 16:41:11,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 16:41:11,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 16:41:12,004 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-08-29 16:41:12,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:41:12,045 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 16:41:12,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-08-29 16:41:12,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:41:12,119 INFO L208 MainTranslator]: Completed translation [2021-08-29 16:41:12,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12 WrapperNode [2021-08-29 16:41:12,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 16:41:12,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 16:41:12,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 16:41:12,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 16:41:12,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 16:41:12,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 16:41:12,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 16:41:12,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 16:41:12,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 16:41:12,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 16:41:12,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 16:41:12,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 16:41:12,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (1/1) ... [2021-08-29 16:41:12,206 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:41:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:41:12,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 16:41:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 16:41:12,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 16:41:12,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 16:41:12,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 16:41:12,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 16:41:12,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 16:41:12,548 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-08-29 16:41:12,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:41:12 BoogieIcfgContainer [2021-08-29 16:41:12,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 16:41:12,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 16:41:12,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 16:41:12,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 16:41:12,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 04:41:11" (1/3) ... [2021-08-29 16:41:12,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a354e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:41:12, skipping insertion in model container [2021-08-29 16:41:12,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:41:12" (2/3) ... [2021-08-29 16:41:12,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a354e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:41:12, skipping insertion in model container [2021-08-29 16:41:12,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:41:12" (3/3) ... [2021-08-29 16:41:12,558 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-08-29 16:41:12,565 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 16:41:12,565 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 16:41:12,612 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 16:41:12,619 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, mConcurrency=FINITE_AUTOMATA, 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-08-29 16:41:12,619 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 16:41:12,638 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-08-29 16:41:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 16:41:12,645 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:12,645 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-08-29 16:41:12,646 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-08-29 16:41:12,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:12,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645158926] [2021-08-29 16:41:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:12,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:12,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:12,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645158926] [2021-08-29 16:41:12,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645158926] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:12,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:12,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:41:12,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848225053] [2021-08-29 16:41:12,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:12,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:12,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:12,925 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-08-29 16:41:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:13,196 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2021-08-29 16:41:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:13,199 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-08-29 16:41:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:13,208 INFO L225 Difference]: With dead ends: 277 [2021-08-29 16:41:13,208 INFO L226 Difference]: Without dead ends: 137 [2021-08-29 16:41:13,212 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.98ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:13,219 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 170.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 228.35ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:13,221 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 210 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 228.35ms Time] [2021-08-29 16:41:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-29 16:41:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-08-29 16:41:13,284 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-08-29 16:41:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2021-08-29 16:41:13,292 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2021-08-29 16:41:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:13,292 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2021-08-29 16:41:13,293 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-08-29 16:41:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2021-08-29 16:41:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 16:41:13,296 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:13,296 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-08-29 16:41:13,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 16:41:13,297 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:13,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:13,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-08-29 16:41:13,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:13,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351957790] [2021-08-29 16:41:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:13,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:13,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:13,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351957790] [2021-08-29 16:41:13,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351957790] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:13,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:13,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 16:41:13,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274759545] [2021-08-29 16:41:13,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:13,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:13,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:13,366 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-08-29 16:41:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:13,716 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2021-08-29 16:41:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:13,717 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-08-29 16:41:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:13,721 INFO L225 Difference]: With dead ends: 363 [2021-08-29 16:41:13,721 INFO L226 Difference]: Without dead ends: 232 [2021-08-29 16:41:13,727 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.84ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:13,728 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 221.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.45ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 293.47ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:13,729 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 369 Unknown, 0 Unchecked, 4.45ms Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 293.47ms Time] [2021-08-29 16:41:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-08-29 16:41:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2021-08-29 16:41:13,757 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-08-29 16:41:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2021-08-29 16:41:13,759 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2021-08-29 16:41:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:13,760 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2021-08-29 16:41:13,760 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-08-29 16:41:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2021-08-29 16:41:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 16:41:13,763 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:13,763 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-08-29 16:41:13,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 16:41:13,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-08-29 16:41:13,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:13,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396200920] [2021-08-29 16:41:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:13,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:13,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:13,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396200920] [2021-08-29 16:41:13,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396200920] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:13,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:13,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 16:41:13,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118738463] [2021-08-29 16:41:13,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:13,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:13,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:13,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:13,821 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-08-29 16:41:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:14,020 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2021-08-29 16:41:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:14,020 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-08-29 16:41:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:14,022 INFO L225 Difference]: With dead ends: 453 [2021-08-29 16:41:14,022 INFO L226 Difference]: Without dead ends: 230 [2021-08-29 16:41:14,023 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:14,026 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 132.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.65ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.60ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:14,027 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.65ms Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 181.60ms Time] [2021-08-29 16:41:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-29 16:41:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-08-29 16:41:14,040 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-08-29 16:41:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2021-08-29 16:41:14,041 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2021-08-29 16:41:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:14,041 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2021-08-29 16:41:14,041 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-08-29 16:41:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2021-08-29 16:41:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 16:41:14,042 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:14,043 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-08-29 16:41:14,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 16:41:14,043 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2021-08-29 16:41:14,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:14,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502378202] [2021-08-29 16:41:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:14,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:14,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:14,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502378202] [2021-08-29 16:41:14,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502378202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:14,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:14,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 16:41:14,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137581952] [2021-08-29 16:41:14,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:14,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:14,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:14,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:14,080 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-08-29 16:41:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:14,275 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2021-08-29 16:41:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:14,276 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-08-29 16:41:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:14,277 INFO L225 Difference]: With dead ends: 452 [2021-08-29 16:41:14,277 INFO L226 Difference]: Without dead ends: 230 [2021-08-29 16:41:14,278 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.78ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:14,278 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.69ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 182.60ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:14,279 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 0.69ms Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 182.60ms Time] [2021-08-29 16:41:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-29 16:41:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-08-29 16:41:14,289 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-08-29 16:41:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2021-08-29 16:41:14,290 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2021-08-29 16:41:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:14,291 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2021-08-29 16:41:14,291 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-08-29 16:41:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2021-08-29 16:41:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 16:41:14,292 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:14,292 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-08-29 16:41:14,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 16:41:14,292 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2021-08-29 16:41:14,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:14,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119445047] [2021-08-29 16:41:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:14,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:14,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:14,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119445047] [2021-08-29 16:41:14,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119445047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:14,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:14,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:41:14,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209874964] [2021-08-29 16:41:14,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:41:14,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:14,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:41:14,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:41:14,331 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-08-29 16:41:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:14,673 INFO L93 Difference]: Finished difference Result 598 states and 833 transitions. [2021-08-29 16:41:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:41:14,674 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-08-29 16:41:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:14,675 INFO L225 Difference]: With dead ends: 598 [2021-08-29 16:41:14,676 INFO L226 Difference]: Without dead ends: 377 [2021-08-29 16:41:14,676 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.32ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:41:14,677 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 380 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 236.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.57ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 307.51ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:14,677 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 3.57ms Time], IncrementalHoareTripleChecker [10 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 307.51ms Time] [2021-08-29 16:41:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-08-29 16:41:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 230. [2021-08-29 16:41:14,701 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-08-29 16:41:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 316 transitions. [2021-08-29 16:41:14,702 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 316 transitions. Word has length 39 [2021-08-29 16:41:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:14,703 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 316 transitions. [2021-08-29 16:41:14,703 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-08-29 16:41:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 316 transitions. [2021-08-29 16:41:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 16:41:14,704 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:14,704 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-08-29 16:41:14,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 16:41:14,705 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -50403306, now seen corresponding path program 1 times [2021-08-29 16:41:14,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:14,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601887902] [2021-08-29 16:41:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:14,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:14,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:14,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601887902] [2021-08-29 16:41:14,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601887902] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:14,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:14,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:41:14,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796280471] [2021-08-29 16:41:14,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:41:14,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:41:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:41:14,765 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-08-29 16:41:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:15,224 INFO L93 Difference]: Finished difference Result 784 states and 1078 transitions. [2021-08-29 16:41:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:41:15,225 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-08-29 16:41:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:15,227 INFO L225 Difference]: With dead ends: 784 [2021-08-29 16:41:15,227 INFO L226 Difference]: Without dead ends: 565 [2021-08-29 16:41:15,228 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.31ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:41:15,228 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 385 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 314.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.11ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 404.60ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:15,229 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 0 Invalid, 581 Unknown, 0 Unchecked, 6.11ms Time], IncrementalHoareTripleChecker [20 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 404.60ms Time] [2021-08-29 16:41:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-08-29 16:41:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 519. [2021-08-29 16:41:15,250 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-08-29 16:41:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 699 transitions. [2021-08-29 16:41:15,252 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 699 transitions. Word has length 39 [2021-08-29 16:41:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:15,252 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 699 transitions. [2021-08-29 16:41:15,252 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-08-29 16:41:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 699 transitions. [2021-08-29 16:41:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-29 16:41:15,253 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:15,253 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-08-29 16:41:15,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 16:41:15,254 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 23055374, now seen corresponding path program 1 times [2021-08-29 16:41:15,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:15,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205500731] [2021-08-29 16:41:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:15,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 16:41:15,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:15,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205500731] [2021-08-29 16:41:15,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205500731] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:15,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:15,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:41:15,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405381779] [2021-08-29 16:41:15,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:41:15,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:41:15,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:41:15,295 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-08-29 16:41:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:15,791 INFO L93 Difference]: Finished difference Result 1311 states and 1775 transitions. [2021-08-29 16:41:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 16:41:15,792 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-08-29 16:41:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:15,795 INFO L225 Difference]: With dead ends: 1311 [2021-08-29 16:41:15,795 INFO L226 Difference]: Without dead ends: 813 [2021-08-29 16:41:15,796 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.23ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 16:41:15,796 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 421 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 330.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 422.46ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:15,797 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 0 Invalid, 818 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [20 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 422.46ms Time] [2021-08-29 16:41:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-08-29 16:41:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 540. [2021-08-29 16:41:15,828 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-08-29 16:41:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 711 transitions. [2021-08-29 16:41:15,830 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 711 transitions. Word has length 51 [2021-08-29 16:41:15,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:15,830 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 711 transitions. [2021-08-29 16:41:15,830 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-08-29 16:41:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 711 transitions. [2021-08-29 16:41:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-29 16:41:15,831 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:15,832 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-08-29 16:41:15,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 16:41:15,832 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 724655248, now seen corresponding path program 1 times [2021-08-29 16:41:15,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:15,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421358516] [2021-08-29 16:41:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:15,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:15,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:15,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421358516] [2021-08-29 16:41:15,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421358516] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:15,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:15,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:41:15,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472673313] [2021-08-29 16:41:15,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:15,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:15,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:15,861 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-08-29 16:41:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:16,183 INFO L93 Difference]: Finished difference Result 1511 states and 1975 transitions. [2021-08-29 16:41:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:16,183 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-08-29 16:41:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:16,187 INFO L225 Difference]: With dead ends: 1511 [2021-08-29 16:41:16,187 INFO L226 Difference]: Without dead ends: 996 [2021-08-29 16:41:16,188 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.51ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:16,189 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 196.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.86ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 258.18ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:16,189 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 365 Unknown, 0 Unchecked, 0.86ms Time], IncrementalHoareTripleChecker [17 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 258.18ms Time] [2021-08-29 16:41:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-08-29 16:41:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 960. [2021-08-29 16:41:16,247 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-08-29 16:41:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1226 transitions. [2021-08-29 16:41:16,250 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1226 transitions. Word has length 51 [2021-08-29 16:41:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:16,250 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1226 transitions. [2021-08-29 16:41:16,250 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-08-29 16:41:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1226 transitions. [2021-08-29 16:41:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-29 16:41:16,252 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:16,253 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-08-29 16:41:16,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 16:41:16,253 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash 171160657, now seen corresponding path program 1 times [2021-08-29 16:41:16,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:16,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840869930] [2021-08-29 16:41:16,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:16,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-29 16:41:16,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:16,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840869930] [2021-08-29 16:41:16,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840869930] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:16,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:16,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 16:41:16,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019116388] [2021-08-29 16:41:16,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:16,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:16,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:16,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:16,313 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-08-29 16:41:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:16,637 INFO L93 Difference]: Finished difference Result 2284 states and 2945 transitions. [2021-08-29 16:41:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:16,638 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-08-29 16:41:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:16,645 INFO L225 Difference]: With dead ends: 2284 [2021-08-29 16:41:16,645 INFO L226 Difference]: Without dead ends: 1602 [2021-08-29 16:41:16,646 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.53ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:16,648 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 191.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 246.32ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:16,648 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [5 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 246.32ms Time] [2021-08-29 16:41:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-08-29 16:41:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1312. [2021-08-29 16:41:16,715 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-08-29 16:41:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1678 transitions. [2021-08-29 16:41:16,721 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1678 transitions. Word has length 52 [2021-08-29 16:41:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:16,721 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 1678 transitions. [2021-08-29 16:41:16,721 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-08-29 16:41:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1678 transitions. [2021-08-29 16:41:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-29 16:41:16,722 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:16,723 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-08-29 16:41:16,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 16:41:16,723 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash 313852773, now seen corresponding path program 1 times [2021-08-29 16:41:16,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:16,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381883631] [2021-08-29 16:41:16,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:16,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:16,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:16,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381883631] [2021-08-29 16:41:16,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381883631] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:16,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:16,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:41:16,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729056970] [2021-08-29 16:41:16,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:41:16,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:41:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:41:16,780 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-08-29 16:41:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:17,185 INFO L93 Difference]: Finished difference Result 2538 states and 3250 transitions. [2021-08-29 16:41:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 16:41:17,186 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-08-29 16:41:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:17,192 INFO L225 Difference]: With dead ends: 2538 [2021-08-29 16:41:17,192 INFO L226 Difference]: Without dead ends: 1554 [2021-08-29 16:41:17,194 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.84ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 16:41:17,194 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 461 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 237.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.12ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 301.57ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:17,195 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 0 Invalid, 544 Unknown, 0 Unchecked, 2.12ms Time], IncrementalHoareTripleChecker [17 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 301.57ms Time] [2021-08-29 16:41:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-08-29 16:41:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1324. [2021-08-29 16:41:17,260 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-08-29 16:41:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1656 transitions. [2021-08-29 16:41:17,264 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1656 transitions. Word has length 63 [2021-08-29 16:41:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:17,264 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1656 transitions. [2021-08-29 16:41:17,264 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-08-29 16:41:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1656 transitions. [2021-08-29 16:41:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-29 16:41:17,265 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:17,265 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-08-29 16:41:17,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 16:41:17,266 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 736554599, now seen corresponding path program 1 times [2021-08-29 16:41:17,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:17,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790971691] [2021-08-29 16:41:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:17,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:17,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:17,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790971691] [2021-08-29 16:41:17,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790971691] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:17,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:17,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:41:17,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468531927] [2021-08-29 16:41:17,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:17,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:17,325 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-08-29 16:41:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:17,678 INFO L93 Difference]: Finished difference Result 3688 states and 4602 transitions. [2021-08-29 16:41:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:17,679 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-08-29 16:41:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:17,688 INFO L225 Difference]: With dead ends: 3688 [2021-08-29 16:41:17,688 INFO L226 Difference]: Without dead ends: 2410 [2021-08-29 16:41:17,690 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.02ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:17,691 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 165.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.81ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 221.86ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:17,691 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 345 Unknown, 0 Unchecked, 0.81ms Time], IncrementalHoareTripleChecker [12 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 221.86ms Time] [2021-08-29 16:41:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-08-29 16:41:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2384. [2021-08-29 16:41:17,810 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-08-29 16:41:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2930 transitions. [2021-08-29 16:41:17,816 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2930 transitions. Word has length 63 [2021-08-29 16:41:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:17,816 INFO L470 AbstractCegarLoop]: Abstraction has 2384 states and 2930 transitions. [2021-08-29 16:41:17,817 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-08-29 16:41:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2930 transitions. [2021-08-29 16:41:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-29 16:41:17,818 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:17,818 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-08-29 16:41:17,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 16:41:17,818 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1397696040, now seen corresponding path program 1 times [2021-08-29 16:41:17,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:17,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857587186] [2021-08-29 16:41:17,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:17,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:17,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:17,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857587186] [2021-08-29 16:41:17,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857587186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:17,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:17,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:41:17,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222746456] [2021-08-29 16:41:17,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:41:17,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:17,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:41:17,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:41:17,856 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-08-29 16:41:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:18,243 INFO L93 Difference]: Finished difference Result 4188 states and 5143 transitions. [2021-08-29 16:41:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:41:18,244 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-08-29 16:41:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:18,250 INFO L225 Difference]: With dead ends: 4188 [2021-08-29 16:41:18,251 INFO L226 Difference]: Without dead ends: 1829 [2021-08-29 16:41:18,254 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:41:18,255 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 313 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 201.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.29ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 259.90ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:18,255 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 0 Invalid, 478 Unknown, 0 Unchecked, 2.29ms Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 259.90ms Time] [2021-08-29 16:41:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2021-08-29 16:41:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2021-08-29 16:41:18,350 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-08-29 16:41:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2207 transitions. [2021-08-29 16:41:18,354 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2207 transitions. Word has length 64 [2021-08-29 16:41:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:18,355 INFO L470 AbstractCegarLoop]: Abstraction has 1829 states and 2207 transitions. [2021-08-29 16:41:18,355 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-08-29 16:41:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2207 transitions. [2021-08-29 16:41:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-29 16:41:18,357 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:18,357 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-08-29 16:41:18,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 16:41:18,357 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:18,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1733249900, now seen corresponding path program 1 times [2021-08-29 16:41:18,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:18,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062931961] [2021-08-29 16:41:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:18,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 16:41:18,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:18,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062931961] [2021-08-29 16:41:18,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062931961] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:18,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:18,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:41:18,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724380549] [2021-08-29 16:41:18,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:41:18,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:41:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:41:18,390 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-08-29 16:41:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:18,746 INFO L93 Difference]: Finished difference Result 3653 states and 4407 transitions. [2021-08-29 16:41:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:41:18,746 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-08-29 16:41:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:18,751 INFO L225 Difference]: With dead ends: 3653 [2021-08-29 16:41:18,751 INFO L226 Difference]: Without dead ends: 1582 [2021-08-29 16:41:18,753 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:41:18,754 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 195.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.43ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 257.76ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:18,754 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 0 Invalid, 442 Unknown, 0 Unchecked, 1.43ms Time], IncrementalHoareTripleChecker [5 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 257.76ms Time] [2021-08-29 16:41:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2021-08-29 16:41:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1559. [2021-08-29 16:41:18,818 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-08-29 16:41:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1866 transitions. [2021-08-29 16:41:18,821 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1866 transitions. Word has length 94 [2021-08-29 16:41:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:18,821 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1866 transitions. [2021-08-29 16:41:18,822 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-08-29 16:41:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1866 transitions. [2021-08-29 16:41:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-29 16:41:18,823 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:18,823 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-08-29 16:41:18,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 16:41:18,823 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash -41173677, now seen corresponding path program 1 times [2021-08-29 16:41:18,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:18,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974787407] [2021-08-29 16:41:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:18,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-29 16:41:18,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:18,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974787407] [2021-08-29 16:41:18,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974787407] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:18,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:18,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:41:18,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320725456] [2021-08-29 16:41:18,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:41:18,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:18,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:41:18,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:41:18,870 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-08-29 16:41:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:19,063 INFO L93 Difference]: Finished difference Result 2548 states and 3026 transitions. [2021-08-29 16:41:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:41:19,064 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-08-29 16:41:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:19,066 INFO L225 Difference]: With dead ends: 2548 [2021-08-29 16:41:19,066 INFO L226 Difference]: Without dead ends: 699 [2021-08-29 16:41:19,068 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.36ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:41:19,069 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.02ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 141.18ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:19,069 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 215 Unknown, 0 Unchecked, 2.02ms Time], IncrementalHoareTripleChecker [8 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 141.18ms Time] [2021-08-29 16:41:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-08-29 16:41:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-08-29 16:41:19,098 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-08-29 16:41:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 777 transitions. [2021-08-29 16:41:19,100 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 777 transitions. Word has length 94 [2021-08-29 16:41:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:19,100 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 777 transitions. [2021-08-29 16:41:19,100 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-08-29 16:41:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 777 transitions. [2021-08-29 16:41:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-29 16:41:19,101 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:19,101 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-08-29 16:41:19,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 16:41:19,102 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash -400908240, now seen corresponding path program 1 times [2021-08-29 16:41:19,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:19,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803357042] [2021-08-29 16:41:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:19,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:41:19,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:19,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803357042] [2021-08-29 16:41:19,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803357042] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:19,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:19,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:41:19,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594551828] [2021-08-29 16:41:19,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:41:19,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:41:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:19,131 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-08-29 16:41:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:19,332 INFO L93 Difference]: Finished difference Result 1019 states and 1137 transitions. [2021-08-29 16:41:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:41:19,332 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-08-29 16:41:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:19,334 INFO L225 Difference]: With dead ends: 1019 [2021-08-29 16:41:19,334 INFO L226 Difference]: Without dead ends: 582 [2021-08-29 16:41:19,336 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.51ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:41:19,337 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 135.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 172.86ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:19,337 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 327 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 172.86ms Time] [2021-08-29 16:41:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-08-29 16:41:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2021-08-29 16:41:19,373 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-08-29 16:41:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2021-08-29 16:41:19,374 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 94 [2021-08-29 16:41:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:19,375 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2021-08-29 16:41:19,375 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-08-29 16:41:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2021-08-29 16:41:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-29 16:41:19,377 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:41:19,377 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-08-29 16:41:19,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 16:41:19,377 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:41:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:41:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2021-08-29 16:41:19,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:41:19,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370160322] [2021-08-29 16:41:19,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:41:19,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:41:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:41:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-29 16:41:19,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:41:19,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370160322] [2021-08-29 16:41:19,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370160322] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:41:19,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:41:19,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:41:19,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167712322] [2021-08-29 16:41:19,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:41:19,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:41:19,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:41:19,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:41:19,460 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-08-29 16:41:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:41:19,717 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2021-08-29 16:41:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:41:19,717 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-08-29 16:41:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:41:19,718 INFO L225 Difference]: With dead ends: 586 [2021-08-29 16:41:19,718 INFO L226 Difference]: Without dead ends: 0 [2021-08-29 16:41:19,719 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.88ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:41:19,719 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 205.30ms IncrementalHoareTripleChecker+Time [2021-08-29 16:41:19,719 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 467 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 205.30ms Time] [2021-08-29 16:41:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-29 16:41:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-29 16:41:19,720 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-08-29 16:41:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-29 16:41:19,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-08-29 16:41:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:41:19,721 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-29 16:41:19,721 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-08-29 16:41:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-29 16:41:19,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-29 16:41:19,724 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 16:41:19,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 16:41:19,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-29 16:41:19,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:19,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:19,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:19,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:19,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:20,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:21,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 16:41:30,095 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,095 INFO L858 garLoopResultBuilder]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,095 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 44) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,096 INFO L858 garLoopResultBuilder]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2021-08-29 16:41:30,097 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 141) no Hoare annotation was computed. [2021-08-29 16:41:30,097 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2021-08-29 16:41:30,097 INFO L858 garLoopResultBuilder]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2021-08-29 16:41:30,097 INFO L858 garLoopResultBuilder]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2021-08-29 16:41:30,097 INFO L858 garLoopResultBuilder]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2021-08-29 16:41:30,098 INFO L854 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-08-29 16:41:30,098 INFO L858 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2021-08-29 16:41:30,098 INFO L854 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-08-29 16:41:30,098 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-08-29 16:41:30,098 INFO L854 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-08-29 16:41:30,099 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-08-29 16:41:30,099 INFO L858 garLoopResultBuilder]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2021-08-29 16:41:30,099 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 448) no Hoare annotation was computed. [2021-08-29 16:41:30,099 INFO L854 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-08-29 16:41:30,099 INFO L854 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-08-29 16:41:30,099 INFO L854 garLoopResultBuilder]: At program point L473(lines 464 475) the Hoare annotation is: (= ~t1_i~0 1) [2021-08-29 16:41:30,100 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-08-29 16:41:30,100 INFO L858 garLoopResultBuilder]: For program point L311(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,100 INFO L858 garLoopResultBuilder]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,100 INFO L858 garLoopResultBuilder]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,100 INFO L854 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-08-29 16:41:30,100 INFO L854 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-08-29 16:41:30,101 INFO L858 garLoopResultBuilder]: For program point L311-5(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,101 INFO L854 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-08-29 16:41:30,101 INFO L858 garLoopResultBuilder]: For program point L311-6(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,101 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 88) no Hoare annotation was computed. [2021-08-29 16:41:30,101 INFO L854 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-08-29 16:41:30,101 INFO L858 garLoopResultBuilder]: For program point L311-8(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,102 INFO L854 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-08-29 16:41:30,102 INFO L858 garLoopResultBuilder]: For program point L311-9(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,102 INFO L854 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-08-29 16:41:30,102 INFO L858 garLoopResultBuilder]: For program point L311-11(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,102 INFO L858 garLoopResultBuilder]: For program point L311-12(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,102 INFO L858 garLoopResultBuilder]: For program point L311-14(lines 311 315) no Hoare annotation was computed. [2021-08-29 16:41:30,103 INFO L854 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-08-29 16:41:30,103 INFO L858 garLoopResultBuilder]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2021-08-29 16:41:30,103 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 190) no Hoare annotation was computed. [2021-08-29 16:41:30,103 INFO L858 garLoopResultBuilder]: For program point L279-3(lines 278 301) no Hoare annotation was computed. [2021-08-29 16:41:30,103 INFO L854 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-08-29 16:41:30,103 INFO L858 garLoopResultBuilder]: For program point L180-1(lines 180 190) no Hoare annotation was computed. [2021-08-29 16:41:30,104 INFO L854 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-08-29 16:41:30,104 INFO L858 garLoopResultBuilder]: For program point L180-2(lines 180 190) no Hoare annotation was computed. [2021-08-29 16:41:30,104 INFO L854 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-08-29 16:41:30,104 INFO L858 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2021-08-29 16:41:30,104 INFO L854 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-08-29 16:41:30,105 INFO L854 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-08-29 16:41:30,105 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 222) no Hoare annotation was computed. [2021-08-29 16:41:30,105 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,105 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-08-29 16:41:30,105 INFO L858 garLoopResultBuilder]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,105 INFO L858 garLoopResultBuilder]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,105 INFO L858 garLoopResultBuilder]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,105 INFO L858 garLoopResultBuilder]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,106 INFO L858 garLoopResultBuilder]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,106 INFO L858 garLoopResultBuilder]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,106 INFO L858 garLoopResultBuilder]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,106 INFO L858 garLoopResultBuilder]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,106 INFO L858 garLoopResultBuilder]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2021-08-29 16:41:30,106 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 122) no Hoare annotation was computed. [2021-08-29 16:41:30,106 INFO L858 garLoopResultBuilder]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2021-08-29 16:41:30,107 INFO L854 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-08-29 16:41:30,107 INFO L858 garLoopResultBuilder]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2021-08-29 16:41:30,107 INFO L858 garLoopResultBuilder]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2021-08-29 16:41:30,107 INFO L858 garLoopResultBuilder]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2021-08-29 16:41:30,107 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 189) no Hoare annotation was computed. [2021-08-29 16:41:30,107 INFO L858 garLoopResultBuilder]: For program point L184-1(lines 184 189) no Hoare annotation was computed. [2021-08-29 16:41:30,107 INFO L858 garLoopResultBuilder]: For program point L184-2(lines 184 189) no Hoare annotation was computed. [2021-08-29 16:41:30,108 INFO L854 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-08-29 16:41:30,108 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-29 16:41:30,108 INFO L858 garLoopResultBuilder]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2021-08-29 16:41:30,108 INFO L858 garLoopResultBuilder]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2021-08-29 16:41:30,108 INFO L858 garLoopResultBuilder]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2021-08-29 16:41:30,108 INFO L858 garLoopResultBuilder]: For program point L284-3(lines 278 301) no Hoare annotation was computed. [2021-08-29 16:41:30,108 INFO L858 garLoopResultBuilder]: For program point L251-4(lines 250 273) no Hoare annotation was computed. [2021-08-29 16:41:30,109 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-08-29 16:41:30,109 INFO L858 garLoopResultBuilder]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2021-08-29 16:41:30,109 INFO L854 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-08-29 16:41:30,109 INFO L858 garLoopResultBuilder]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2021-08-29 16:41:30,109 INFO L854 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-08-29 16:41:30,109 INFO L858 garLoopResultBuilder]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2021-08-29 16:41:30,110 INFO L854 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-08-29 16:41:30,110 INFO L858 garLoopResultBuilder]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2021-08-29 16:41:30,110 INFO L854 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-08-29 16:41:30,110 INFO L858 garLoopResultBuilder]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2021-08-29 16:41:30,110 INFO L854 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-08-29 16:41:30,110 INFO L858 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2021-08-29 16:41:30,111 INFO L854 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-08-29 16:41:30,111 INFO L854 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-08-29 16:41:30,111 INFO L854 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-08-29 16:41:30,111 INFO L858 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-08-29 16:41:30,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-29 16:41:30,112 INFO L858 garLoopResultBuilder]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2021-08-29 16:41:30,112 INFO L858 garLoopResultBuilder]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2021-08-29 16:41:30,112 INFO L858 garLoopResultBuilder]: For program point L289-3(lines 278 301) no Hoare annotation was computed. [2021-08-29 16:41:30,112 INFO L858 garLoopResultBuilder]: For program point L256-3(lines 250 273) no Hoare annotation was computed. [2021-08-29 16:41:30,112 INFO L854 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-08-29 16:41:30,113 INFO L858 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2021-08-29 16:41:30,113 INFO L858 garLoopResultBuilder]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2021-08-29 16:41:30,113 INFO L854 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-08-29 16:41:30,113 INFO L854 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-08-29 16:41:30,113 INFO L854 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-08-29 16:41:30,114 INFO L854 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-08-29 16:41:30,114 INFO L854 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-08-29 16:41:30,114 INFO L854 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-08-29 16:41:30,114 INFO L854 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-08-29 16:41:30,114 INFO L854 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-08-29 16:41:30,115 INFO L854 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-08-29 16:41:30,115 INFO L854 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-08-29 16:41:30,115 INFO L854 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-08-29 16:41:30,115 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-29 16:41:30,115 INFO L854 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-08-29 16:41:30,116 INFO L854 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-08-29 16:41:30,116 INFO L854 garLoopResultBuilder]: At program point L458(lines 405 463) the Hoare annotation is: (= ~t1_i~0 1) [2021-08-29 16:41:30,116 INFO L854 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-08-29 16:41:30,116 INFO L854 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-08-29 16:41:30,116 INFO L854 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-08-29 16:41:30,117 INFO L854 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-08-29 16:41:30,117 INFO L854 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-08-29 16:41:30,117 INFO L858 garLoopResultBuilder]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2021-08-29 16:41:30,117 INFO L854 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-08-29 16:41:30,117 INFO L858 garLoopResultBuilder]: For program point L261-3(lines 250 273) no Hoare annotation was computed. [2021-08-29 16:41:30,118 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2021-08-29 16:41:30,118 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-08-29 16:41:30,118 INFO L858 garLoopResultBuilder]: For program point L229(lines 229 236) no Hoare annotation was computed. [2021-08-29 16:41:30,118 INFO L858 garLoopResultBuilder]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2021-08-29 16:41:30,118 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-29 16:41:30,118 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-08-29 16:41:30,119 INFO L854 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-08-29 16:41:30,119 INFO L854 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-08-29 16:41:30,119 INFO L854 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-08-29 16:41:30,124 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 16:41:30,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 04:41:30 BoogieIcfgContainer [2021-08-29 16:41:30,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 16:41:30,222 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 16:41:30,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 16:41:30,222 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 16:41:30,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:41:12" (3/4) ... [2021-08-29 16:41:30,225 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-29 16:41:30,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-29 16:41:30,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-29 16:41:30,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 16:41:30,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 16:41:30,268 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-08-29 16:41:30,268 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-08-29 16:41:30,269 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-08-29 16:41:30,269 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-08-29 16:41:30,269 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-08-29 16:41:30,270 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-08-29 16:41:30,270 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-08-29 16:41:30,270 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-08-29 16:41:30,270 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-08-29 16:41:30,270 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-08-29 16:41:30,271 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-08-29 16:41:30,271 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-08-29 16:41:30,272 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-08-29 16:41:30,272 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-08-29 16:41:30,272 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-08-29 16:41:30,272 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-08-29 16:41:30,273 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-08-29 16:41:30,273 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-08-29 16:41:30,273 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-08-29 16:41:30,274 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-08-29 16:41:30,274 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-08-29 16:41:30,274 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-08-29 16:41:30,275 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-08-29 16:41:30,275 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-08-29 16:41:30,277 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-08-29 16:41:30,277 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-08-29 16:41:30,278 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-08-29 16:41:30,279 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-08-29 16:41:30,279 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-08-29 16:41:30,280 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-08-29 16:41:30,280 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-08-29 16:41:30,280 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-08-29 16:41:30,280 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-08-29 16:41:30,281 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-08-29 16:41:30,281 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-08-29 16:41:30,281 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-08-29 16:41:30,281 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-08-29 16:41:30,281 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-08-29 16:41:30,282 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-08-29 16:41:30,282 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-08-29 16:41:30,282 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-08-29 16:41:30,282 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-08-29 16:41:30,284 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-08-29 16:41:30,336 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 16:41:30,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 16:41:30,337 INFO L158 Benchmark]: Toolchain (without parser) took 18466.48ms. Allocated memory was 67.1MB in the beginning and 268.4MB in the end (delta: 201.3MB). Free memory was 46.4MB in the beginning and 171.5MB in the end (delta: -125.1MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2021-08-29 16:41:30,338 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 16:41:30,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.04ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 47.9MB in the end (delta: -1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 16:41:30,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.81ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 45.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 16:41:30,338 INFO L158 Benchmark]: Boogie Preprocessor took 26.65ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 43.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 16:41:30,339 INFO L158 Benchmark]: RCFGBuilder took 365.78ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 44.7MB in the end (delta: -1.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2021-08-29 16:41:30,339 INFO L158 Benchmark]: TraceAbstraction took 17668.98ms. Allocated memory was 67.1MB in the beginning and 268.4MB in the end (delta: 201.3MB). Free memory was 44.2MB in the beginning and 180.9MB in the end (delta: -136.8MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. [2021-08-29 16:41:30,339 INFO L158 Benchmark]: Witness Printer took 114.60ms. Allocated memory is still 268.4MB. Free memory was 180.9MB in the beginning and 171.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-29 16:41:30,342 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.18ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.04ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 47.9MB in the end (delta: -1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.81ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 45.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.65ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 43.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.78ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 44.7MB in the end (delta: -1.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17668.98ms. Allocated memory was 67.1MB in the beginning and 268.4MB in the end (delta: 201.3MB). Free memory was 44.2MB in the beginning and 180.9MB in the end (delta: -136.8MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. * Witness Printer took 114.60ms. Allocated memory is still 268.4MB. Free memory was 180.9MB in the beginning and 171.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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: 17512.71ms, OverallIterations: 16, TraceHistogramMax: 3, EmptinessCheckTime: 31.31ms, AutomataDifference: 5327.94ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 10370.72ms, InitialAbstractionConstructionTime: 13.94ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3877 SdHoareTripleChecker+Valid, 4085.52ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3877 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3143.73ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2598 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6178 IncrementalHoareTripleChecker+Invalid, 6319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 0 mSDtfsCounter, 6178 mSolverCounterSat, 32.53ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.98ms Time, 0.00ms 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.00ms DumpTime, AutomataMinimizationStatistics: 744.24ms AutomataMinimizationTime, 16 MinimizatonAttempts, 1073 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 754 NumberOfFragments, 11288 HoareAnnotationTreeSize, 52 FomulaSimplifications, 76100 FormulaSimplificationTreeSizeReduction, 1557.58ms HoareSimplificationTime, 52 FomulaSimplificationsInter, 27888 FormulaSimplificationTreeSizeReductionInter, 8788.94ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 44.13ms SsaConstructionTime, 172.78ms SatisfiabilityAnalysisTime, 541.12ms 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-08-29 16:41:30,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...