./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b4145914802a18ceef375a77d9a4f2f13e6c70b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:21:09,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:21:09,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:21:10,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:21:10,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:21:10,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:21:10,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:21:10,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:21:10,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:21:10,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:21:10,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:21:10,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:21:10,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:21:10,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:21:10,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:21:10,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:21:10,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:21:10,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:21:10,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:21:10,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:21:10,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:21:10,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:21:10,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:21:10,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:21:10,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:21:10,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:21:10,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:21:10,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:21:10,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:21:10,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:21:10,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:21:10,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:21:10,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:21:10,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:21:10,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:21:10,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:21:10,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:21:10,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:21:10,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:21:10,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:21:10,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:21:10,071 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:21:10,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:21:10,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:21:10,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:21:10,096 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:21:10,096 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:21:10,096 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:21:10,096 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:21:10,096 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:21:10,097 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:21:10,097 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:21:10,097 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:21:10,097 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:21:10,097 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:21:10,097 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:21:10,098 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:21:10,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:21:10,099 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:21:10,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:21:10,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:21:10,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:21:10,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:21:10,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:21:10,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:21:10,100 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:21:10,100 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:21:10,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:21:10,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:21:10,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:21:10,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:21:10,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:21:10,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:21:10,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:21:10,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:21:10,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:21:10,102 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:21:10,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:21:10,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:21:10,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:21:10,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:21:10,103 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI 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 -> Taipan 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 -> 4b4145914802a18ceef375a77d9a4f2f13e6c70b [2021-10-11 02:21:10,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:21:10,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:21:10,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:21:10,428 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:21:10,428 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:21:10,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-11 02:21:10,509 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/data/0ed1f582d/b6d7723c1fbe47669b895d9a722c68f0/FLAGd5191769f [2021-10-11 02:21:10,998 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:21:10,999 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-11 02:21:11,009 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/data/0ed1f582d/b6d7723c1fbe47669b895d9a722c68f0/FLAGd5191769f [2021-10-11 02:21:11,336 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/data/0ed1f582d/b6d7723c1fbe47669b895d9a722c68f0 [2021-10-11 02:21:11,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:21:11,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:21:11,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:21:11,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:21:11,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:21:11,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f8f64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11, skipping insertion in model container [2021-10-11 02:21:11,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:21:11,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:21:11,535 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-11 02:21:11,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:21:11,617 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:21:11,630 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-11 02:21:11,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:21:11,688 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:21:11,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11 WrapperNode [2021-10-11 02:21:11,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:21:11,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:21:11,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:21:11,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:21:11,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:21:11,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:21:11,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:21:11,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:21:11,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... [2021-10-11 02:21:11,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:21:11,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:21:11,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:21:11,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:21:11,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:21:11,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:21:11,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:21:11,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:21:11,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:21:13,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:21:13,629 INFO L299 CfgBuilder]: Removed 103 assume(true) statements. [2021-10-11 02:21:13,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:21:13 BoogieIcfgContainer [2021-10-11 02:21:13,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:21:13,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:21:13,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:21:13,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:21:13,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:21:11" (1/3) ... [2021-10-11 02:21:13,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c49a2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:21:13, skipping insertion in model container [2021-10-11 02:21:13,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:21:11" (2/3) ... [2021-10-11 02:21:13,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c49a2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:21:13, skipping insertion in model container [2021-10-11 02:21:13,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:21:13" (3/3) ... [2021-10-11 02:21:13,646 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-10-11 02:21:13,661 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:21:13,667 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:21:13,681 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:21:13,703 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:21:13,703 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:21:13,703 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:21:13,703 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:21:13,704 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:21:13,704 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:21:13,704 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:21:13,704 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:21:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2021-10-11 02:21:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:21:13,723 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:13,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:13,724 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash 714357944, now seen corresponding path program 1 times [2021-10-11 02:21:13,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:13,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35323650] [2021-10-11 02:21:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:13,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35323650] [2021-10-11 02:21:13,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:13,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:21:13,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680352752] [2021-10-11 02:21:13,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:13,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:13,897 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2021-10-11 02:21:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:14,001 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2021-10-11 02:21:14,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:14,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-10-11 02:21:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:14,024 INFO L225 Difference]: With dead ends: 276 [2021-10-11 02:21:14,025 INFO L226 Difference]: Without dead ends: 174 [2021-10-11 02:21:14,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-11 02:21:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2021-10-11 02:21:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2021-10-11 02:21:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2021-10-11 02:21:14,089 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 19 [2021-10-11 02:21:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:14,090 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2021-10-11 02:21:14,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2021-10-11 02:21:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:21:14,092 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:14,093 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:21:14,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:21:14,093 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:14,094 INFO L82 PathProgramCache]: Analyzing trace with hash -221768112, now seen corresponding path program 1 times [2021-10-11 02:21:14,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:14,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93037999] [2021-10-11 02:21:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:21:14,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93037999] [2021-10-11 02:21:14,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:14,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:21:14,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559470819] [2021-10-11 02:21:14,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:14,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:14,180 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand 3 states. [2021-10-11 02:21:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:14,267 INFO L93 Difference]: Finished difference Result 444 states and 652 transitions. [2021-10-11 02:21:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:14,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-10-11 02:21:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:14,279 INFO L225 Difference]: With dead ends: 444 [2021-10-11 02:21:14,280 INFO L226 Difference]: Without dead ends: 285 [2021-10-11 02:21:14,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-10-11 02:21:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2021-10-11 02:21:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2021-10-11 02:21:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2021-10-11 02:21:14,308 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 36 [2021-10-11 02:21:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:14,308 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2021-10-11 02:21:14,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2021-10-11 02:21:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:21:14,311 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:14,311 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:21:14,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:21:14,312 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash 697206511, now seen corresponding path program 1 times [2021-10-11 02:21:14,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:14,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517313048] [2021-10-11 02:21:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:14,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517313048] [2021-10-11 02:21:14,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:14,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:14,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811629122] [2021-10-11 02:21:14,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:14,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:14,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:14,442 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand 3 states. [2021-10-11 02:21:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:14,537 INFO L93 Difference]: Finished difference Result 775 states and 1112 transitions. [2021-10-11 02:21:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:14,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-10-11 02:21:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:14,544 INFO L225 Difference]: With dead ends: 775 [2021-10-11 02:21:14,544 INFO L226 Difference]: Without dead ends: 502 [2021-10-11 02:21:14,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-10-11 02:21:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2021-10-11 02:21:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2021-10-11 02:21:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 687 transitions. [2021-10-11 02:21:14,610 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 687 transitions. Word has length 36 [2021-10-11 02:21:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:14,610 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 687 transitions. [2021-10-11 02:21:14,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 687 transitions. [2021-10-11 02:21:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:21:14,620 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:14,620 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:21:14,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:21:14,621 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -582118224, now seen corresponding path program 1 times [2021-10-11 02:21:14,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:14,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286359410] [2021-10-11 02:21:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:14,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286359410] [2021-10-11 02:21:14,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:14,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:14,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227975044] [2021-10-11 02:21:14,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:21:14,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:21:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:14,816 INFO L87 Difference]: Start difference. First operand 488 states and 687 transitions. Second operand 4 states. [2021-10-11 02:21:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:14,989 INFO L93 Difference]: Finished difference Result 1354 states and 1918 transitions. [2021-10-11 02:21:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:21:14,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-10-11 02:21:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:14,999 INFO L225 Difference]: With dead ends: 1354 [2021-10-11 02:21:14,999 INFO L226 Difference]: Without dead ends: 876 [2021-10-11 02:21:15,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:15,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-10-11 02:21:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 696. [2021-10-11 02:21:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2021-10-11 02:21:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 981 transitions. [2021-10-11 02:21:15,043 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 981 transitions. Word has length 36 [2021-10-11 02:21:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:15,044 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 981 transitions. [2021-10-11 02:21:15,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:21:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 981 transitions. [2021-10-11 02:21:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 02:21:15,047 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:15,047 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:21:15,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:21:15,050 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:15,050 INFO L82 PathProgramCache]: Analyzing trace with hash 635907816, now seen corresponding path program 1 times [2021-10-11 02:21:15,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:15,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520968507] [2021-10-11 02:21:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:15,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520968507] [2021-10-11 02:21:15,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:15,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:15,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994256829] [2021-10-11 02:21:15,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:15,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:15,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:15,113 INFO L87 Difference]: Start difference. First operand 696 states and 981 transitions. Second operand 3 states. [2021-10-11 02:21:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:15,195 INFO L93 Difference]: Finished difference Result 1209 states and 1739 transitions. [2021-10-11 02:21:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:15,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2021-10-11 02:21:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:15,201 INFO L225 Difference]: With dead ends: 1209 [2021-10-11 02:21:15,201 INFO L226 Difference]: Without dead ends: 811 [2021-10-11 02:21:15,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-10-11 02:21:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 761. [2021-10-11 02:21:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2021-10-11 02:21:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1085 transitions. [2021-10-11 02:21:15,243 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1085 transitions. Word has length 37 [2021-10-11 02:21:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:15,244 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 1085 transitions. [2021-10-11 02:21:15,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1085 transitions. [2021-10-11 02:21:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-11 02:21:15,247 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:15,247 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:15,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:21:15,248 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:15,249 INFO L82 PathProgramCache]: Analyzing trace with hash 406497427, now seen corresponding path program 1 times [2021-10-11 02:21:15,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:15,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000405724] [2021-10-11 02:21:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:15,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000405724] [2021-10-11 02:21:15,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:15,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:15,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562340860] [2021-10-11 02:21:15,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:15,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:15,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:15,320 INFO L87 Difference]: Start difference. First operand 761 states and 1085 transitions. Second operand 3 states. [2021-10-11 02:21:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:15,387 INFO L93 Difference]: Finished difference Result 1279 states and 1834 transitions. [2021-10-11 02:21:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:15,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-10-11 02:21:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:15,395 INFO L225 Difference]: With dead ends: 1279 [2021-10-11 02:21:15,395 INFO L226 Difference]: Without dead ends: 816 [2021-10-11 02:21:15,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-10-11 02:21:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 761. [2021-10-11 02:21:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2021-10-11 02:21:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1050 transitions. [2021-10-11 02:21:15,437 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1050 transitions. Word has length 53 [2021-10-11 02:21:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:15,437 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 1050 transitions. [2021-10-11 02:21:15,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1050 transitions. [2021-10-11 02:21:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-11 02:21:15,440 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:15,440 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:15,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:21:15,440 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1379986386, now seen corresponding path program 1 times [2021-10-11 02:21:15,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:15,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657341983] [2021-10-11 02:21:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:15,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657341983] [2021-10-11 02:21:15,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:15,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:21:15,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441746351] [2021-10-11 02:21:15,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:21:15,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:21:15,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:21:15,547 INFO L87 Difference]: Start difference. First operand 761 states and 1050 transitions. Second operand 5 states. [2021-10-11 02:21:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:15,717 INFO L93 Difference]: Finished difference Result 1489 states and 2083 transitions. [2021-10-11 02:21:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:21:15,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2021-10-11 02:21:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:15,723 INFO L225 Difference]: With dead ends: 1489 [2021-10-11 02:21:15,723 INFO L226 Difference]: Without dead ends: 738 [2021-10-11 02:21:15,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:21:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-10-11 02:21:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 716. [2021-10-11 02:21:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-10-11 02:21:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1001 transitions. [2021-10-11 02:21:15,794 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1001 transitions. Word has length 53 [2021-10-11 02:21:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:15,795 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 1001 transitions. [2021-10-11 02:21:15,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:21:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1001 transitions. [2021-10-11 02:21:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-11 02:21:15,797 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:15,797 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:15,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:21:15,798 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:15,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:15,798 INFO L82 PathProgramCache]: Analyzing trace with hash -119806066, now seen corresponding path program 1 times [2021-10-11 02:21:15,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:15,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010674645] [2021-10-11 02:21:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:15,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010674645] [2021-10-11 02:21:15,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:15,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:21:15,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754781431] [2021-10-11 02:21:15,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:21:15,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:15,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:21:15,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:21:15,931 INFO L87 Difference]: Start difference. First operand 716 states and 1001 transitions. Second operand 5 states. [2021-10-11 02:21:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:16,132 INFO L93 Difference]: Finished difference Result 1347 states and 1877 transitions. [2021-10-11 02:21:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:21:16,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2021-10-11 02:21:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:16,139 INFO L225 Difference]: With dead ends: 1347 [2021-10-11 02:21:16,140 INFO L226 Difference]: Without dead ends: 766 [2021-10-11 02:21:16,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:21:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-10-11 02:21:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 716. [2021-10-11 02:21:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-10-11 02:21:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 979 transitions. [2021-10-11 02:21:16,181 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 979 transitions. Word has length 55 [2021-10-11 02:21:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:16,181 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 979 transitions. [2021-10-11 02:21:16,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:21:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 979 transitions. [2021-10-11 02:21:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-11 02:21:16,184 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:16,184 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:16,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:21:16,185 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1020545645, now seen corresponding path program 1 times [2021-10-11 02:21:16,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:16,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353639375] [2021-10-11 02:21:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:16,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353639375] [2021-10-11 02:21:16,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:16,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:16,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67354478] [2021-10-11 02:21:16,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:16,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:16,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:16,262 INFO L87 Difference]: Start difference. First operand 716 states and 979 transitions. Second operand 3 states. [2021-10-11 02:21:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:16,332 INFO L93 Difference]: Finished difference Result 1302 states and 1779 transitions. [2021-10-11 02:21:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:16,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-10-11 02:21:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:16,338 INFO L225 Difference]: With dead ends: 1302 [2021-10-11 02:21:16,338 INFO L226 Difference]: Without dead ends: 721 [2021-10-11 02:21:16,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-10-11 02:21:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 710. [2021-10-11 02:21:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2021-10-11 02:21:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 927 transitions. [2021-10-11 02:21:16,396 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 927 transitions. Word has length 55 [2021-10-11 02:21:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:16,396 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 927 transitions. [2021-10-11 02:21:16,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 927 transitions. [2021-10-11 02:21:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-11 02:21:16,401 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:16,401 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:16,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:21:16,401 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1739489372, now seen corresponding path program 1 times [2021-10-11 02:21:16,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:16,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598491871] [2021-10-11 02:21:16,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:16,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598491871] [2021-10-11 02:21:16,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152754220] [2021-10-11 02:21:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:16,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:21:16,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:21:16,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:21:16,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:21:16,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [8] total 9 [2021-10-11 02:21:16,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982234258] [2021-10-11 02:21:16,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:16,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:21:16,913 INFO L87 Difference]: Start difference. First operand 710 states and 927 transitions. Second operand 3 states. [2021-10-11 02:21:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:17,063 INFO L93 Difference]: Finished difference Result 1784 states and 2326 transitions. [2021-10-11 02:21:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:17,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-10-11 02:21:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:17,071 INFO L225 Difference]: With dead ends: 1784 [2021-10-11 02:21:17,071 INFO L226 Difference]: Without dead ends: 1085 [2021-10-11 02:21:17,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:21:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2021-10-11 02:21:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2021-10-11 02:21:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2021-10-11 02:21:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1385 transitions. [2021-10-11 02:21:17,137 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1385 transitions. Word has length 56 [2021-10-11 02:21:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:17,138 INFO L481 AbstractCegarLoop]: Abstraction has 1083 states and 1385 transitions. [2021-10-11 02:21:17,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1385 transitions. [2021-10-11 02:21:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-11 02:21:17,141 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:17,141 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:17,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:21:17,361 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash 95499498, now seen corresponding path program 1 times [2021-10-11 02:21:17,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:17,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782345031] [2021-10-11 02:21:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:17,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782345031] [2021-10-11 02:21:17,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:17,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:21:17,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032693989] [2021-10-11 02:21:17,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:21:17,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:21:17,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:21:17,415 INFO L87 Difference]: Start difference. First operand 1083 states and 1385 transitions. Second operand 5 states. [2021-10-11 02:21:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:17,578 INFO L93 Difference]: Finished difference Result 1829 states and 2348 transitions. [2021-10-11 02:21:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:21:17,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2021-10-11 02:21:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:17,584 INFO L225 Difference]: With dead ends: 1829 [2021-10-11 02:21:17,585 INFO L226 Difference]: Without dead ends: 941 [2021-10-11 02:21:17,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:21:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-10-11 02:21:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 923. [2021-10-11 02:21:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2021-10-11 02:21:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1196 transitions. [2021-10-11 02:21:17,636 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1196 transitions. Word has length 57 [2021-10-11 02:21:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:17,636 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1196 transitions. [2021-10-11 02:21:17,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:21:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1196 transitions. [2021-10-11 02:21:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-11 02:21:17,639 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:17,639 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:17,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:21:17,640 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1090490428, now seen corresponding path program 1 times [2021-10-11 02:21:17,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:17,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244580972] [2021-10-11 02:21:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:17,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244580972] [2021-10-11 02:21:17,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187141509] [2021-10-11 02:21:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:17,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 02:21:17,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:21:18,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:18,062 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:21:18,063 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:21:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:21:18,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:21:18,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [8] total 10 [2021-10-11 02:21:18,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164031474] [2021-10-11 02:21:18,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:21:18,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:21:18,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:21:18,148 INFO L87 Difference]: Start difference. First operand 923 states and 1196 transitions. Second operand 4 states. [2021-10-11 02:21:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:18,230 INFO L93 Difference]: Finished difference Result 1523 states and 1978 transitions. [2021-10-11 02:21:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:21:18,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-10-11 02:21:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:18,238 INFO L225 Difference]: With dead ends: 1523 [2021-10-11 02:21:18,239 INFO L226 Difference]: Without dead ends: 949 [2021-10-11 02:21:18,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:21:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-10-11 02:21:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 923. [2021-10-11 02:21:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2021-10-11 02:21:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1175 transitions. [2021-10-11 02:21:18,296 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1175 transitions. Word has length 59 [2021-10-11 02:21:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:18,296 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1175 transitions. [2021-10-11 02:21:18,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:21:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1175 transitions. [2021-10-11 02:21:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-11 02:21:18,300 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:18,300 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:21:18,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-11 02:21:18,527 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash -792475474, now seen corresponding path program 1 times [2021-10-11 02:21:18,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:18,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932382386] [2021-10-11 02:21:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:18,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932382386] [2021-10-11 02:21:18,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545646453] [2021-10-11 02:21:18,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:18,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 02:21:18,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:18,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:18,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:21:18,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-11 02:21:18,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177511466] [2021-10-11 02:21:18,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:21:18,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:21:18,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:21:18,844 INFO L87 Difference]: Start difference. First operand 923 states and 1175 transitions. Second operand 4 states. [2021-10-11 02:21:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:18,937 INFO L93 Difference]: Finished difference Result 1790 states and 2282 transitions. [2021-10-11 02:21:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:21:18,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-10-11 02:21:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:18,943 INFO L225 Difference]: With dead ends: 1790 [2021-10-11 02:21:18,943 INFO L226 Difference]: Without dead ends: 1026 [2021-10-11 02:21:18,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:21:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-10-11 02:21:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 916. [2021-10-11 02:21:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2021-10-11 02:21:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1165 transitions. [2021-10-11 02:21:19,005 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1165 transitions. Word has length 59 [2021-10-11 02:21:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:19,005 INFO L481 AbstractCegarLoop]: Abstraction has 916 states and 1165 transitions. [2021-10-11 02:21:19,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:21:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1165 transitions. [2021-10-11 02:21:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-11 02:21:19,011 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:19,011 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:21:19,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-11 02:21:19,235 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1944592015, now seen corresponding path program 1 times [2021-10-11 02:21:19,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:19,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867628332] [2021-10-11 02:21:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-11 02:21:19,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867628332] [2021-10-11 02:21:19,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:19,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:19,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480942880] [2021-10-11 02:21:19,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:21:19,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:21:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:19,278 INFO L87 Difference]: Start difference. First operand 916 states and 1165 transitions. Second operand 4 states. [2021-10-11 02:21:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:19,444 INFO L93 Difference]: Finished difference Result 2192 states and 2811 transitions. [2021-10-11 02:21:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:21:19,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-10-11 02:21:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:19,451 INFO L225 Difference]: With dead ends: 2192 [2021-10-11 02:21:19,451 INFO L226 Difference]: Without dead ends: 1287 [2021-10-11 02:21:19,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2021-10-11 02:21:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1161. [2021-10-11 02:21:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2021-10-11 02:21:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1445 transitions. [2021-10-11 02:21:19,522 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1445 transitions. Word has length 59 [2021-10-11 02:21:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:19,522 INFO L481 AbstractCegarLoop]: Abstraction has 1161 states and 1445 transitions. [2021-10-11 02:21:19,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:21:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1445 transitions. [2021-10-11 02:21:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-11 02:21:19,525 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:19,525 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:19,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 02:21:19,526 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1511297364, now seen corresponding path program 1 times [2021-10-11 02:21:19,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:19,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753937532] [2021-10-11 02:21:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:19,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753937532] [2021-10-11 02:21:19,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:19,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:19,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960106430] [2021-10-11 02:21:19,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:19,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:19,565 INFO L87 Difference]: Start difference. First operand 1161 states and 1445 transitions. Second operand 3 states. [2021-10-11 02:21:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:19,641 INFO L93 Difference]: Finished difference Result 1747 states and 2196 transitions. [2021-10-11 02:21:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:19,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2021-10-11 02:21:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:19,646 INFO L225 Difference]: With dead ends: 1747 [2021-10-11 02:21:19,646 INFO L226 Difference]: Without dead ends: 789 [2021-10-11 02:21:19,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-10-11 02:21:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 777. [2021-10-11 02:21:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2021-10-11 02:21:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 941 transitions. [2021-10-11 02:21:19,699 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 941 transitions. Word has length 60 [2021-10-11 02:21:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:19,699 INFO L481 AbstractCegarLoop]: Abstraction has 777 states and 941 transitions. [2021-10-11 02:21:19,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 941 transitions. [2021-10-11 02:21:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-11 02:21:19,701 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:19,701 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:19,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 02:21:19,702 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash -223102835, now seen corresponding path program 1 times [2021-10-11 02:21:19,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:19,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026785607] [2021-10-11 02:21:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:21:19,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026785607] [2021-10-11 02:21:19,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:19,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:21:19,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996211070] [2021-10-11 02:21:19,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:19,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:19,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:19,766 INFO L87 Difference]: Start difference. First operand 777 states and 941 transitions. Second operand 3 states. [2021-10-11 02:21:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:19,841 INFO L93 Difference]: Finished difference Result 1328 states and 1611 transitions. [2021-10-11 02:21:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:19,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2021-10-11 02:21:19,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:19,846 INFO L225 Difference]: With dead ends: 1328 [2021-10-11 02:21:19,846 INFO L226 Difference]: Without dead ends: 777 [2021-10-11 02:21:19,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2021-10-11 02:21:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2021-10-11 02:21:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2021-10-11 02:21:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 923 transitions. [2021-10-11 02:21:19,918 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 923 transitions. Word has length 60 [2021-10-11 02:21:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:19,918 INFO L481 AbstractCegarLoop]: Abstraction has 777 states and 923 transitions. [2021-10-11 02:21:19,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 923 transitions. [2021-10-11 02:21:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-11 02:21:19,920 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:19,921 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:19,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 02:21:19,921 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:19,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1399669982, now seen corresponding path program 1 times [2021-10-11 02:21:19,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:19,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131444943] [2021-10-11 02:21:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:21:20,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131444943] [2021-10-11 02:21:20,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:20,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:21:20,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550866958] [2021-10-11 02:21:20,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:21:20,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:21:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:21:20,014 INFO L87 Difference]: Start difference. First operand 777 states and 923 transitions. Second operand 6 states. [2021-10-11 02:21:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:20,233 INFO L93 Difference]: Finished difference Result 1508 states and 1790 transitions. [2021-10-11 02:21:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:21:20,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2021-10-11 02:21:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:20,238 INFO L225 Difference]: With dead ends: 1508 [2021-10-11 02:21:20,238 INFO L226 Difference]: Without dead ends: 775 [2021-10-11 02:21:20,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:21:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-10-11 02:21:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 651. [2021-10-11 02:21:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2021-10-11 02:21:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 760 transitions. [2021-10-11 02:21:20,289 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 760 transitions. Word has length 61 [2021-10-11 02:21:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:20,289 INFO L481 AbstractCegarLoop]: Abstraction has 651 states and 760 transitions. [2021-10-11 02:21:20,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:21:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 760 transitions. [2021-10-11 02:21:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-11 02:21:20,291 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:20,292 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-11 02:21:20,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 02:21:20,292 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1284992014, now seen corresponding path program 1 times [2021-10-11 02:21:20,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:20,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79332400] [2021-10-11 02:21:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:20,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79332400] [2021-10-11 02:21:20,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:20,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:21:20,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650260520] [2021-10-11 02:21:20,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:21:20,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:21:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:20,347 INFO L87 Difference]: Start difference. First operand 651 states and 760 transitions. Second operand 4 states. [2021-10-11 02:21:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:20,483 INFO L93 Difference]: Finished difference Result 1335 states and 1549 transitions. [2021-10-11 02:21:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:21:20,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-10-11 02:21:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:20,489 INFO L225 Difference]: With dead ends: 1335 [2021-10-11 02:21:20,489 INFO L226 Difference]: Without dead ends: 828 [2021-10-11 02:21:20,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-10-11 02:21:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 704. [2021-10-11 02:21:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2021-10-11 02:21:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 811 transitions. [2021-10-11 02:21:20,565 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 811 transitions. Word has length 62 [2021-10-11 02:21:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:20,566 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 811 transitions. [2021-10-11 02:21:20,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:21:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 811 transitions. [2021-10-11 02:21:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-11 02:21:20,568 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:20,568 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:20,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 02:21:20,569 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:20,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:20,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1948743309, now seen corresponding path program 1 times [2021-10-11 02:21:20,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:20,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785522358] [2021-10-11 02:21:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:20,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785522358] [2021-10-11 02:21:20,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559141265] [2021-10-11 02:21:20,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:20,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 02:21:20,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:20,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:21:20,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:21:20,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-11 02:21:20,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076602508] [2021-10-11 02:21:20,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:21:20,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:21:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:21:20,908 INFO L87 Difference]: Start difference. First operand 704 states and 811 transitions. Second operand 4 states. [2021-10-11 02:21:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:20,981 INFO L93 Difference]: Finished difference Result 1164 states and 1337 transitions. [2021-10-11 02:21:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:21:20,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-10-11 02:21:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:20,985 INFO L225 Difference]: With dead ends: 1164 [2021-10-11 02:21:20,985 INFO L226 Difference]: Without dead ends: 536 [2021-10-11 02:21:20,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:21:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-10-11 02:21:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 487. [2021-10-11 02:21:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2021-10-11 02:21:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 556 transitions. [2021-10-11 02:21:21,022 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 556 transitions. Word has length 77 [2021-10-11 02:21:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:21,022 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 556 transitions. [2021-10-11 02:21:21,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:21:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 556 transitions. [2021-10-11 02:21:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-11 02:21:21,024 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:21,024 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:21:21,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:21,246 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash -798186320, now seen corresponding path program 1 times [2021-10-11 02:21:21,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:21,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927664408] [2021-10-11 02:21:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:21:21,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927664408] [2021-10-11 02:21:21,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:21,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:21:21,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151791758] [2021-10-11 02:21:21,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:21:21,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:21:21,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:21:21,377 INFO L87 Difference]: Start difference. First operand 487 states and 556 transitions. Second operand 5 states. [2021-10-11 02:21:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:21,519 INFO L93 Difference]: Finished difference Result 1453 states and 1653 transitions. [2021-10-11 02:21:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:21:21,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2021-10-11 02:21:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:21,525 INFO L225 Difference]: With dead ends: 1453 [2021-10-11 02:21:21,525 INFO L226 Difference]: Without dead ends: 1113 [2021-10-11 02:21:21,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:21:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2021-10-11 02:21:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 848. [2021-10-11 02:21:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2021-10-11 02:21:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 973 transitions. [2021-10-11 02:21:21,620 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 973 transitions. Word has length 79 [2021-10-11 02:21:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:21,621 INFO L481 AbstractCegarLoop]: Abstraction has 848 states and 973 transitions. [2021-10-11 02:21:21,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:21:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 973 transitions. [2021-10-11 02:21:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-11 02:21:21,623 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:21,623 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:21,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 02:21:21,624 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash -203131225, now seen corresponding path program 1 times [2021-10-11 02:21:21,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:21,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142815350] [2021-10-11 02:21:21,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-11 02:21:21,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142815350] [2021-10-11 02:21:21,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:21,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:21:21,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336238905] [2021-10-11 02:21:21,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:21:21,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:21:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:21:21,688 INFO L87 Difference]: Start difference. First operand 848 states and 973 transitions. Second operand 5 states. [2021-10-11 02:21:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:21,837 INFO L93 Difference]: Finished difference Result 1299 states and 1484 transitions. [2021-10-11 02:21:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:21:21,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2021-10-11 02:21:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:21,841 INFO L225 Difference]: With dead ends: 1299 [2021-10-11 02:21:21,841 INFO L226 Difference]: Without dead ends: 615 [2021-10-11 02:21:21,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:21:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-10-11 02:21:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 584. [2021-10-11 02:21:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2021-10-11 02:21:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 666 transitions. [2021-10-11 02:21:21,894 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 666 transitions. Word has length 100 [2021-10-11 02:21:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:21,895 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 666 transitions. [2021-10-11 02:21:21,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:21:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 666 transitions. [2021-10-11 02:21:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-11 02:21:21,897 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:21,897 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:21,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 02:21:21,897 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1486546352, now seen corresponding path program 1 times [2021-10-11 02:21:21,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:21,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28494597] [2021-10-11 02:21:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-11 02:21:21,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28494597] [2021-10-11 02:21:21,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:21,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:21:21,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063649443] [2021-10-11 02:21:21,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:21:21,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:21:21,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:21,956 INFO L87 Difference]: Start difference. First operand 584 states and 666 transitions. Second operand 3 states. [2021-10-11 02:21:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:22,018 INFO L93 Difference]: Finished difference Result 982 states and 1117 transitions. [2021-10-11 02:21:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:21:22,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-10-11 02:21:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:22,023 INFO L225 Difference]: With dead ends: 982 [2021-10-11 02:21:22,023 INFO L226 Difference]: Without dead ends: 562 [2021-10-11 02:21:22,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:21:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-11 02:21:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 550. [2021-10-11 02:21:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2021-10-11 02:21:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 625 transitions. [2021-10-11 02:21:22,072 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 625 transitions. Word has length 101 [2021-10-11 02:21:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:22,073 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 625 transitions. [2021-10-11 02:21:22,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:21:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 625 transitions. [2021-10-11 02:21:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-11 02:21:22,075 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:22,075 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:22,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-11 02:21:22,075 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2048088721, now seen corresponding path program 1 times [2021-10-11 02:21:22,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:22,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817650136] [2021-10-11 02:21:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 02:21:22,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817650136] [2021-10-11 02:21:22,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:21:22,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:21:22,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42070095] [2021-10-11 02:21:22,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:21:22,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:21:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:22,167 INFO L87 Difference]: Start difference. First operand 550 states and 625 transitions. Second operand 4 states. [2021-10-11 02:21:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:22,268 INFO L93 Difference]: Finished difference Result 793 states and 891 transitions. [2021-10-11 02:21:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:21:22,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2021-10-11 02:21:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:22,269 INFO L225 Difference]: With dead ends: 793 [2021-10-11 02:21:22,269 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:21:22,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:21:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:21:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:21:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:21:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:21:22,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2021-10-11 02:21:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:22,271 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:21:22,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:21:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:21:22,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:21:22,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 02:21:22,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:21:22,617 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 85 [2021-10-11 02:21:22,787 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 103 [2021-10-11 02:21:22,937 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 100 [2021-10-11 02:21:23,184 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-10-11 02:21:24,170 WARN L197 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2021-10-11 02:21:24,453 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-10-11 02:21:24,726 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2021-10-11 02:21:25,137 WARN L197 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-10-11 02:21:25,536 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-10-11 02:21:25,805 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2021-10-11 02:21:26,230 WARN L197 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2021-10-11 02:21:26,421 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2021-10-11 02:21:26,589 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2021-10-11 02:21:27,312 WARN L197 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-10-11 02:21:27,616 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-10-11 02:21:27,787 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2021-10-11 02:21:28,540 WARN L197 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2021-10-11 02:21:29,009 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-10-11 02:21:29,274 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2021-10-11 02:21:29,594 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-10-11 02:21:29,648 INFO L258 CegarLoopResult]: At program point L564(lines 564 573) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,649 INFO L258 CegarLoopResult]: At program point L564-1(lines 564 573) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,649 INFO L262 CegarLoopResult]: For program point L300(lines 300 307) no Hoare annotation was computed. [2021-10-11 02:21:29,649 INFO L258 CegarLoopResult]: At program point L169(lines 157 171) the Hoare annotation is: (and (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= 0 ~t2_st~0) (<= ~t1_pc~0 0) (<= ~token~0 ~local~0) (<= ~m_pc~0 0) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= ~E_1~0 2) (<= 2 ~E_M~0)) [2021-10-11 02:21:29,649 INFO L258 CegarLoopResult]: At program point L169-1(lines 157 171) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse13 (= 0 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse0 (= 2 ~t2_st~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse9 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse10 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse12 .cse3 .cse14 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10))) [2021-10-11 02:21:29,650 INFO L258 CegarLoopResult]: At program point L169-2(lines 157 171) the Hoare annotation is: (let ((.cse13 (+ ~local~0 1))) (let ((.cse4 (= ~t2_pc~0 1)) (.cse0 (<= ~token~0 .cse13)) (.cse1 (< 0 ~t1_st~0)) (.cse2 (= ~E_1~0 2)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (<= .cse13 ~token~0)) (.cse6 (= ~t1_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ~t2_st~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (= 0 ~t2_pc~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse11)))) [2021-10-11 02:21:29,650 INFO L258 CegarLoopResult]: At program point L169-3(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (= 2 ~t1_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (or (= ~E_M~0 1) (<= 2 ~E_M~0))) (.cse5 (< 0 ~t2_st~0)) (.cse6 (= ~E_1~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ~token~0 (+ ~local~0 2)) .cse0 .cse1 (< (+ ~local~0 1) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,650 INFO L258 CegarLoopResult]: At program point L169-4(lines 157 171) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~E_1~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8))) [2021-10-11 02:21:29,651 INFO L258 CegarLoopResult]: At program point L169-5(lines 157 171) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,651 INFO L258 CegarLoopResult]: At program point L207(lines 195 209) the Hoare annotation is: (and (<= 2 ~E_2~0) (<= ~t1_pc~0 0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= 0 ~t2_pc~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~m_pc~0 0) (<= ~local~0 ~token~0) (<= 2 ~E_M~0)) [2021-10-11 02:21:29,651 INFO L258 CegarLoopResult]: At program point L207-1(lines 195 209) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse6 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse10 (= ~t2_pc~0 1)) (.cse0 (= 2 ~t2_st~0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse11 (= 0 ~t2_st~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse12 (= 0 ~t2_pc~0)) (.cse9 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse8) (and .cse3 .cse13 .cse4 .cse6 .cse9 .cse10 .cse0 .cse14 .cse2 .cse15 .cse5 .cse7 .cse8) (and .cse14 .cse2 .cse15 .cse3 .cse11 .cse13 .cse4 .cse5 .cse12 .cse9 .cse7 .cse8))) [2021-10-11 02:21:29,651 INFO L258 CegarLoopResult]: At program point L207-2(lines 195 209) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse4 (= ~E_2~0 1)) (.cse0 (<= ~token~0 .cse12)) (.cse1 (<= .cse12 ~token~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (= ~m_pc~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~E_1~0 2)) (.cse10 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) .cse7 .cse8 .cse9 .cse10) (and .cse4 (let ((.cse11 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse7 .cse9 .cse8 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11))))))) [2021-10-11 02:21:29,652 INFO L258 CegarLoopResult]: At program point L207-3(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (or (= ~E_M~0 1) (<= 2 ~E_M~0))) (.cse6 (< 0 ~t2_st~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9) (and (<= ~token~0 (+ ~local~0 2)) .cse0 .cse1 .cse2 (< (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,652 INFO L258 CegarLoopResult]: At program point L207-4(lines 195 209) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ~E_1~0 2)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,652 INFO L262 CegarLoopResult]: For program point L42(lines 42 50) no Hoare annotation was computed. [2021-10-11 02:21:29,652 INFO L258 CegarLoopResult]: At program point L207-5(lines 195 209) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,653 INFO L262 CegarLoopResult]: For program point L177(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,653 INFO L262 CegarLoopResult]: For program point L177-2(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,653 INFO L262 CegarLoopResult]: For program point L177-3(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,653 INFO L262 CegarLoopResult]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-11 02:21:29,653 INFO L262 CegarLoopResult]: For program point L177-5(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,653 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-11 02:21:29,653 INFO L262 CegarLoopResult]: For program point L177-6(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L177-8(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L177-9(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L177-11(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L177-12(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L177-14(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L177-15(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L177-17(lines 177 186) no Hoare annotation was computed. [2021-10-11 02:21:29,654 INFO L262 CegarLoopResult]: For program point L178(lines 178 183) no Hoare annotation was computed. [2021-10-11 02:21:29,655 INFO L262 CegarLoopResult]: For program point L178-1(lines 178 183) no Hoare annotation was computed. [2021-10-11 02:21:29,655 INFO L262 CegarLoopResult]: For program point L178-2(lines 178 183) no Hoare annotation was computed. [2021-10-11 02:21:29,655 INFO L262 CegarLoopResult]: For program point L178-3(lines 178 183) no Hoare annotation was computed. [2021-10-11 02:21:29,655 INFO L258 CegarLoopResult]: At program point L46(lines 41 80) the Hoare annotation is: (and (<= ~token~0 (+ ~local~0 2)) (<= 2 ~E_2~0) (< (+ ~local~0 1) ~token~0) (= 2 ~t1_st~0) (not (= ~m_st~0 0)) (= ~E_1~0 2) (= ~t2_pc~0 1) (= 2 ~t2_st~0) (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 1) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= 2 ~E_M~0)) [2021-10-11 02:21:29,655 INFO L262 CegarLoopResult]: For program point L178-4(lines 178 183) no Hoare annotation was computed. [2021-10-11 02:21:29,655 INFO L262 CegarLoopResult]: For program point L178-5(lines 178 183) no Hoare annotation was computed. [2021-10-11 02:21:29,656 INFO L258 CegarLoopResult]: At program point L311(lines 273 325) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse22 (+ ~local~0 1))) (let ((.cse5 (= 0 ~t2_pc~0)) (.cse17 (<= ~token~0 .cse22)) (.cse19 (<= .cse22 ~token~0)) (.cse8 (= 0 ~t2_st~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse9 (<= ~m_pc~0 0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse18 (not .cse3)) (.cse21 (= 2 ~t2_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_2~0)) (.cse1 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 1)) (.cse4 (= ~E_1~0 2)) (.cse12 (<= 2 ~E_M~0)) (.cse20 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse13 .cse2 .cse5 .cse14 .cse7 .cse15 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse8 .cse16 .cse10 .cse11 .cse12) (and .cse17 .cse0 .cse1 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse16 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse18 .cse4 .cse20 .cse21 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse21 .cse6 .cse0 .cse1 .cse16 .cse4 .cse18 .cse12 .cse20) (and .cse21 .cse6 .cse7 .cse0 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse12 .cse20) (and .cse6 .cse7 .cse0 .cse8 .cse2 .cse16 .cse10 .cse18 .cse4 .cse5 .cse11 .cse12) (and .cse17 .cse0 .cse1 .cse18 .cse4 .cse20 .cse19 .cse6 .cse7 .cse8 .cse16 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse20 .cse21 .cse14 .cse7 .cse15 .cse9 .cse10 .cse11 .cse12) (and .cse21 .cse6 .cse0 .cse16 .cse2 .cse10 .cse4 .cse18 .cse12 .cse20) (and (<= ~token~0 (+ ~local~0 2)) .cse21 .cse6 .cse14 .cse0 (< .cse22 ~token~0) .cse1 .cse16 .cse4 .cse12 .cse20)))) [2021-10-11 02:21:29,656 INFO L262 CegarLoopResult]: For program point L278(lines 278 282) no Hoare annotation was computed. [2021-10-11 02:21:29,656 INFO L262 CegarLoopResult]: For program point L278-1(lines 273 325) no Hoare annotation was computed. [2021-10-11 02:21:29,656 INFO L262 CegarLoopResult]: For program point L577(lines 577 581) no Hoare annotation was computed. [2021-10-11 02:21:29,656 INFO L258 CegarLoopResult]: At program point L545-1(lines 370 582) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0))) (let ((.cse1 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 2 ~t2_st~0)) (.cse9 (= ~t1_pc~0 1)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (<= 2 ~E_2~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse12 (not .cse2)) (.cse3 (= ~E_1~0 2)) (.cse7 (<= 2 ~E_M~0)) (.cse13 (= ~t2_pc~0 1))) (or (and .cse0 (<= ~t1_pc~0 0) .cse1 .cse2 (= 0 ~t2_pc~0) .cse3 .cse4 .cse5 (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~m_pc~0 0) .cse6 .cse7) (and .cse8 .cse9 .cse5 .cse0 .cse1 .cse10 .cse6 .cse11 .cse12 .cse3 .cse7 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse0 (= 2 ~t1_st~0) .cse10 .cse11 .cse12 .cse3 .cse7 .cse13)))) [2021-10-11 02:21:29,657 INFO L262 CegarLoopResult]: For program point L314(lines 314 321) no Hoare annotation was computed. [2021-10-11 02:21:29,657 INFO L258 CegarLoopResult]: At program point L283(lines 273 325) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse17 (+ ~local~0 1))) (let ((.cse4 (= 0 ~t2_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= ~t1_st~0 0)) (.cse9 (<= ~m_pc~0 0)) (.cse20 (<= ~token~0 .cse17)) (.cse22 (<= .cse17 ~token~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= 0 ~t2_st~0)) (.cse1 (= 2 ~t1_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_2~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse21 (not .cse3)) (.cse5 (= ~E_1~0 2)) (.cse12 (<= 2 ~E_M~0)) (.cse19 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~token~0 (+ ~local~0 2)) .cse16 .cse6 .cse14 (< .cse17 ~token~0) .cse0 .cse1 .cse18 .cse11 .cse5 .cse12 .cse19) (and .cse0 .cse13 .cse2 .cse4 .cse14 .cse7 .cse15 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse8 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse19 .cse16 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse5 .cse4 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse21 .cse5 .cse19 .cse16 .cse14 .cse15 .cse18 .cse10 .cse11 .cse12) (and .cse6 .cse7 .cse0 .cse8 .cse2 .cse18 .cse10 .cse21 .cse5 .cse4 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse5 .cse19 .cse16 .cse14 .cse7 .cse15 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse5 .cse19 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse16 .cse6 .cse0 .cse1 .cse18 .cse11 .cse21 .cse5 .cse12 .cse19) (and .cse16 .cse6 .cse0 .cse2 .cse18 .cse10 .cse11 .cse21 .cse5 .cse12 .cse19)))) [2021-10-11 02:21:29,657 INFO L265 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-11 02:21:29,657 INFO L262 CegarLoopResult]: For program point L86(lines 86 94) no Hoare annotation was computed. [2021-10-11 02:21:29,658 INFO L265 CegarLoopResult]: At program point L583(lines 530 588) the Hoare annotation is: true [2021-10-11 02:21:29,658 INFO L262 CegarLoopResult]: For program point L286(lines 286 293) no Hoare annotation was computed. [2021-10-11 02:21:29,658 INFO L258 CegarLoopResult]: At program point L188(lines 176 190) the Hoare annotation is: (and (<= 2 ~E_2~0) (<= ~t1_pc~0 0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= 0 ~t2_pc~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~m_pc~0 0) (<= ~local~0 ~token~0) (<= 2 ~E_M~0)) [2021-10-11 02:21:29,658 INFO L258 CegarLoopResult]: At program point L188-1(lines 176 190) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse13 (= 0 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse0 (= 2 ~t2_st~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse9 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse10 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse12 .cse3 .cse14 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10))) [2021-10-11 02:21:29,658 INFO L258 CegarLoopResult]: At program point L188-2(lines 176 190) the Hoare annotation is: (let ((.cse13 (+ ~local~0 1))) (let ((.cse0 (<= ~token~0 .cse13)) (.cse1 (< 0 ~t1_st~0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse4 (<= .cse13 ~token~0)) (.cse5 (= ~t1_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 1)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (= 0 ~t2_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 (= 2 ~t2_st~0) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2021-10-11 02:21:29,659 INFO L262 CegarLoopResult]: For program point L122(lines 122 130) no Hoare annotation was computed. [2021-10-11 02:21:29,659 INFO L258 CegarLoopResult]: At program point L89(lines 89 93) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0))) (let ((.cse3 (<= ~t1_pc~0 0)) (.cse12 (= 0 ~t2_pc~0)) (.cse17 (<= ~m_pc~0 0)) (.cse0 (= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (< 0 ~t1_st~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse9 (= ~E_1~0 2)) (.cse8 (not .cse16)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse4 (= ~m_pc~0 1)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse5 .cse9 .cse12 .cse8 .cse13 .cse14 .cse15 .cse4 .cse6 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse14 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse15 .cse4 .cse6 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse16 .cse9 .cse11 .cse0 .cse14 .cse17 .cse6 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse16 .cse12 .cse9 .cse14 .cse15 .cse17 .cse6 .cse7 .cse10) (and .cse0 .cse13 .cse1 .cse2 .cse5 .cse4 .cse6 .cse9 .cse7 .cse10 .cse8 .cse11) (and .cse1 .cse2 .cse5 .cse9 .cse8 .cse11 .cse13 .cse14 .cse15 .cse4 .cse6 .cse7 .cse10)))) [2021-10-11 02:21:29,659 INFO L258 CegarLoopResult]: At program point L188-3(lines 176 190) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (or (= ~E_M~0 1) (<= 2 ~E_M~0))) (.cse6 (< 0 ~t2_st~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9) (and (<= ~token~0 (+ ~local~0 2)) .cse0 .cse1 .cse2 (< (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,659 INFO L258 CegarLoopResult]: At program point L188-4(lines 176 190) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ~E_1~0 2)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8))) [2021-10-11 02:21:29,660 INFO L258 CegarLoopResult]: At program point L188-5(lines 176 190) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-11 02:21:29,660 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:21:29,660 INFO L262 CegarLoopResult]: For program point L158(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,660 INFO L258 CegarLoopResult]: At program point L125(lines 125 129) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) (<= 2 ~E_2~0) (= 2 ~t1_st~0) (= ~E_1~0 2) (not (= ~m_st~0 0)) (= ~t2_pc~0 1) (<= .cse0 ~token~0) (= ~t1_pc~0 1) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 1) (< 0 ~t2_st~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= 2 ~E_M~0))) [2021-10-11 02:21:29,660 INFO L262 CegarLoopResult]: For program point L158-2(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,660 INFO L262 CegarLoopResult]: For program point L158-3(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-5(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-6(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-8(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-9(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-11(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-12(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-14(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,661 INFO L262 CegarLoopResult]: For program point L158-15(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,662 INFO L262 CegarLoopResult]: For program point L158-17(lines 158 167) no Hoare annotation was computed. [2021-10-11 02:21:29,662 INFO L262 CegarLoopResult]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-11 02:21:29,662 INFO L262 CegarLoopResult]: For program point L159-1(lines 159 164) no Hoare annotation was computed. [2021-10-11 02:21:29,662 INFO L262 CegarLoopResult]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-11 02:21:29,662 INFO L262 CegarLoopResult]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-11 02:21:29,662 INFO L262 CegarLoopResult]: For program point L159-4(lines 159 164) no Hoare annotation was computed. [2021-10-11 02:21:29,662 INFO L262 CegarLoopResult]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-11 02:21:29,663 INFO L258 CegarLoopResult]: At program point L326(lines 267 331) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~E_1~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= 2 ~t1_st~0) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-10-11 02:21:29,663 INFO L262 CegarLoopResult]: For program point L196(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,663 INFO L262 CegarLoopResult]: For program point L196-2(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,663 INFO L262 CegarLoopResult]: For program point L196-3(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,663 INFO L258 CegarLoopResult]: At program point L97-1(lines 85 116) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 0))) (let ((.cse19 (+ ~local~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (<= 2 ~E_2~0)) (.cse17 (= ~m_pc~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse18 (not .cse6)) (.cse8 (= ~E_1~0 2)) (.cse10 (<= 2 ~E_M~0))) (let ((.cse3 (< 0 ~t1_st~0)) (.cse4 (<= ~m_pc~0 0)) (.cse0 (= 2 ~t2_st~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse16 (or (and .cse1 (= ~m_st~0 ~E_1~0) .cse2 .cse17 .cse9 .cse8 .cse10) (and (= ~t1_pc~0 1) .cse1 .cse2 .cse17 .cse9 .cse18 .cse8 .cse10))) (.cse7 (<= ~local~0 ~token~0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (<= ~token~0 .cse19)) (.cse15 (<= .cse19 ~token~0)) (.cse12 (= 0 ~t2_st~0)) (.cse11 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse12 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse14 .cse15 .cse12 .cse16 .cse13) (and .cse0 .cse2 .cse17 .cse5 .cse7 .cse18 .cse10 .cse9 .cse8 .cse11) (and .cse12 .cse5 .cse16 .cse7 .cse13) (and .cse14 .cse15 .cse1 .cse12 .cse2 .cse17 .cse18 .cse10 .cse9 .cse8 .cse11))))) [2021-10-11 02:21:29,663 INFO L262 CegarLoopResult]: For program point L196-5(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-6(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-8(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-9(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-11(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-12(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-14(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-15(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L196-17(lines 196 205) no Hoare annotation was computed. [2021-10-11 02:21:29,664 INFO L262 CegarLoopResult]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-10-11 02:21:29,665 INFO L262 CegarLoopResult]: For program point L197-1(lines 197 202) no Hoare annotation was computed. [2021-10-11 02:21:29,665 INFO L262 CegarLoopResult]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-10-11 02:21:29,665 INFO L262 CegarLoopResult]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-10-11 02:21:29,665 INFO L262 CegarLoopResult]: For program point L197-4(lines 197 202) no Hoare annotation was computed. [2021-10-11 02:21:29,665 INFO L262 CegarLoopResult]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-10-11 02:21:29,665 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-11 02:21:29,666 INFO L258 CegarLoopResult]: At program point L297(lines 273 325) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse17 (+ ~local~0 1))) (let ((.cse5 (= 0 ~t2_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= ~t1_st~0 0)) (.cse9 (<= ~m_pc~0 0)) (.cse20 (<= ~token~0 .cse17)) (.cse22 (<= .cse17 ~token~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= 0 ~t2_st~0)) (.cse1 (= 2 ~t1_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_2~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse21 (not .cse3)) (.cse4 (= ~E_1~0 2)) (.cse12 (<= 2 ~E_M~0)) (.cse19 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse5 .cse4 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~token~0 (+ ~local~0 2)) .cse16 .cse6 .cse14 (< .cse17 ~token~0) .cse0 .cse1 .cse18 .cse11 .cse4 .cse12 .cse19) (and .cse0 .cse13 .cse2 .cse5 .cse14 .cse7 .cse15 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse8 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse16 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse4 .cse5 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse21 .cse4 .cse19 .cse16 .cse14 .cse15 .cse18 .cse10 .cse11 .cse12) (and .cse6 .cse7 .cse0 .cse8 .cse2 .cse18 .cse10 .cse21 .cse4 .cse5 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse19 .cse16 .cse14 .cse7 .cse15 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse4 .cse19 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse16 .cse6 .cse0 .cse1 .cse18 .cse11 .cse21 .cse4 .cse12 .cse19) (and .cse16 .cse6 .cse0 .cse2 .cse18 .cse10 .cse11 .cse21 .cse4 .cse12 .cse19)))) [2021-10-11 02:21:29,666 INFO L258 CegarLoopResult]: At program point L133-1(lines 121 152) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 0))) (let ((.cse0 (+ ~local~0 1)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse10 (= 0 ~t2_pc~0)) (.cse14 (= ~t1_st~0 0)) (.cse17 (<= ~m_pc~0 0)) (.cse15 (< 0 ~t2_st~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse1 (= ~t1_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ~E_1~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse9 (not .cse18))) (or (and (<= ~token~0 .cse0) (<= .cse0 ~token~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse11 .cse12 .cse10 .cse13 .cse2 .cse14 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse5 .cse15 .cse16 .cse7 .cse8) (and (<= ~token~0 (+ ~local~0 2)) .cse1 .cse13 .cse3 (< .cse0 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse12 .cse17 .cse18 .cse16 .cse6 .cse10 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse11 .cse12 .cse18 .cse6 .cse10 .cse13 .cse2 .cse14 .cse17 .cse15 .cse16 .cse7 .cse8) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2021-10-11 02:21:29,667 INFO L258 CegarLoopResult]: At program point L67(lines 41 80) the Hoare annotation is: (let ((.cse1 (<= ~t1_pc~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= 0 ~t2_st~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse9 (<= ~m_pc~0 0)) (.cse10 (<= ~local~0 ~token~0)) (.cse3 (= 0 ~t2_pc~0)) (.cse0 (<= 2 ~E_2~0)) (.cse15 (= 2 ~t1_st~0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~E_1~0 2)) (.cse16 (= ~t2_pc~0 1)) (.cse13 (= 2 ~t2_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse2 .cse9 .cse10 .cse5 .cse4 .cse11 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse16 .cse13 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse14 .cse0 .cse8 .cse15 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12) (and (<= ~token~0 (+ ~local~0 2)) .cse0 (< (+ ~local~0 1) ~token~0) .cse15 .cse4 .cse5 .cse16 .cse13 .cse14 .cse6 (= ~m_pc~0 1) .cse11 .cse12))) [2021-10-11 02:21:29,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:21:29 BoogieIcfgContainer [2021-10-11 02:21:29,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:21:29,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:21:29,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:21:29,736 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:21:29,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:21:13" (3/4) ... [2021-10-11 02:21:29,740 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:21:29,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 104 nodes and edges [2021-10-11 02:21:29,761 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-10-11 02:21:29,762 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-11 02:21:29,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:21:29,874 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01440e63-e84a-4bf9-87a7-1d322a3382b7/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:21:29,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:21:29,876 INFO L168 Benchmark]: Toolchain (without parser) took 18535.21 ms. Allocated memory was 102.8 MB in the beginning and 398.5 MB in the end (delta: 295.7 MB). Free memory was 64.0 MB in the beginning and 326.1 MB in the end (delta: -262.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:29,876 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 102.8 MB. Free memory is still 80.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:21:29,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.81 ms. Allocated memory is still 102.8 MB. Free memory was 63.8 MB in the beginning and 74.9 MB in the end (delta: -11.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:29,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.25 ms. Allocated memory is still 102.8 MB. Free memory was 74.9 MB in the beginning and 72.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:29,877 INFO L168 Benchmark]: Boogie Preprocessor took 60.95 ms. Allocated memory is still 102.8 MB. Free memory was 72.0 MB in the beginning and 69.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:29,878 INFO L168 Benchmark]: RCFGBuilder took 1823.20 ms. Allocated memory was 102.8 MB in the beginning and 132.1 MB in the end (delta: 29.4 MB). Free memory was 69.0 MB in the beginning and 102.2 MB in the end (delta: -33.2 MB). Peak memory consumption was 59.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:29,878 INFO L168 Benchmark]: TraceAbstraction took 16097.14 ms. Allocated memory was 132.1 MB in the beginning and 398.5 MB in the end (delta: 266.3 MB). Free memory was 102.2 MB in the beginning and 341.8 MB in the end (delta: -239.6 MB). Peak memory consumption was 240.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:29,878 INFO L168 Benchmark]: Witness Printer took 139.05 ms. Allocated memory is still 398.5 MB. Free memory was 341.8 MB in the beginning and 326.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:29,881 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.25 ms. Allocated memory is still 102.8 MB. Free memory is still 80.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.81 ms. Allocated memory is still 102.8 MB. Free memory was 63.8 MB in the beginning and 74.9 MB in the end (delta: -11.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 58.25 ms. Allocated memory is still 102.8 MB. Free memory was 74.9 MB in the beginning and 72.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.95 ms. Allocated memory is still 102.8 MB. Free memory was 72.0 MB in the beginning and 69.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1823.20 ms. Allocated memory was 102.8 MB in the beginning and 132.1 MB in the end (delta: 29.4 MB). Free memory was 69.0 MB in the beginning and 102.2 MB in the end (delta: -33.2 MB). Peak memory consumption was 59.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16097.14 ms. Allocated memory was 132.1 MB in the beginning and 398.5 MB in the end (delta: 266.3 MB). Free memory was 102.2 MB in the beginning and 341.8 MB in the end (delta: -239.6 MB). Peak memory consumption was 240.9 MB. Max. memory is 16.1 GB. * Witness Printer took 139.05 ms. Allocated memory is still 398.5 MB. Free memory was 341.8 MB in the beginning and 326.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((token <= local + 1 && 0 < t1_st) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) || ((((((((((((token <= local + 1 && 0 < t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 0 < t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((token <= local + 2 && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && local + 1 < token) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || ((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && local <= token) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || (((((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && 2 == t1_st) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((2 == t2_st && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && t1_pc <= 0) && token <= local) && local <= token) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || ((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || (((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && token <= local) && m_pc <= 0) && local <= token) && E_1 == 2) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && 2 <= E_2) && 0 == t2_st) && 2 == t1_st) && token <= local) && m_pc <= 0) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 2 && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((2 == t2_st && 2 <= E_2) && 0 < t1_st) && t1_pc <= 0) && m_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || ((((((((((((2 <= E_2 && 0 < t1_st) && token <= local) && E_1 == 2) && 0 == t2_pc) && !(m_st == 0)) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 0 < t1_st) && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 0 < t1_st) && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 0 < t1_st) && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 0 < t1_st) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1)) || ((((((((((((2 <= E_2 && 0 < t1_st) && token <= local) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || (((((((((((token <= local + 2 && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((((((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && 0 == t2_pc) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && m_pc == 1) && 0 < t2_st) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((token <= local + 2 && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && 0 == t2_pc)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 < t2_st) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((t1_pc == 1 && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || ((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && t2_pc == 1) || (((((((((((token <= local + 2 && t1_pc == 1) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && t2_pc == 1)) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && t2_pc == 1)) || ((((((((((token <= local + 2 && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((token <= local + 1 && 0 < t1_st) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && local + 1 <= token) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) || ((((((((((((token <= local + 1 && 0 < t1_st) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 0 < t1_st) && E_1 == 2) && 0 == t2_pc) && !(m_st == 0)) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && 0 < t2_st) && !(tmp == 0)) && 2 <= E_M - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && local <= token) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || (((((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && 2 == t1_st) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((2 == t2_st && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && t1_pc <= 0) && token <= local) && local <= token) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((__retres1 == 0 && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && 0 == t2_pc) && E_1 == 2) && 2 <= E_M - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((token <= local + 2 && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && local + 1 < token) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || ((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((((((2 == t2_st && __retres1 == 0) && 2 <= E_2) && 0 < t1_st) && m_pc <= 0) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1) || (((((((((((__retres1 == 0 && 2 <= E_2) && 0 == t2_st) && 0 < t1_st) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || ((((token <= local + 1 && local + 1 <= token) && 0 == t2_st) && (((((((__retres1 == 0 && m_st == E_1) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) || (((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M))) && 0 == t2_pc)) || (((((((((2 == t2_st && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1)) || ((((0 == t2_st && token <= local) && (((((((__retres1 == 0 && m_st == E_1) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) || (((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M))) && local <= token) && 0 == t2_pc)) || ((((((((((token <= local + 1 && local + 1 <= token) && __retres1 == 0) && 0 == t2_st) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && 2 <= E_M) && __retres1 == 0) && !(m_st == 0)) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && __retres1 == 0) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || (((((((((((token <= local + 2 && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || ((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) || (E_2 == 1 && (((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && !(__retres1 == 0)) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || ((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1))) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((token <= local + 2 && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && local <= token) && __retres1 == 0) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || (((((((((t1_pc == 1 && __retres1 == 0) && 0 == t2_st) && 2 <= E_2) && token <= local) && local <= token) && !(tmp == 0)) && 0 == t2_pc) && !(m_st == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && __retres1 == 0) && !(m_st == 0)) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.5s, OverallIterations: 23, TraceHistogramMax: 4, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3520 SDtfs, 3617 SDslu, 3722 SDs, 0 SdLazy, 733 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 630 GetRequests, 551 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1161occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 1295 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 192 NumberOfFragments, 4649 HoareAnnotationTreeSize, 33 FomulaSimplifications, 32156 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 33 FomulaSimplificationsInter, 10240 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1622 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 238260 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1217 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 502/510 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...