./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 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/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_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs --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.1-dev-5709675 [2021-10-16 02:25:25,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:25:25,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:25:25,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:25:25,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:25:25,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:25:25,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:25:25,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:25:25,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:25:25,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:25:25,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:25:25,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:25:25,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:25:25,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:25:25,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:25:25,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:25:25,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:25:25,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:25:25,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:25:25,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:25:25,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:25:25,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:25:25,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:25:25,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:25:25,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:25:25,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:25:25,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:25:25,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:25:25,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:25:25,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:25:25,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:25:25,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:25:25,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:25:25,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:25:25,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:25:25,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:25:25,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:25:25,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:25:25,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:25:25,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:25:25,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:25:25,324 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-16 02:25:25,355 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:25:25,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:25:25,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:25:25,357 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:25:25,358 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:25:25,358 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:25:25,358 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:25:25,359 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:25:25,359 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:25:25,359 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:25:25,360 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:25:25,360 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:25:25,360 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:25:25,360 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:25:25,361 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:25:25,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:25:25,362 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:25:25,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:25:25,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:25:25,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:25:25,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 02:25:25,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:25:25,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 02:25:25,363 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:25:25,363 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:25:25,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 02:25:25,364 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:25:25,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 02:25:25,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:25:25,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:25:25,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:25:25,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:25:25,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:25:25,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 02:25:25,365 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:25:25,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:25:25,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 02:25:25,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:25:25,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:25:25,366 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_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/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_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs 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-16 02:25:25,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:25:25,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:25:25,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:25:25,773 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:25:25,774 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:25:25,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-16 02:25:25,867 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/data/7d2160a18/473fdd1884f040d48a6a138e5569b82f/FLAGddcf5c423 [2021-10-16 02:25:26,591 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:25:26,598 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-16 02:25:26,621 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/data/7d2160a18/473fdd1884f040d48a6a138e5569b82f/FLAGddcf5c423 [2021-10-16 02:25:26,904 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/data/7d2160a18/473fdd1884f040d48a6a138e5569b82f [2021-10-16 02:25:26,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:25:26,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:25:26,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:25:26,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:25:26,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:25:26,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:25:26" (1/1) ... [2021-10-16 02:25:26,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e612b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:26, skipping insertion in model container [2021-10-16 02:25:26,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:25:26" (1/1) ... [2021-10-16 02:25:26,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:25:26,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:25:27,157 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-16 02:25:27,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:25:27,300 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:25:27,317 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-16 02:25:27,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:25:27,417 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:25:27,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27 WrapperNode [2021-10-16 02:25:27,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:25:27,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:25:27,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:25:27,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:25:27,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:25:27,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:25:27,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:25:27,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:25:27,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:25:27,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:25:27,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:25:27,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:25:27,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (1/1) ... [2021-10-16 02:25:27,634 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:25:27,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:25:27,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:25:27,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:25:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:25:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:25:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:25:27,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:25:29,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:25:29,562 INFO L299 CfgBuilder]: Removed 103 assume(true) statements. [2021-10-16 02:25:29,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:25:29 BoogieIcfgContainer [2021-10-16 02:25:29,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:25:29,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:25:29,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:25:29,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:25:29,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:25:26" (1/3) ... [2021-10-16 02:25:29,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6d17a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:25:29, skipping insertion in model container [2021-10-16 02:25:29,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:25:27" (2/3) ... [2021-10-16 02:25:29,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6d17a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:25:29, skipping insertion in model container [2021-10-16 02:25:29,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:25:29" (3/3) ... [2021-10-16 02:25:29,577 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-10-16 02:25:29,584 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:25:29,584 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-16 02:25:29,644 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:25:29,652 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-16 02:25:29,652 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-16 02:25:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-16 02:25:29,681 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:29,682 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:25:29,683 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:29,690 INFO L82 PathProgramCache]: Analyzing trace with hash -94103792, now seen corresponding path program 1 times [2021-10-16 02:25:29,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:29,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611416726] [2021-10-16 02:25:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:29,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:29,967 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-16 02:25:29,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:29,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611416726] [2021-10-16 02:25:29,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611416726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:29,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:29,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:25:29,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769063427] [2021-10-16 02:25:29,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:25:29,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:25:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:29,998 INFO L87 Difference]: Start difference. First operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:30,159 INFO L93 Difference]: Finished difference Result 275 states and 422 transitions. [2021-10-16 02:25:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:25:30,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-16 02:25:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:30,181 INFO L225 Difference]: With dead ends: 275 [2021-10-16 02:25:30,181 INFO L226 Difference]: Without dead ends: 173 [2021-10-16 02:25:30,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-16 02:25:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2021-10-16 02:25:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-10-16 02:25:30,279 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 19 [2021-10-16 02:25:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:30,280 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-10-16 02:25:30,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-10-16 02:25:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:25:30,285 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:30,287 INFO L512 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-16 02:25:30,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:25:30,288 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash -903760834, now seen corresponding path program 1 times [2021-10-16 02:25:30,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:30,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184414153] [2021-10-16 02:25:30,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:30,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:30,366 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-16 02:25:30,366 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:30,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184414153] [2021-10-16 02:25:30,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184414153] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:30,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:30,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:30,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808197204] [2021-10-16 02:25:30,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:30,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:30,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:30,371 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:30,528 INFO L93 Difference]: Finished difference Result 514 states and 747 transitions. [2021-10-16 02:25:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:25:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:30,535 INFO L225 Difference]: With dead ends: 514 [2021-10-16 02:25:30,535 INFO L226 Difference]: Without dead ends: 356 [2021-10-16 02:25:30,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-16 02:25:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 279. [2021-10-16 02:25:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4388489208633093) internal successors, (400), 278 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 400 transitions. [2021-10-16 02:25:30,569 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 400 transitions. Word has length 36 [2021-10-16 02:25:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:30,570 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 400 transitions. [2021-10-16 02:25:30,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 400 transitions. [2021-10-16 02:25:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:25:30,574 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:30,574 INFO L512 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-16 02:25:30,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 02:25:30,575 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash 15213789, now seen corresponding path program 1 times [2021-10-16 02:25:30,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:30,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854138280] [2021-10-16 02:25:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:30,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:30,704 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-16 02:25:30,705 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:30,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854138280] [2021-10-16 02:25:30,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854138280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:30,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:30,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:30,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069163081] [2021-10-16 02:25:30,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:30,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:30,709 INFO L87 Difference]: Start difference. First operand 279 states and 400 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:30,856 INFO L93 Difference]: Finished difference Result 877 states and 1246 transitions. [2021-10-16 02:25:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:30,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:25:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:30,862 INFO L225 Difference]: With dead ends: 877 [2021-10-16 02:25:30,863 INFO L226 Difference]: Without dead ends: 606 [2021-10-16 02:25:30,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-10-16 02:25:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2021-10-16 02:25:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4057971014492754) internal successors, (679), 483 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 679 transitions. [2021-10-16 02:25:30,928 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 679 transitions. Word has length 36 [2021-10-16 02:25:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:30,929 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 679 transitions. [2021-10-16 02:25:30,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 679 transitions. [2021-10-16 02:25:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-16 02:25:30,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:30,933 INFO L512 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-16 02:25:30,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 02:25:30,934 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:30,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:30,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1264110946, now seen corresponding path program 1 times [2021-10-16 02:25:30,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:30,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106869156] [2021-10-16 02:25:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:30,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:31,079 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-16 02:25:31,079 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:31,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106869156] [2021-10-16 02:25:31,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106869156] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:31,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:31,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:31,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78662456] [2021-10-16 02:25:31,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:25:31,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:25:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:31,083 INFO L87 Difference]: Start difference. First operand 484 states and 679 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:31,144 INFO L93 Difference]: Finished difference Result 844 states and 1214 transitions. [2021-10-16 02:25:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:25:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-16 02:25:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:31,152 INFO L225 Difference]: With dead ends: 844 [2021-10-16 02:25:31,152 INFO L226 Difference]: Without dead ends: 568 [2021-10-16 02:25:31,153 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-10-16 02:25:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 532. [2021-10-16 02:25:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4293785310734464) internal successors, (759), 531 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 759 transitions. [2021-10-16 02:25:31,182 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 759 transitions. Word has length 36 [2021-10-16 02:25:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:31,183 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 759 transitions. [2021-10-16 02:25:31,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 759 transitions. [2021-10-16 02:25:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-16 02:25:31,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:31,187 INFO L512 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] [2021-10-16 02:25:31,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 02:25:31,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash -642955608, now seen corresponding path program 1 times [2021-10-16 02:25:31,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:31,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275635746] [2021-10-16 02:25:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:31,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:31,371 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-16 02:25:31,372 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:31,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275635746] [2021-10-16 02:25:31,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275635746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:31,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:31,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:31,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020651227] [2021-10-16 02:25:31,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:31,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:31,375 INFO L87 Difference]: Start difference. First operand 532 states and 759 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:31,515 INFO L93 Difference]: Finished difference Result 1793 states and 2575 transitions. [2021-10-16 02:25:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:31,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-16 02:25:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:31,525 INFO L225 Difference]: With dead ends: 1793 [2021-10-16 02:25:31,526 INFO L226 Difference]: Without dead ends: 1271 [2021-10-16 02:25:31,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2021-10-16 02:25:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 966. [2021-10-16 02:25:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.4124352331606218) internal successors, (1363), 965 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1363 transitions. [2021-10-16 02:25:31,593 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1363 transitions. Word has length 52 [2021-10-16 02:25:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:31,594 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1363 transitions. [2021-10-16 02:25:31,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1363 transitions. [2021-10-16 02:25:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-16 02:25:31,599 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:31,599 INFO L512 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-16 02:25:31,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 02:25:31,600 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash -650280792, now seen corresponding path program 1 times [2021-10-16 02:25:31,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:31,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285687197] [2021-10-16 02:25:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:31,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:31,741 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-16 02:25:31,746 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:31,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285687197] [2021-10-16 02:25:31,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285687197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:31,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:31,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:31,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747090196] [2021-10-16 02:25:31,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:31,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:31,757 INFO L87 Difference]: Start difference. First operand 966 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:31,994 INFO L93 Difference]: Finished difference Result 3294 states and 4654 transitions. [2021-10-16 02:25:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-10-16 02:25:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:32,012 INFO L225 Difference]: With dead ends: 3294 [2021-10-16 02:25:32,013 INFO L226 Difference]: Without dead ends: 2338 [2021-10-16 02:25:32,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2021-10-16 02:25:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1748. [2021-10-16 02:25:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3892386949055524) internal successors, (2427), 1747 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2427 transitions. [2021-10-16 02:25:32,165 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2427 transitions. Word has length 53 [2021-10-16 02:25:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:32,165 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2427 transitions. [2021-10-16 02:25:32,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2427 transitions. [2021-10-16 02:25:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-16 02:25:32,172 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:32,172 INFO L512 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] [2021-10-16 02:25:32,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 02:25:32,173 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash 128308584, now seen corresponding path program 1 times [2021-10-16 02:25:32,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:32,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950014346] [2021-10-16 02:25:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:32,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:32,279 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-16 02:25:32,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:32,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950014346] [2021-10-16 02:25:32,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950014346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:32,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:32,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:32,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193560943] [2021-10-16 02:25:32,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:25:32,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:32,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:25:32,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:32,282 INFO L87 Difference]: Start difference. First operand 1748 states and 2427 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:32,431 INFO L93 Difference]: Finished difference Result 2978 states and 4160 transitions. [2021-10-16 02:25:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:25:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-16 02:25:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:32,446 INFO L225 Difference]: With dead ends: 2978 [2021-10-16 02:25:32,446 INFO L226 Difference]: Without dead ends: 1892 [2021-10-16 02:25:32,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2021-10-16 02:25:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1748. [2021-10-16 02:25:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3388666285060102) internal successors, (2339), 1747 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2339 transitions. [2021-10-16 02:25:32,617 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2339 transitions. Word has length 54 [2021-10-16 02:25:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:32,617 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2339 transitions. [2021-10-16 02:25:32,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2339 transitions. [2021-10-16 02:25:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-16 02:25:32,623 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:32,623 INFO L512 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] [2021-10-16 02:25:32,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 02:25:32,624 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1101797543, now seen corresponding path program 1 times [2021-10-16 02:25:32,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:32,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226417419] [2021-10-16 02:25:32,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:32,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:32,702 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-16 02:25:32,702 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:32,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226417419] [2021-10-16 02:25:32,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226417419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:32,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:32,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:25:32,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725594058] [2021-10-16 02:25:32,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:25:32,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:25:32,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:32,705 INFO L87 Difference]: Start difference. First operand 1748 states and 2339 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:32,930 INFO L93 Difference]: Finished difference Result 3234 states and 4351 transitions. [2021-10-16 02:25:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:25:32,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-16 02:25:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:32,941 INFO L225 Difference]: With dead ends: 3234 [2021-10-16 02:25:32,942 INFO L226 Difference]: Without dead ends: 1496 [2021-10-16 02:25:32,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-16 02:25:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-10-16 02:25:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1333. [2021-10-16 02:25:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.3543543543543544) internal successors, (1804), 1332 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2021-10-16 02:25:33,046 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 54 [2021-10-16 02:25:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:33,047 INFO L470 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2021-10-16 02:25:33,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2021-10-16 02:25:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-16 02:25:33,051 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:33,052 INFO L512 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-16 02:25:33,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 02:25:33,052 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:33,053 INFO L82 PathProgramCache]: Analyzing trace with hash -711580186, now seen corresponding path program 1 times [2021-10-16 02:25:33,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:33,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522453221] [2021-10-16 02:25:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:33,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:33,181 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-16 02:25:33,181 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:33,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522453221] [2021-10-16 02:25:33,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522453221] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:33,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:33,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:25:33,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614651044] [2021-10-16 02:25:33,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:25:33,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:33,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:25:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:33,184 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:33,415 INFO L93 Difference]: Finished difference Result 2602 states and 3527 transitions. [2021-10-16 02:25:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:25:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-10-16 02:25:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:33,425 INFO L225 Difference]: With dead ends: 2602 [2021-10-16 02:25:33,426 INFO L226 Difference]: Without dead ends: 1280 [2021-10-16 02:25:33,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-16 02:25:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-10-16 02:25:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1125. [2021-10-16 02:25:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3665480427046264) internal successors, (1536), 1124 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1536 transitions. [2021-10-16 02:25:33,519 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1536 transitions. Word has length 56 [2021-10-16 02:25:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:33,519 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1536 transitions. [2021-10-16 02:25:33,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1536 transitions. [2021-10-16 02:25:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-16 02:25:33,524 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:33,524 INFO L512 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] [2021-10-16 02:25:33,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 02:25:33,525 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301811, now seen corresponding path program 1 times [2021-10-16 02:25:33,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:33,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513179664] [2021-10-16 02:25:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:33,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:33,604 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-16 02:25:33,605 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:33,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513179664] [2021-10-16 02:25:33,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513179664] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:33,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:33,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:25:33,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911538039] [2021-10-16 02:25:33,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:25:33,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:33,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:25:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:33,608 INFO L87 Difference]: Start difference. First operand 1125 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:33,817 INFO L93 Difference]: Finished difference Result 2435 states and 3301 transitions. [2021-10-16 02:25:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 02:25:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-16 02:25:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:33,827 INFO L225 Difference]: With dead ends: 2435 [2021-10-16 02:25:33,828 INFO L226 Difference]: Without dead ends: 1321 [2021-10-16 02:25:33,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:25:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-10-16 02:25:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1125. [2021-10-16 02:25:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3487544483985765) internal successors, (1516), 1124 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1516 transitions. [2021-10-16 02:25:33,914 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1516 transitions. Word has length 58 [2021-10-16 02:25:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:33,915 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1516 transitions. [2021-10-16 02:25:33,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1516 transitions. [2021-10-16 02:25:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-16 02:25:33,919 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:33,919 INFO L512 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] [2021-10-16 02:25:33,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 02:25:33,920 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1326313774, now seen corresponding path program 1 times [2021-10-16 02:25:33,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:33,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865700837] [2021-10-16 02:25:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:33,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:33,973 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-16 02:25:33,973 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:33,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865700837] [2021-10-16 02:25:33,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865700837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:33,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:33,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:33,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513496128] [2021-10-16 02:25:33,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:25:33,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:25:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:33,976 INFO L87 Difference]: Start difference. First operand 1125 states and 1516 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:34,057 INFO L93 Difference]: Finished difference Result 1915 states and 2588 transitions. [2021-10-16 02:25:34,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:25:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-16 02:25:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:34,064 INFO L225 Difference]: With dead ends: 1915 [2021-10-16 02:25:34,064 INFO L226 Difference]: Without dead ends: 801 [2021-10-16 02:25:34,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-10-16 02:25:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 786. [2021-10-16 02:25:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2955414012738853) internal successors, (1017), 785 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1017 transitions. [2021-10-16 02:25:34,128 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1017 transitions. Word has length 58 [2021-10-16 02:25:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:34,128 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1017 transitions. [2021-10-16 02:25:34,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1017 transitions. [2021-10-16 02:25:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-16 02:25:34,133 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:34,133 INFO L512 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-16 02:25:34,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 02:25:34,134 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash -906808733, now seen corresponding path program 1 times [2021-10-16 02:25:34,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:34,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937329656] [2021-10-16 02:25:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:34,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:34,290 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-16 02:25:34,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:34,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937329656] [2021-10-16 02:25:34,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937329656] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:25:34,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586545076] [2021-10-16 02:25:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:34,291 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:25:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:25:34,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:25:34,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-16 02:25:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:34,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-16 02:25:34,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:25:34,738 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-16 02:25:34,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:25:35,140 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-16 02:25:35,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586545076] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:35,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:25:35,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [8] total 12 [2021-10-16 02:25:35,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674818324] [2021-10-16 02:25:35,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:25:35,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:35,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:25:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-16 02:25:35,146 INFO L87 Difference]: Start difference. First operand 786 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:35,254 INFO L93 Difference]: Finished difference Result 1544 states and 2000 transitions. [2021-10-16 02:25:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:25:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-16 02:25:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:35,260 INFO L225 Difference]: With dead ends: 1544 [2021-10-16 02:25:35,261 INFO L226 Difference]: Without dead ends: 790 [2021-10-16 02:25:35,262 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 93.4ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-16 02:25:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-10-16 02:25:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 786. [2021-10-16 02:25:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2751592356687897) internal successors, (1001), 785 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1001 transitions. [2021-10-16 02:25:35,326 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1001 transitions. Word has length 59 [2021-10-16 02:25:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:35,327 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1001 transitions. [2021-10-16 02:25:35,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1001 transitions. [2021-10-16 02:25:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-16 02:25:35,330 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:35,330 INFO L512 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-16 02:25:35,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-16 02:25:35,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-16 02:25:35,544 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1977232412, now seen corresponding path program 1 times [2021-10-16 02:25:35,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:35,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557374264] [2021-10-16 02:25:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:35,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:35,620 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-16 02:25:35,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:35,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557374264] [2021-10-16 02:25:35,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557374264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:35,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:35,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:35,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488286929] [2021-10-16 02:25:35,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:25:35,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:25:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:35,624 INFO L87 Difference]: Start difference. First operand 786 states and 1001 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:35,701 INFO L93 Difference]: Finished difference Result 1384 states and 1770 transitions. [2021-10-16 02:25:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:25:35,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-16 02:25:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:35,707 INFO L225 Difference]: With dead ends: 1384 [2021-10-16 02:25:35,707 INFO L226 Difference]: Without dead ends: 630 [2021-10-16 02:25:35,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-10-16 02:25:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 617. [2021-10-16 02:25:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.228896103896104) internal successors, (757), 616 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 757 transitions. [2021-10-16 02:25:35,759 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 757 transitions. Word has length 59 [2021-10-16 02:25:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:35,759 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 757 transitions. [2021-10-16 02:25:35,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 757 transitions. [2021-10-16 02:25:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-16 02:25:35,762 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:35,762 INFO L512 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] [2021-10-16 02:25:35,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-16 02:25:35,763 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1340286050, now seen corresponding path program 1 times [2021-10-16 02:25:35,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:35,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940453805] [2021-10-16 02:25:35,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:35,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:35,938 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-16 02:25:35,938 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:35,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940453805] [2021-10-16 02:25:35,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940453805] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:25:35,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263196404] [2021-10-16 02:25:35,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:35,939 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:25:35,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:25:35,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:25:35,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-16 02:25:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:36,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-16 02:25:36,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:25:36,582 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-16 02:25:36,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:25:37,354 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-16 02:25:37,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263196404] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:37,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:25:37,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 5] imperfect sequences [8] total 13 [2021-10-16 02:25:37,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532777944] [2021-10-16 02:25:37,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 02:25:37,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:37,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 02:25:37,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-16 02:25:37,357 INFO L87 Difference]: Start difference. First operand 617 states and 757 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:37,736 INFO L93 Difference]: Finished difference Result 2176 states and 2676 transitions. [2021-10-16 02:25:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:25:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-16 02:25:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:37,749 INFO L225 Difference]: With dead ends: 2176 [2021-10-16 02:25:37,749 INFO L226 Difference]: Without dead ends: 1710 [2021-10-16 02:25:37,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 156.3ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-16 02:25:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-10-16 02:25:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1000. [2021-10-16 02:25:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 1.2392392392392393) internal successors, (1238), 999 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1238 transitions. [2021-10-16 02:25:37,878 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1238 transitions. Word has length 60 [2021-10-16 02:25:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:37,879 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1238 transitions. [2021-10-16 02:25:37,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1238 transitions. [2021-10-16 02:25:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-16 02:25:37,883 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:37,883 INFO L512 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, 1] [2021-10-16 02:25:37,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-16 02:25:38,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:25:38,109 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:38,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:38,109 INFO L82 PathProgramCache]: Analyzing trace with hash -630394364, now seen corresponding path program 1 times [2021-10-16 02:25:38,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:38,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623010916] [2021-10-16 02:25:38,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:38,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:25:38,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:38,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623010916] [2021-10-16 02:25:38,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623010916] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:25:38,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47003400] [2021-10-16 02:25:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:38,173 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:25:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:25:38,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:25:38,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-16 02:25:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:38,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:25:38,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:25:38,615 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-16 02:25:38,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:25:38,766 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-16 02:25:38,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47003400] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:38,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:25:38,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-16 02:25:38,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225008526] [2021-10-16 02:25:38,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:38,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:25:38,769 INFO L87 Difference]: Start difference. First operand 1000 states and 1238 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:38,893 INFO L93 Difference]: Finished difference Result 1701 states and 2103 transitions. [2021-10-16 02:25:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:38,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-16 02:25:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:38,903 INFO L225 Difference]: With dead ends: 1701 [2021-10-16 02:25:38,903 INFO L226 Difference]: Without dead ends: 1040 [2021-10-16 02:25:38,907 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:25:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-10-16 02:25:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 942. [2021-10-16 02:25:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.234856535600425) internal successors, (1162), 941 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1162 transitions. [2021-10-16 02:25:39,004 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1162 transitions. Word has length 60 [2021-10-16 02:25:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:39,005 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1162 transitions. [2021-10-16 02:25:39,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1162 transitions. [2021-10-16 02:25:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-16 02:25:39,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:39,009 INFO L512 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, 1] [2021-10-16 02:25:39,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-16 02:25:39,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-16 02:25:39,224 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash 799905747, now seen corresponding path program 1 times [2021-10-16 02:25:39,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:39,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7249375] [2021-10-16 02:25:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:39,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:39,311 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-16 02:25:39,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:39,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7249375] [2021-10-16 02:25:39,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7249375] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:25:39,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543051794] [2021-10-16 02:25:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:39,312 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:25:39,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:25:39,321 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:25:39,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-16 02:25:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:39,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-16 02:25:39,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:25:39,804 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-16 02:25:39,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:25:39,956 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-16 02:25:39,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543051794] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:39,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:25:39,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-16 02:25:39,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156670049] [2021-10-16 02:25:39,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:39,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:25:39,960 INFO L87 Difference]: Start difference. First operand 942 states and 1162 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:40,104 INFO L93 Difference]: Finished difference Result 1668 states and 2049 transitions. [2021-10-16 02:25:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-16 02:25:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:40,112 INFO L225 Difference]: With dead ends: 1668 [2021-10-16 02:25:40,113 INFO L226 Difference]: Without dead ends: 1109 [2021-10-16 02:25:40,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:25:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-10-16 02:25:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 943. [2021-10-16 02:25:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.2388535031847134) internal successors, (1167), 942 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1167 transitions. [2021-10-16 02:25:40,220 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1167 transitions. Word has length 60 [2021-10-16 02:25:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:40,220 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1167 transitions. [2021-10-16 02:25:40,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1167 transitions. [2021-10-16 02:25:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-16 02:25:40,223 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:40,224 INFO L512 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, 1] [2021-10-16 02:25:40,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-16 02:25:40,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-16 02:25:40,448 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1422165127, now seen corresponding path program 1 times [2021-10-16 02:25:40,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:40,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783863477] [2021-10-16 02:25:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:40,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-16 02:25:40,486 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:40,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783863477] [2021-10-16 02:25:40,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783863477] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:40,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:40,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-16 02:25:40,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736963637] [2021-10-16 02:25:40,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:25:40,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:40,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:25:40,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:40,489 INFO L87 Difference]: Start difference. First operand 943 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:40,623 INFO L93 Difference]: Finished difference Result 2143 states and 2688 transitions. [2021-10-16 02:25:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:25:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-16 02:25:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:40,632 INFO L225 Difference]: With dead ends: 2143 [2021-10-16 02:25:40,632 INFO L226 Difference]: Without dead ends: 1211 [2021-10-16 02:25:40,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:25:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-10-16 02:25:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1063. [2021-10-16 02:25:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.2448210922787193) internal successors, (1322), 1062 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1322 transitions. [2021-10-16 02:25:40,779 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1322 transitions. Word has length 60 [2021-10-16 02:25:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:40,779 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1322 transitions. [2021-10-16 02:25:40,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1322 transitions. [2021-10-16 02:25:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-16 02:25:40,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:40,783 INFO L512 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] [2021-10-16 02:25:40,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-16 02:25:40,783 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:40,784 INFO L82 PathProgramCache]: Analyzing trace with hash 510128812, now seen corresponding path program 1 times [2021-10-16 02:25:40,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:40,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869153546] [2021-10-16 02:25:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:40,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-16 02:25:40,847 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:40,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869153546] [2021-10-16 02:25:40,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869153546] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-16 02:25:40,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734096154] [2021-10-16 02:25:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:40,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-16 02:25:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:25:40,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-16 02:25:40,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-16 02:25:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:41,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-16 02:25:41,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-16 02:25:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 02:25:41,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-16 02:25:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-16 02:25:41,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734096154] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:41,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-16 02:25:41,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-10-16 02:25:41,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041596992] [2021-10-16 02:25:41,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:41,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:25:41,636 INFO L87 Difference]: Start difference. First operand 1063 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:41,759 INFO L93 Difference]: Finished difference Result 1525 states and 1892 transitions. [2021-10-16 02:25:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-16 02:25:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:41,767 INFO L225 Difference]: With dead ends: 1525 [2021-10-16 02:25:41,767 INFO L226 Difference]: Without dead ends: 1089 [2021-10-16 02:25:41,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:25:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-10-16 02:25:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 708. [2021-10-16 02:25:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.2347949080622347) internal successors, (873), 707 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 873 transitions. [2021-10-16 02:25:41,858 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 873 transitions. Word has length 61 [2021-10-16 02:25:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:41,859 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 873 transitions. [2021-10-16 02:25:41,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 873 transitions. [2021-10-16 02:25:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-16 02:25:41,862 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:41,862 INFO L512 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-16 02:25:41,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-16 02:25:42,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-16 02:25:42,077 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1779942747, now seen corresponding path program 1 times [2021-10-16 02:25:42,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:42,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591982666] [2021-10-16 02:25:42,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:42,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:42,179 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-16 02:25:42,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:42,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591982666] [2021-10-16 02:25:42,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591982666] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:42,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:42,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-16 02:25:42,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326452541] [2021-10-16 02:25:42,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 02:25:42,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:42,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 02:25:42,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:25:42,182 INFO L87 Difference]: Start difference. First operand 708 states and 873 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:42,431 INFO L93 Difference]: Finished difference Result 1350 states and 1635 transitions. [2021-10-16 02:25:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-16 02:25:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-16 02:25:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:42,436 INFO L225 Difference]: With dead ends: 1350 [2021-10-16 02:25:42,436 INFO L226 Difference]: Without dead ends: 577 [2021-10-16 02:25:42,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 43.1ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-16 02:25:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-10-16 02:25:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 464. [2021-10-16 02:25:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.1771058315334773) internal successors, (545), 463 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 545 transitions. [2021-10-16 02:25:42,508 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 545 transitions. Word has length 61 [2021-10-16 02:25:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:42,509 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 545 transitions. [2021-10-16 02:25:42,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 545 transitions. [2021-10-16 02:25:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-16 02:25:42,511 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:42,512 INFO L512 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-16 02:25:42,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-16 02:25:42,512 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash -984781663, now seen corresponding path program 1 times [2021-10-16 02:25:42,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:42,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976600296] [2021-10-16 02:25:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:42,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:42,585 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-16 02:25:42,585 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:42,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976600296] [2021-10-16 02:25:42,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976600296] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:42,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:42,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:25:42,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481778627] [2021-10-16 02:25:42,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:42,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:42,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:42,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:42,588 INFO L87 Difference]: Start difference. First operand 464 states and 545 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:42,693 INFO L93 Difference]: Finished difference Result 840 states and 974 transitions. [2021-10-16 02:25:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-16 02:25:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:42,697 INFO L225 Difference]: With dead ends: 840 [2021-10-16 02:25:42,697 INFO L226 Difference]: Without dead ends: 507 [2021-10-16 02:25:42,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-16 02:25:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 448. [2021-10-16 02:25:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.1565995525727069) internal successors, (517), 447 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 517 transitions. [2021-10-16 02:25:42,746 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 517 transitions. Word has length 62 [2021-10-16 02:25:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:42,746 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 517 transitions. [2021-10-16 02:25:42,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 517 transitions. [2021-10-16 02:25:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-16 02:25:42,748 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:42,749 INFO L512 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-16 02:25:42,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-16 02:25:42,749 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1150400836, now seen corresponding path program 1 times [2021-10-16 02:25:42,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:42,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908035139] [2021-10-16 02:25:42,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:42,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:42,870 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-16 02:25:42,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:42,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908035139] [2021-10-16 02:25:42,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908035139] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:42,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:42,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:25:42,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551182394] [2021-10-16 02:25:42,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:25:42,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:25:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:42,873 INFO L87 Difference]: Start difference. First operand 448 states and 517 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:43,096 INFO L93 Difference]: Finished difference Result 1300 states and 1491 transitions. [2021-10-16 02:25:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:25:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-10-16 02:25:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:43,104 INFO L225 Difference]: With dead ends: 1300 [2021-10-16 02:25:43,104 INFO L226 Difference]: Without dead ends: 1007 [2021-10-16 02:25:43,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-10-16 02:25:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 774. [2021-10-16 02:25:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.1617076326002587) internal successors, (898), 773 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 898 transitions. [2021-10-16 02:25:43,226 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 898 transitions. Word has length 79 [2021-10-16 02:25:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:43,227 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 898 transitions. [2021-10-16 02:25:43,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 898 transitions. [2021-10-16 02:25:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-16 02:25:43,230 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:43,231 INFO L512 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-16 02:25:43,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-16 02:25:43,231 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1659025345, now seen corresponding path program 1 times [2021-10-16 02:25:43,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:43,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004066621] [2021-10-16 02:25:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:43,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:43,309 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-16 02:25:43,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:43,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004066621] [2021-10-16 02:25:43,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004066621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:43,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:43,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:25:43,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769747804] [2021-10-16 02:25:43,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:25:43,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:25:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:25:43,314 INFO L87 Difference]: Start difference. First operand 774 states and 898 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:43,485 INFO L93 Difference]: Finished difference Result 1169 states and 1348 transitions. [2021-10-16 02:25:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:25:43,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-16 02:25:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:43,490 INFO L225 Difference]: With dead ends: 1169 [2021-10-16 02:25:43,491 INFO L226 Difference]: Without dead ends: 567 [2021-10-16 02:25:43,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:25:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-10-16 02:25:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 531. [2021-10-16 02:25:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.1566037735849057) internal successors, (613), 530 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 613 transitions. [2021-10-16 02:25:43,566 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 613 transitions. Word has length 100 [2021-10-16 02:25:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:43,567 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 613 transitions. [2021-10-16 02:25:43,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 613 transitions. [2021-10-16 02:25:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-16 02:25:43,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:25:43,570 INFO L512 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-16 02:25:43,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-16 02:25:43,571 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-16 02:25:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:25:43,571 INFO L82 PathProgramCache]: Analyzing trace with hash -31532579, now seen corresponding path program 1 times [2021-10-16 02:25:43,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:25:43,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186916129] [2021-10-16 02:25:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:25:43,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:25:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:25:43,649 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-16 02:25:43,649 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:25:43,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186916129] [2021-10-16 02:25:43,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186916129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:25:43,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:25:43,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:25:43,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545975969] [2021-10-16 02:25:43,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:25:43,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:25:43,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:25:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:43,653 INFO L87 Difference]: Start difference. First operand 531 states and 613 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:25:43,811 INFO L93 Difference]: Finished difference Result 774 states and 882 transitions. [2021-10-16 02:25:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:25:43,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-16 02:25:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:25:43,812 INFO L225 Difference]: With dead ends: 774 [2021-10-16 02:25:43,812 INFO L226 Difference]: Without dead ends: 0 [2021-10-16 02:25:43,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:25:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-16 02:25:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-16 02:25:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-16 02:25:43,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2021-10-16 02:25:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:25:43,815 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-16 02:25:43,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 02:25:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-16 02:25:43,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-16 02:25:43,819 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-16 02:25:43,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-16 02:25:43,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-16 02:25:43,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:43,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:44,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:45,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:46,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:46,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:46,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:46,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:46,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-16 02:25:55,873 INFO L853 garLoopResultBuilder]: At program point L564(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-16 02:25:55,874 INFO L853 garLoopResultBuilder]: At program point L564-1(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-16 02:25:55,874 INFO L857 garLoopResultBuilder]: For program point L300(lines 300 307) no Hoare annotation was computed. [2021-10-16 02:25:55,875 INFO L853 garLoopResultBuilder]: At program point L169(lines 157 171) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-16 02:25:55,875 INFO L853 garLoopResultBuilder]: At program point L169-1(lines 157 171) the Hoare annotation is: (let ((.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse14)) (.cse1 (= ~t1_st~0 0)) (.cse12 (= 2 ~t2_st~0)) (.cse15 (= 2 ~t1_st~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse13)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse12 .cse15 .cse13 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2021-10-16 02:25:55,875 INFO L853 garLoopResultBuilder]: At program point L169-2(lines 157 171) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-16 02:25:55,876 INFO L853 garLoopResultBuilder]: At program point L169-3(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse9 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse9 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse10 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-16 02:25:55,876 INFO L853 garLoopResultBuilder]: At program point L169-4(lines 157 171) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-16 02:25:55,876 INFO L853 garLoopResultBuilder]: At program point L169-5(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-16 02:25:55,877 INFO L853 garLoopResultBuilder]: At program point L207(lines 195 209) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-16 02:25:55,877 INFO L853 garLoopResultBuilder]: At program point L207-1(lines 195 209) the Hoare annotation is: (let ((.cse15 (= ~t2_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (= 2 ~t2_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse15)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2021-10-16 02:25:55,877 INFO L853 garLoopResultBuilder]: At program point L207-2(lines 195 209) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse2 (<= ~token~0 .cse12)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse8 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (<= .cse12 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t2_st~0) (not .cse8) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse8 .cse4 .cse6 (= ~m_pc~0 0) .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 (not .cse11) .cse8 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2021-10-16 02:25:55,878 INFO L853 garLoopResultBuilder]: 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 ~t1_st~0)) (.cse3 (< 0 ~t2_st~0)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< (+ ~local~0 1) ~token~0) .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 (= ~m_pc~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11 .cse8 .cse9))) [2021-10-16 02:25:55,878 INFO L853 garLoopResultBuilder]: At program point L207-4(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-16 02:25:55,878 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2021-10-16 02:25:55,878 INFO L853 garLoopResultBuilder]: At program point L207-5(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-16 02:25:55,879 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,879 INFO L857 garLoopResultBuilder]: For program point L177-2(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,879 INFO L857 garLoopResultBuilder]: For program point L177-3(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,879 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-16 02:25:55,879 INFO L857 garLoopResultBuilder]: For program point L177-5(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,880 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-16 02:25:55,880 INFO L857 garLoopResultBuilder]: For program point L177-6(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,880 INFO L857 garLoopResultBuilder]: For program point L177-8(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,880 INFO L857 garLoopResultBuilder]: For program point L177-9(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,880 INFO L857 garLoopResultBuilder]: For program point L177-11(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,881 INFO L857 garLoopResultBuilder]: For program point L177-12(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,881 INFO L857 garLoopResultBuilder]: For program point L177-14(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,881 INFO L857 garLoopResultBuilder]: For program point L177-15(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,881 INFO L857 garLoopResultBuilder]: For program point L177-17(lines 177 186) no Hoare annotation was computed. [2021-10-16 02:25:55,881 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 183) no Hoare annotation was computed. [2021-10-16 02:25:55,882 INFO L857 garLoopResultBuilder]: For program point L178-1(lines 178 183) no Hoare annotation was computed. [2021-10-16 02:25:55,882 INFO L857 garLoopResultBuilder]: For program point L178-2(lines 178 183) no Hoare annotation was computed. [2021-10-16 02:25:55,882 INFO L857 garLoopResultBuilder]: For program point L178-3(lines 178 183) no Hoare annotation was computed. [2021-10-16 02:25:55,882 INFO L853 garLoopResultBuilder]: At program point L46(lines 41 80) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2)) [2021-10-16 02:25:55,882 INFO L857 garLoopResultBuilder]: For program point L178-4(lines 178 183) no Hoare annotation was computed. [2021-10-16 02:25:55,883 INFO L857 garLoopResultBuilder]: For program point L178-5(lines 178 183) no Hoare annotation was computed. [2021-10-16 02:25:55,883 INFO L853 garLoopResultBuilder]: At program point L311(lines 273 325) the Hoare annotation is: (let ((.cse2 (= ~t2_pc~0 1)) (.cse22 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (not .cse0)) (.cse7 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (<= ~token~0 .cse22)) (.cse12 (<= .cse22 ~token~0)) (.cse16 (= ~t1_st~0 0)) (.cse15 (= 2 ~t2_st~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ~m_pc~0 1)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse24 (= ~m_st~0 ~E_1~0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (not .cse2)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse14 .cse8) (and .cse15 .cse16 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse8) (and .cse0 .cse21 .cse15 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse21 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse2 .cse11 .cse3 (< .cse22 ~token~0) .cse6 .cse8) (and .cse15 .cse19 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse10 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse19 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse10 .cse11 .cse23 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse23 .cse12 .cse3 .cse4 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse16 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse15 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse8) (and .cse0 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8)))) [2021-10-16 02:25:55,883 INFO L857 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2021-10-16 02:25:55,883 INFO L857 garLoopResultBuilder]: For program point L278-1(lines 273 325) no Hoare annotation was computed. [2021-10-16 02:25:55,884 INFO L857 garLoopResultBuilder]: For program point L577(lines 577 581) no Hoare annotation was computed. [2021-10-16 02:25:55,884 INFO L853 garLoopResultBuilder]: At program point L545-1(lines 370 582) the Hoare annotation is: (let ((.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse13 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse10 (= ~E_1~0 2)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (not .cse0) (= ~t1_st~0 0) .cse5 .cse13 .cse7 (= 0 ~t2_st~0) .cse8 .cse9 (not .cse2) .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse13 .cse7 .cse10) (and .cse0 .cse12 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11))) [2021-10-16 02:25:55,884 INFO L857 garLoopResultBuilder]: For program point L314(lines 314 321) no Hoare annotation was computed. [2021-10-16 02:25:55,885 INFO L853 garLoopResultBuilder]: At program point L283(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-16 02:25:55,885 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-16 02:25:55,885 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2021-10-16 02:25:55,885 INFO L860 garLoopResultBuilder]: At program point L583(lines 530 588) the Hoare annotation is: true [2021-10-16 02:25:55,886 INFO L857 garLoopResultBuilder]: For program point L286(lines 286 293) no Hoare annotation was computed. [2021-10-16 02:25:55,886 INFO L853 garLoopResultBuilder]: At program point L188(lines 176 190) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-16 02:25:55,886 INFO L853 garLoopResultBuilder]: At program point L188-1(lines 176 190) the Hoare annotation is: (let ((.cse4 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse1 (= 2 ~t2_st~0)) (.cse16 (= 2 ~t1_st~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse14 (not .cse4)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12) (and .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12)))) [2021-10-16 02:25:55,886 INFO L853 garLoopResultBuilder]: At program point L188-2(lines 176 190) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-16 02:25:55,887 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2021-10-16 02:25:55,887 INFO L853 garLoopResultBuilder]: At program point L89(lines 89 93) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse15 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= 2 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse10 (not .cse0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (< 0 ~t1_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse11 (= 0 ~t2_st~0)) (.cse14 (not .cse1)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t2_st~0) .cse8 .cse9) (and .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse12 .cse13 .cse8 .cse9) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse16 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse15 .cse2 .cse3 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse16 .cse10 .cse1 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse14 .cse8 .cse9)))) [2021-10-16 02:25:55,887 INFO L853 garLoopResultBuilder]: At program point L188-3(lines 176 190) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse11 (= ~m_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 (<= ~token~0 (+ 2 ~local~0)) .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse11 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8))) [2021-10-16 02:25:55,887 INFO L853 garLoopResultBuilder]: At program point L188-4(lines 176 190) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-16 02:25:55,888 INFO L853 garLoopResultBuilder]: At program point L188-5(lines 176 190) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-16 02:25:55,888 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-16 02:25:55,888 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,888 INFO L853 garLoopResultBuilder]: At program point L125(lines 125 129) the Hoare annotation is: (let ((.cse19 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (+ ~local~0 1))) (let ((.cse5 (= ~m_st~0 ~E_1~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse17 (<= ~token~0 .cse20)) (.cse16 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse18 (<= .cse20 ~token~0)) (.cse12 (not .cse0)) (.cse13 (= ~t1_st~0 0)) (.cse1 (< 0 ~t2_st~0)) (.cse4 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse14 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse9 (not .cse19)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse16 .cse1 .cse2 .cse3 .cse18 .cse4 .cse15 .cse6 .cse9 .cse10 .cse11) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse14 .cse6 .cse10 .cse11) (and .cse0 .cse17 .cse16 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse19 .cse2 .cse18 .cse4 .cse15 .cse6 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11)))) [2021-10-16 02:25:55,888 INFO L857 garLoopResultBuilder]: For program point L158-2(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-3(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-5(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-6(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-8(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-9(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-11(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-12(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-14(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-15(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L158-17(lines 158 167) no Hoare annotation was computed. [2021-10-16 02:25:55,889 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-16 02:25:55,890 INFO L857 garLoopResultBuilder]: For program point L159-1(lines 159 164) no Hoare annotation was computed. [2021-10-16 02:25:55,890 INFO L857 garLoopResultBuilder]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-16 02:25:55,890 INFO L857 garLoopResultBuilder]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-16 02:25:55,890 INFO L857 garLoopResultBuilder]: For program point L159-4(lines 159 164) no Hoare annotation was computed. [2021-10-16 02:25:55,890 INFO L857 garLoopResultBuilder]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-16 02:25:55,890 INFO L853 garLoopResultBuilder]: At program point L326(lines 267 331) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7))) [2021-10-16 02:25:55,891 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,891 INFO L857 garLoopResultBuilder]: For program point L196-2(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,891 INFO L857 garLoopResultBuilder]: For program point L196-3(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,891 INFO L853 garLoopResultBuilder]: At program point L97-1(lines 85 116) the Hoare annotation is: (let ((.cse0 (= ~t2_pc~0 1))) (let ((.cse19 (+ ~local~0 1)) (.cse3 (< 0 ~t1_st~0)) (.cse17 (= ~m_pc~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse5 (= ~E_M~0 2)) (.cse15 (not .cse0)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2))) (let ((.cse8 (or (and .cse17 .cse12 .cse1 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse15 .cse6 .cse7) (and (= ~t1_pc~0 1) .cse17 .cse12 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7))) (.cse9 (<= ~token~0 .cse19)) (.cse18 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse10 (<= .cse19 ~token~0)) (.cse11 (= 0 ~t2_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse4 (= ~m_pc~0 0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse11 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse15 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse13 .cse14 .cse15 .cse6 .cse7) (and (or (and .cse16 .cse0 .cse17 .cse12 .cse1 .cse2 .cse5 .cse6 .cse7 .cse18) (and .cse16 .cse0 .cse17 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7)) .cse13 .cse14) (and .cse9 (not .cse18) .cse0 .cse17 .cse12 .cse10 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse16 .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7))))) [2021-10-16 02:25:55,892 INFO L857 garLoopResultBuilder]: For program point L196-5(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,892 INFO L857 garLoopResultBuilder]: For program point L196-6(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,892 INFO L857 garLoopResultBuilder]: For program point L196-8(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,892 INFO L857 garLoopResultBuilder]: For program point L196-9(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,892 INFO L857 garLoopResultBuilder]: For program point L196-11(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,893 INFO L857 garLoopResultBuilder]: For program point L196-12(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,893 INFO L857 garLoopResultBuilder]: For program point L196-14(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,893 INFO L857 garLoopResultBuilder]: For program point L196-15(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,893 INFO L857 garLoopResultBuilder]: For program point L196-17(lines 196 205) no Hoare annotation was computed. [2021-10-16 02:25:55,893 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-10-16 02:25:55,893 INFO L857 garLoopResultBuilder]: For program point L197-1(lines 197 202) no Hoare annotation was computed. [2021-10-16 02:25:55,894 INFO L857 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-10-16 02:25:55,894 INFO L857 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-10-16 02:25:55,894 INFO L857 garLoopResultBuilder]: For program point L197-4(lines 197 202) no Hoare annotation was computed. [2021-10-16 02:25:55,894 INFO L857 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-10-16 02:25:55,895 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-16 02:25:55,895 INFO L853 garLoopResultBuilder]: At program point L297(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-16 02:25:55,895 INFO L853 garLoopResultBuilder]: At program point L133-1(lines 121 152) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse0)) (.cse11 (= ~t1_st~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= 2 ~t1_st~0)) (.cse12 (< 0 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse16 (+ ~local~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse13 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse15 .cse8 .cse9) (and (or (and .cse11 .cse12 .cse3 .cse4 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse8 .cse9) (and .cse11 (= ~t2_pc~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse14 .cse15) (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse5 (< .cse16 ~token~0) .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 (<= 2 ~t1_st~0) .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 (<= ~token~0 .cse16) .cse2 .cse12 .cse3 .cse4 (<= .cse16 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9)))) [2021-10-16 02:25:55,896 INFO L853 garLoopResultBuilder]: At program point L67(lines 41 80) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse3 (= ~t2_pc~0 1))) (let ((.cse10 (= 0 ~t2_st~0)) (.cse13 (not .cse3)) (.cse2 (= 2 ~t1_st~0)) (.cse1 (= 2 ~t2_st~0)) (.cse14 (not .cse0)) (.cse15 (= ~t1_st~0 0)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse9 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) .cse1 .cse2 .cse3 (= ~m_pc~0 1) .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse14 .cse15 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8) (and .cse1 .cse14 .cse15 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8)))) [2021-10-16 02:25:55,901 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:25:56,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:25:56 BoogieIcfgContainer [2021-10-16 02:25:56,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:25:56,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:25:56,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:25:56,057 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:25:56,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:25:29" (3/4) ... [2021-10-16 02:25:56,062 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-16 02:25:56,088 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2021-10-16 02:25:56,090 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-10-16 02:25:56,092 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-16 02:25:56,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-16 02:25:56,301 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 02:25:56,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:25:56,304 INFO L168 Benchmark]: Toolchain (without parser) took 29393.45 ms. Allocated memory was 113.2 MB in the beginning and 325.1 MB in the end (delta: 211.8 MB). Free memory was 83.5 MB in the beginning and 275.1 MB in the end (delta: -191.6 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.1 GB. [2021-10-16 02:25:56,304 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 113.2 MB. Free memory is still 69.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:25:56,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.67 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 83.2 MB in the beginning and 129.0 MB in the end (delta: -45.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-16 02:25:56,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.71 ms. Allocated memory is still 157.3 MB. Free memory was 129.0 MB in the beginning and 125.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:25:56,308 INFO L168 Benchmark]: Boogie Preprocessor took 89.50 ms. Allocated memory is still 157.3 MB. Free memory was 125.8 MB in the beginning and 123.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:25:56,308 INFO L168 Benchmark]: RCFGBuilder took 1946.90 ms. Allocated memory is still 157.3 MB. Free memory was 123.1 MB in the beginning and 88.1 MB in the end (delta: 35.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. [2021-10-16 02:25:56,309 INFO L168 Benchmark]: TraceAbstraction took 26488.04 ms. Allocated memory was 157.3 MB in the beginning and 325.1 MB in the end (delta: 167.8 MB). Free memory was 87.3 MB in the beginning and 291.9 MB in the end (delta: -204.5 MB). Peak memory consumption was 162.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:25:56,309 INFO L168 Benchmark]: Witness Printer took 245.45 ms. Allocated memory is still 325.1 MB. Free memory was 291.9 MB in the beginning and 275.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-16 02:25:56,312 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 113.2 MB. Free memory is still 69.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 507.67 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 83.2 MB in the beginning and 129.0 MB in the end (delta: -45.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 107.71 ms. Allocated memory is still 157.3 MB. Free memory was 129.0 MB in the beginning and 125.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 89.50 ms. Allocated memory is still 157.3 MB. Free memory was 125.8 MB in the beginning and 123.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1946.90 ms. Allocated memory is still 157.3 MB. Free memory was 123.1 MB in the beginning and 88.1 MB in the end (delta: 35.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26488.04 ms. Allocated memory was 157.3 MB in the beginning and 325.1 MB in the end (delta: 167.8 MB). Free memory was 87.3 MB in the beginning and 291.9 MB in the end (delta: -204.5 MB). Peak memory consumption was 162.9 MB. Max. memory is 16.1 GB. * Witness Printer took 245.45 ms. Allocated memory is still 325.1 MB. Free memory was 291.9 MB in the beginning and 275.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26259.4ms, OverallIterations: 23, TraceHistogramMax: 4, EmptinessCheckTime: 84.7ms, AutomataDifference: 4108.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 12053.0ms, InitialAbstractionConstructionTime: 16.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3520 SDtfs, 4838 SDslu, 4429 SDs, 0 SdLazy, 930 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1106.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 576.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1748occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1901.1ms AutomataMinimizationTime, 23 MinimizatonAttempts, 3774 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 288 NumberOfFragments, 6220 HoareAnnotationTreeSize, 33 FomulaSimplifications, 179031 FormulaSimplificationTreeSizeReduction, 2731.3ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 47486 FormulaSimplificationTreeSizeReductionInter, 9294.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 224.2ms SsaConstructionTime, 850.4ms SatisfiabilityAnalysisTime, 4478.2ms InterpolantComputationTime, 1634 NumberOfCodeBlocks, 1634 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1901 ConstructedInterpolants, 0 QuantifiedInterpolants, 4748 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 33 InterpolantComputations, 28 PerfectInterpolantSequences, 482/493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || ((((((((((((__retres1 == 0 && 2 == t2_st) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || (((((((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_st == 0 && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) || ((((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2)) || ((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((((((t2_pc == 1 && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && token <= local + 1) && local + 1 <= token) && 0 == t2_st)) || (((((((t2_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && 0 == t2_st) && token <= local) && local <= token)) || ((((((((E_2 == 2 && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((E_2 == 2 && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((((token <= local + 1 && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((!(t1_pc == 1) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((m_pc == t1_pc && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && __retres1 == 0)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) RESULT: Ultimate proved your program to be correct! [2021-10-16 02:25:56,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6304b6dc-ff09-4254-9ea0-5c0c08860fa2/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...